samuele-andreoli opened a new issue #73: Use trick for g = n+1 in Paillier encryption URL: https://github.com/apache/incubator-milagro-crypto-c/issues/73 In the Paillier encryption the form of g = n+1 can be exploited to reduce the modular exponentiation g^pt to a simple multiplication. g^pt mod n^2 = (n+1)^pt mod n^2 = 1 + n*pt + n^2*(other terms) mod n^2 = 1 + n * pt
---------------------------------------------------------------- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: [email protected] With regards, Apache Git Services --------------------------------------------------------------------- To unsubscribe, e-mail: [email protected] For additional commands, e-mail: [email protected]
