Publication Type : Conference Paper
Publisher : 2017 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC)
Source : 2017 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), IEEE, Coimbatore, India (2017)
Url : https://ieeexplore.ieee.org/document/8524218
Campus : Bengaluru
School : School of Engineering
Center : Electronics Communication and Instrumentation Forum (ECIF)
Department : Electronics and Communication
Year : 2017
Abstract : Rivest, Shamir, Adleman (RSA) algorithm can be used in cryptography to send confidential messages in secure manner. RSA cryptosystem is based on modular multiplication to factorize the large integers. Montgomery modular multiplication can be used as modular multiplication because it is one of the efficient and fastest modular multiplication. Montgomery algorithm is based on add and shift operation, so Carry save adder (CSA) can be used in order to overcome the carry propagation at each addition. In this Montgomery multiplier, the CSA choses the operands and converts the addition result from carry save format to binary form. Accordingly, the architecture can use less hardware and give short critical path delay to do one modular multiplication. In this paper, the Montgomery modular multiplication uses a modified or configurable Carry save adder (CCSA). The CCSA is designed with one full adder and two half adders to reduce the delay. Still CCSA suffers from high power consumption. In order to reduce the power consumption, the full adder used in CCSA with two multiplexers has been proposed. The proposed Montgomery modular multiplier has the capability to provide 26% average reduction in power when compared with previous designs.
Cite this Research Publication : P. Priyadarsi Mahapatra and S. Agrawal, “RSA Cryptosystem with Modified Montgomery Modular Multiplier”, in 2017 IEEE International Conference on Computational Intelligence and Computing Research (ICCIC), Coimbatore, India, 2017.