Research Article
Radix-4 Modified Interleaved Modular Multiplier Based on Sign Detection
@INPROCEEDINGS{10.1007/978-3-642-27308-7_45, author={Mohamed Nassar and Layla El-Sayed}, title={Radix-4 Modified Interleaved Modular Multiplier Based on Sign Detection}, proceedings={Advances in Computer Science and Information Technology. Computer Science and Engineering. Second International Conference, CCSIT 2012, Bangalore, India, January 2-4, 2012. Proceedings, Part II}, proceedings_a={CCSIT PATR II}, year={2012}, month={11}, keywords={efficient architecture carry-save adder sign detection sign estimation technique modular multiplication FPGA RSA}, doi={10.1007/978-3-642-27308-7_45} }- Mohamed Nassar
Layla El-Sayed
Year: 2012
Radix-4 Modified Interleaved Modular Multiplier Based on Sign Detection
CCSIT PATR II
Springer
DOI: 10.1007/978-3-642-27308-7_45
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.
