An Efficient RSA Cryptosystem using Fast Montgomery Multiplier

Abstract

An effective data security is crucial in today’s digital world. For secure data transmission, an optimized RSA (Rivest–Shamir–Adleman) cryptosystem is needed as it offers high security. Multipliers that are used in these cryptosystems generally incorporate the process of modular exponentiation that can be realized by performing time-consuming modular-multiplication repeatedly. In order to enhance the speed of modular multiplication process, an optimized montgomery multiplier acts as an indispensable component. The existing cryptosystem uses montgomery multiplier with Carry Save Adder (CSA) and simulated using Xilinx ISE. In the proposed methodology, an existing architecture implemented using CSA adder is replaced with the Reverse Carry Propagate (RCP)adder. The primary objective of the paper is in the vicinity to minimize the area occupation and the latency and thereby increasing the efficiency of RSA cryptosystem. The multiplier using RCP adder surpasses other montgomery multipliers with respect to power, latency, and device utilization. The suggested multiplier acts as a better preference to employ in cryptographic, filtering and signal processing applications.