Title :
The Montgomery inverse and its applications
Author :
Kaliski, Burton S., Jr.
Author_Institution :
RSA Lab., RSA Data Security Inc., Redwood City, CA, USA
fDate :
8/1/1995 12:00:00 AM
Abstract :
The Montgomery inverse of b module a is b-12n mod a, where n is the number of bits in a. The right-shifting binary algorithm for modular inversion is shown naturally to compute the new inverse in fewer operations than the ordinary modular inverse. The new inverse facilitates recent work by Koc on modular exponentiation and has other applications in cryptography
Keywords :
digital arithmetic; Montgomery inverse; binary algorithm; cryptography; modular exponentiation; modular inversion; Arithmetic; Cities and towns; Data security; Public key; Public key cryptography; Seminars;
Journal_Title :
Computers, IEEE Transactions on
