The Community for Technology Leaders
Green Image
Issue No. 08 - August (1995 vol. 44)
ISSN: 0018-9340
pp: 1064-1065
<p><it>Abstract</it>— The <it>Montgomery inverse</it> of <it>b</it> modulo <it>a</it> is <it>b</it><super>−1</super>2<super><it>n</it></super> mod <it>a</it>, where <it>n</it> is the number of bits in <it>a</it>. 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 Koç on modular exponentiation and has other applications in cryptography.</p>
Burton S. Kaliski, "The Montgomery Inverse and Its Applications", IEEE Transactions on Computers, vol. 44, no. , pp. 1064-1065, August 1995, doi:10.1109/12.403725
80 ms
(Ver 3.3 (11022016))