Analyzing and comparing Montgomery multiplication algorithms
- 1 June 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Micro
- Vol. 16 (3), 26-33
- https://doi.org/10.1109/40.502403
Abstract
Montgomery multiplication methods constitute the core of modular exponentiation, the most popular operation for encrypting and signing digital data in public-key cryptography. In this article, we study the operations involved in computing the Montgomery product, describe several high-speed, space-efficient algorithms for computing MonPro(a, b), and analyze their time and space requirements. Our focus is to collect several alternatives for Montgomery multiplication, three of which are new. However, we do not compare the Montgomery techniques to other modular multiplication approaches.Keywords
This publication has 5 references indexed in Scilit:
- Systolic Modular MultiplicationPublished by Springer Nature ,2001
- Can Montgomery parasites be avoided? A design methodology based on key and cryptosystem modificationsDesigns, Codes and Cryptography, 1995
- Modular Multiplication Without Trial DivisionMathematics of Computation, 1985
- A method for obtaining digital signatures and public-key cryptosystemsCommunications of the ACM, 1978
- New directions in cryptographyIEEE Transactions on Information Theory, 1976