Published November 2, 2013 | Version 9996895
Journal article Open

Modified Montgomery for RSA Cryptosystem

Description

Encryption and decryption in RSA are done by modular exponentiation which is achieved by repeated modular multiplication. Hence efficiency of modular multiplication directly determines the efficiency of RSA cryptosystem. This paper designs a Modified Montgomery Modular Multiplication in which addition of operands is computed by 4:2 compressor. The basic logic operations in addition are partitioned over two iterations such that parallel computations are performed. This reduces the critical path delay of proposed Montgomery design. The proposed design and RSA are implemented on Virtex 2 and Virtex 5 FPGAs. The two factors partitioning and parallelism have improved the frequency and throughput of proposed design.

Files

9996895.pdf

Files (205.4 kB)

Name Size Download all
md5:c2e6075ec919b218de8eceb658ce09b0
205.4 kB Preview Download