Implementation and Performance Analysis of RSA Algorithm Using Verilog
Keywords:
Cryptography, Data path time delay, RSA cryptosystemAbstract
This paper proposes an efficient method to implement RSA decryption algorithm. RSA cryptosystem is the most attractive and popular security technique for many applications, such as electronic commerce and secure internet access. There are few end-users today who make use of real security applications. These applications tend to be too complicated, exposing too much detail of the cryptographic process. Users need simple inherent security that doesn’t require more of them simply clicking the secure checkbox. Cryptography is a first abstraction to separate specific algorithms from generic cryptographic processes in order to eliminate compatibility and upgradeability problems. The core idea is enhance the performance of RSA algorithm. In this paper public key algorithm RSA and enhanced RSA are compared analysis is made on the three designing parameters i.e. time delay and power consumption. In a word, the total data path time delay of our proposed method is almost times 15.35% less than the already existing method [1]. The proposed method enhances the performance of the RSA operation.
References
- ainath Nasreen.P, Denila.N, Emy Ramola.P "A Novel Architecture for VLSI Implementation of RSA Cryptosystem” 2012 International Conference on Computing, Electronics and Electrical Technologies [ICCEET],IEEE
- Md. Ali-Al-Mamun, Mohammad Motaharul Islam, S.M. Mashihure Romman and A.H. Salah Uddin Ahmad “Performance Evaluation of Several Efficient RSA Variants” IJCSNS International Journal of Computer Science and Network Security, VOL.8 No.7, July 2008 7
- Ren-Junn Hwang, Feng-Fu Su, Tamsui, Taipei, Yi-Shiung Yeh, Chia-Yao Chen “An Efficient Decryption Method for RSA Cryptosystem” Proceedings of the 19th International Conference on Advanced Information Networking and Applications (AINA’05) 2005 IEEE
- Guang Gong and Lein Harn “Public-Key Cryptosystems Based on Cubic Finite Field Extensions” IEEE Transactions On Information Theory, VOL. 45, NO. 7, NOVEMBER 1999
- Mohammad Tehranipoor, Mehrdad Nourani, Nisar Ahmed “Low-Transition LFSR for BIST-Based Applications” 14th Asian Test Symposium, 2005 Proceedings.
- W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Trans. Inform. Theory, Nov. 1976,22: 644-654.
- R.L. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Commun. ACM, Feb. 1978, 21(2): 120-126.
- E. F. Brickell, A fast modular multiplication algorithm with application to two-key cryptography, in Proc. CRYPTO'82 Advances Cryptology,Plenum Press, New York and London, 1982: 51-50.
- M. Preetha, M. Nithya “A Study and Performance Analysis of RSA Algorithm” IJCSMC, Vol. 2, Issue. 6, June 2013
- R.L.Rivest,A.Sharmir,L.Adleman : A method for obtaining digital signatures and public key Cryptosystems”, Tata McGraw-Hill
- W. Stallings, Cryptography and Network Security: Principles and Practice 3/e. Prentice Hall
- Cormen , Thomas H, Charles E.Leiserson, aronald L.Rivest Clifford Stein “Introduction to algorithms”. MIT Press and McGraw-Hill
- www.rsa.com
- www.cc.gatech.edu
- www.symmtech.com
- www.rsasecurity.com
- www.cryptotools.com
Downloads
Published
Issue
Section
License
Copyright (c) IJSRSET

This work is licensed under a Creative Commons Attribution 4.0 International License.