Efficient interleaved modular multiplication based on sign detection

Data Security is the most important issue nowadays. A lot of cryptosystems are introduced to provide security. Public key cryptosystems are the most common cryptosystems used for securing data communication. Modular multiplication is the basic operation of common public key cryptosystems such as RSA, Diffie-Hellman key agreement (DH), ElGamal and ECC. Much research is now directed to reduce overall time consumed by modular multiplication operation. In this paper, we propose a parallelized version of the standard interleaved modular multiplication algorithm with a corresponding architecture. The proposed algorithm, EIMM, is based on an enhanced sign detection technique proposed by AbdelFattah et al. EIMM computes all possible intermediate results in parallel using the enhanced sign detection technique. EIMM computes modular multiplication without a pre computational phase or predefined sets for moduli. The proposed architecture is compared with a recent architecture, MIMM, proposed by AbdelFattah et al. Our architecture speeds up modular multiplication operation up to 1.99x compared with MIMM architecture. Additionally, our architecture improves area-time product. Hardware implementations of the existing and proposed algorithms have been introduced.