The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.03 - June (1996 vol.16)
pp: 26-33
ABSTRACT
This article discusses several Montgomery multiplication algorithms, two of which have been proposed before. We describe three additional algorithms, and analyze in detail the space and time requirements of all five methods. These algorithms have been implemented in C and in assembler. The analyses and actual performance results indicate that the Coarsely Integrated Operand Scanning (CIOS) method, detailed in this article, is the most efficient of all five algorithms, at least for the general class of processor we considered. The Montgomery multiplication methods constitute the core of the modular exponentiation operation which is the most popular method used in public-key cryptography for encrypting and signing digital data.
INDEX TERMS
Modular multiplication and exponentiation, Montgomery method, RSA and Diffie-Hellman cryptosystems.
CITATION
Çetin Kaya Koç, Tolga Acar, Burton S. Kaliski, Jr., "Analyzing and Comparing Montgomery Multiplication Algorithms", IEEE Micro, vol.16, no. 3, pp. 26-33, June 1996, doi:10.1109/40.502403
19 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool