Abstract
The Montgomery inverse is used in cryptography for the computation of modular inverse of b modulo a, where a is a prime. We analyse existing algorithms from the point of view of their hardware implementation. We propose a new, hardware-optimal algorithm for the calculation of the classical modular inverse. The left-shift binary algorithm is shown to naturally calculate the classical modular inverse in fewer operations than the algorithm derived from the Montgomery inverse.
Chapter PDF
References
P. L. Montgomery: Modular Multiplication Without Trial Division. Mathematics of Computation 44 No. 170 (1985) 519–521
B. S. Kaliski Jr.: The Montgomery Inverse and Its Application. IEEE Transaction on Computers 44 No. 8 (1995) 1064–1065
E. Savaş and Ç. K. Koç: The Montgomery Modular Inverse-Revisited. IEEE Transaction on Computers 49 No. 7 (2000)
D. E. Knuth: The Art of Computer Programming 2 / Seminumerical Algorithms. Addison-Wesley, Reading, Mass. Third edition (1998)
Ç. K. Koç: High-Radix and Bit Recoding Techniques For Modular Exponentiation. Int’l J. Computer Mathematics 40 (1991) 139–156
J.-J. Quisquarter and C. Couvreur: Fast Decipherment Algorithm for RSA Publickey Cryptosystem. Electronics Letters 18 No. 21 (1982) 905–907
W. Diffie and M. E. Hellman: New Directions in Cryptography. IEEE Transactions on Information Theory 22 (1976) 644–654.
Nat’l Inst. of Standards and Technology (NIST). FIPS Publication 186: Digital Signature Standard (1994)
N. Koblitz: Elliptic Curve Cryptosystem. Mathematics of Computation 48 No. 177 (1987) 203–209
A. J. Menezes: Elliptic curve Public Key Cryptosystem. Kluwer Academic Publishers, Boston, MA (1993)
Ö. ER~gecioR~glu and Ç. K. Koç: Exponentiation Using Canonical recoding. Theoretical Computer Science 129 No. 2 (1994) 407–717
R. T. Gregory and E. V. Krishnamurthy: Methods and Applications of Error-free Computation. Springer-Verlag, New York, Berlin, Heidelberg, Tokyo (1984)
K. H. Rosen: Elementary Number Theory and Its Applications. Addison-Wesley, Reading, Massachusetts (1993)
J. D. Dworkin, P. M. Glaser, M. J. Torla, A. Vadekar, R. J. Lambert, S. A. Vanstone: Finite Field Inverse Circuit. US Patent 6,009,450 (1999)
B. Bruner, A. Curiger, M. Hofstetter: On Computing Multiplicative Inverse in GF(2m). IEEE Trans. Computer 42 (1993) 1010–1015
M. Morháč and R. Lórencz: A Modular System for Solving Linear Equations Exactly, I. Architecture and Numerical Algorithms. Computers and Artificial Intelligence 11 No. 4 (1992) 351–361
R. Lórencz and M. Morháč: Modular System for Solving Linear Equations Exactly, II. Hardware Realization. Computers and Artificial Intelligence 11 No. 5 (1992) 497–507
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lórencz, R. (2003). New Algorithm for Classical Modular Inverse. In: Kaliski, B.S., Koç, ç.K., Paar, C. (eds) Cryptographic Hardware and Embedded Systems - CHES 2002. CHES 2002. Lecture Notes in Computer Science, vol 2523. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-36400-5_6
Download citation
DOI: https://doi.org/10.1007/3-540-36400-5_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-00409-7
Online ISBN: 978-3-540-36400-9
eBook Packages: Springer Book Archive