Homomorphic Encryption For Division With RSA
Published in
2 min readAug 16, 2018
With RSA, we have a partially homomorphic crypto-system, where we can take two values and then cipher them. Next we can divide them, and the deciphered result will be the integer division of the two values. For this we use the extended euclidean algorithm to find the inverse mod N value of cipher which performs the division.
