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.
No takes yet. Share an insight, caveat, or question.
Savaş et al. (2000) studied this question.
Synapse has enriched 3 closely related papers on similar clinical questions. Consider them for comparative context: