Modified Montgomery for RSA Cryptosystem

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. Keywords—RSA, Montgomery modular multiplication, 4:2 compressor, FPGA.

[1]  Ming-Der Shieh,et al.  A New Modular Exponentiation Architecture for Efficient Design of RSA Cryptosystem , 2008, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[2]  M. McLoone,et al.  Fast Montgomery modular multiplication and RSA cryptographic processor architectures , 2003, The Thrity-Seventh Asilomar Conference on Signals, Systems & Computers, 2003.

[3]  Bernard P. Zajac.  Applied cryptography: Protocols, algorithms, and source code in C , 1994 .

[4]  Ming-Der Shieh,et al.  A New Algorithm for High-Speed Modular Multiplication Design , 2009, IEEE Transactions on Circuits and Systems I: Regular Papers.

[5]  Himanshu Thapliyal,et al.  Modified Montgomery modular multiplication using 4:2 compressor and CSA adder , 2006, Third IEEE International Workshop on Electronic Design, Test and Applications (DELTA'06).

[6]  C. D. Walter,et al.  Systolic Modular Multiplication , 1993, IEEE Trans. Computers.

[7]  Lei Yang,et al.  An efficient CSA architecture for montgomery modular multiplication , 2007, Microprocess. Microsystems.

[8]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

[9]  Lingamneni Avinash,et al.  Novel Architectures for High-Speed and Low-Power 3-2, 4-2 and 5-2 Compressors , 2007, 20th International Conference on VLSI Design held jointly with 6th International Conference on Embedded Systems (VLSID'07).

[10]  Colin D. Walter,et al.  Hardware Implementation of Montgomery's Modular Multiplication Algorithm , 1993, IEEE Trans. Computers.

[11]  J. McCanny,et al.  Modified Montgomery modular multiplication and RSA exponentiation techniques , 2004 .

[12]  C. D. Walter,et al.  Montgomery exponentiation needs no final subtractions , 1999 .

[13]  Petar Borisov Minev,et al.  The Virtex-5 Routing and Logic Architecture , 2009 .

[14]  Kooroush Manochehri,et al.  Modified radix-2 Montgomery modular multiplication to make it faster and simpler , 2005, International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II.

[15]  Adi Shamir,et al.  A method for obtaining digital signatures and public-key cryptosystems , 1978, CACM.

[16]  K. Manochehri,et al.  Fast Montgomery modular multiplication by pipelined CSA architecture , 2004, Proceedings. The 16th International Conference on Microelectronics, 2004. ICM 2004..