Issue No. 07 - July (2000 vol. 49)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.863048
<p><b>Abstract</b>—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.</p>
Modular arithmetic, modular inverse, almost inverse, Montgomery multiplication, cryptography.
E. Savas and &. Koç, "The Montgomery Modular Inverse-Revisited," in IEEE Transactions on Computers, vol. 49, no. , pp. 763-766, 2000.