A Survey on Hardware Architectures for Montgomery Modular Multiplication Algorithm
R. Ambika · 2013
Abstract: The motivation for studying high speed and space efficient algorithms for modular multiplications comes from their applications in public – key cryptography. The Montgomery multiplication algorithm speeds up the modular multiplications and squaring required for the exponentiation. This paper presents new architectures for the computation of modular multiplication and exponentiation using Montgomery multiplication (MM) algorithm. Montgomery modular multiplication (MMM) is one of the fundamental operations used in cryptographic algorithms such as RSA, Diffie-Hellman key distribution and Elliptic Curve cryptosystems. In this paper we compare the new hardware architectures that are able to perform Montgomery multiplication.