Design and Implementation of 16-bit Montgomery Modular Multiplication

Abstract

Modular multiplication is the core operation in public-key cryptographic algorithms such as RSA and the Diffie-Hellman algorithm. The efficiency of the modular multiplier plays a crucial role in the performance of these cryptographic methods. In this paper we are designing a 16-bit Montgomery modular multiplication with PASTA ADDER. In addition, a mechanism that can detect and skip the unnecessary carry-save addition operations in the PASTA architecture while maintaining the short critical path delay is developed. Experimental results show that the proposed Montgomery modular multiplier can achieve higher performance and significant area–time product improvement when compared with previous designs.