Radix-4 modified interleaved Modular multiplier based on sign detection

Abstract

Data Security is the most important issue nowadays. A lot of cryptosystems are introduced to provide security. Public key cryptosystems are most common cryptosystems used for securing data communication. Modular multiplication is the basic operation of a lot of public key cryptosystems such as RSA, Diffie-Hellman key agreement (DH), ElGamal, and ECC. Abd-el-fatah et al. introduced an enhanced architecture for computing modular multiplication of two large numbers X and Y modulo given M. In this paper, a modification on that architecture is introduced. The proposed design computes modular multiplication by scanning two bits per iteration instead of one bit. The proposed design for 1024-bit precision reduced overall time by 38% compared to the design of Abd-el-fatah et al. © Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2012.