search

Co-dfns / mystika

High-end Cryptographic Library
GNU Affero General Public License v3.0
43 stars 26 forks source link

Modular Exponentiation #35

Open arcfide opened 7 years ago

Tikhon03 commented 7 years ago

The Montgomery ladder is already in my code base on Github. Barret reduction is available. The Extended Lehmer GCD is available, so modular inverse is around the corner. Once the modular inverse is available then Montgomery reduction can be fixed. Once Montgomery reduction is fixed, then we can complete the modular Exponentiation algorithm. I think it is reasonable to expect that I can get the modular inverse and Montgomery reduction working by the end of today. Exponentiation will have to wait until next week at the earliest.

Tikhon03 commented 7 years ago

Ok. So I said it will have to wait until next week, but the current code includes a version with Barret reduction. Next week I will do a version with Montgomery reduction, which I currently expect to be the ultimate winner.

arcfide commented 7 years ago

Once this is tested and the like, I think it might be good to insert it as one of the public interfaces in the README.

-- Aaron W. Hsu | arcfide@sacrideo.us | http://www.sacrideo.us Support my Open Work: http://www.gratipay.com/Co-dfns/

From: Tikhon03 Sent: Thursday, June 1, 2017 3:57 PM To: arcfide/mystika Cc: Aaron W. Hsu; Author Subject: Re: [arcfide/mystika] Modular Exponentiation (#35)

Ok. So I said it will have to wait until next week, but the current code includes a version with Barret reduction. Next week I will do a version with Montgomery reduction, which I currently expect to be the ultimate winner. — You are receiving this because you authored the thread. Reply to this email directly, view it on GitHub, or mute the thread.