Modified Montgomery Modular Inversion with Reduced Number of Multiplications
- 1 January 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21593442,p. 1-4
Abstract
In this paper, a modified algorithm to compute Montgomery modular Inverse that requires less number of Montgomery modular multiplications compared to the best known methods in literature is proposed. A method is also suggested for computing the Montgomery inverse using a modular multiplication algorithm recently proposed by Rainer et al. to compute the modular product. Our approaches are optimal in terms of computational delay and the practical efficiency has been evaluated for an operand length of 521-bit that is of interest to practical cryptographic applications. The proposed algorithms are expected to be of eminent importance for high-speed arithmeticKeywords
This publication has 8 references indexed in Scilit:
- Advances in Elliptic Curve Cryptography2005
- Improved Montgomery modular inverse algorithmElectronics Letters, 2004
- The Montgomery modular inverse-revisitedIEEE Transactions on Computers, 2000
- Analyzing and comparing Montgomery multiplication algorithmsIEEE Micro, 1996
- The Montgomery inverse and its applicationsIEEE Transactions on Computers, 1995
- Elliptic Curve Public Key Cryptosystems1993
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978