Title :
The Montgomery modular inverse-revisited
Author :
Savas, E. ; Koç, Ç K.
Author_Institution :
Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
fDate :
7/1/2000 12:00:00 AM
Abstract :
We modify an algorithm given by Kaliski to compute the Montgomery inverse of an integer modulo a prime number. We also give a new definition of the Montgomery inverse, and introduce efficient algorithms for computing the classical modular inverse, the Kaliski-Montgomery inverse, and the new Montgomery inverse. The proposed algorithms are suitable for software implementations on general-purpose microprocessors
Keywords :
cryptography; digital arithmetic; Montgomery inverse; Montgomery modular inverse; Montgomery multiplication; cryptography; modular arithmetic; modular inverse; Digital arithmetic; Elliptic curve cryptography; Iterative methods; Read only memory; Reduced instruction set computing; Research and development; Scientific computing; Software algorithms; Testing; Wires;
Journal_Title :
Computers, IEEE Transactions on
