Email this article 
Open Access
Subscription or Fee Access
Efficient Implementation of RSA Encryption and Decryption using Ancient Indian Vedic Mathematics
Abstract
RSA is one of the safest standard algorithms, based on public-key, for providing the security in communication and networks. One of the most time consuming processes in RSA algorithm for encryption/decryption is the modular exponentiation, i.e., Pemod n, where P is the text and (e,n) is the key. This paper examines how this computation could be speeded up by using Ancient Indian Vedic Mathematics when compared with the Booth algorithms. This paper proposes the hardware implementation of RSA encryption/decryption algorithm using the sutras of Ancient Indian Vedic Mathematics and Booth multiplier. Compared to Booth multiplier, the Vedic multiplier occupies lesser area and achieves higher speed. Coding is done using Verilog-HDL and downloaded on targeted device as Virtex 5. Our proposed Vedic multiplier occupies lesser area and achieves higher speed than the previous work. Also, our proposed work is 3 times faster than the previous work when applied in RSA as is downloaded on targeted device Spartan 3.
Keywords
References
Jagadguru Swami Sri Bharati Krishna Tirthji Maharaja, Vedic Mathematics, VS agarwal, India, 33-45(1986).
Nadia Nedjah, A review of modular multiplication methods and respective hardware implementations, Informatica 30 (2006).
S. Kumaravel, Ramalatha Marimuthu, VLSI implementation of high performance RSA algorithm using Vedic mathematics, 2006, IEEE.
Dr. K.S. Gurumurthy, M.S. Prahalad, Fast and power efficient 16×16 array of array multiplier using Vedic multiplication, Microsystems Packaging Assembly and Circuits Technology Conference, pages 1-4, 2010,IEEE.
Himanshu Thapliyal, M.B. Srinivas, VLSI implementation of RSA encryption system using Ancient Indian Vedic Mathematics, VLSI Circuits and Systems II, Proceedings of Spain conference, volume-5837,pages 888-892, 2005,SPIE.
Andrew D. Booth, A signed binary multiplication technique, The Quarterly Journal of Mechanics and Applied Mathematics IV -1951.
Collin Andrew, Andrew Booth's Computers at Birkbeck College, Resurrection, Issue 5, Computer Conservation Society, London, 1993.
Thapliyal H. and Srinivas M.B. “High Speed Efficient N x N Bit Parallel Hierarchical Overlay Multiplier Architecture Based on Ancient Indian Vedic Mathematics”, Transactions on Engineering, Computing and Technology, Vol.2, 2004.
William Stallings, Cryptography and Nework Security, fourth Edition, Pearson Education,261-281( 2003).
Himanshu Thapliyal, R.V. Kamala, M.B. Srinivas, RSA encryption/decryption in wireless networks using an efficient high speed multiplier, in: Proceedings of the International Conference on Personal Wireless Communications (ICPWC-2005), New Delhi, pp. 417–420, 2005, IEEE.
John Fry, Martin Langhammer, RSA and Public Key Cryptography in FPGAs, Altera Corporation, White Paper, Europe.
Hwang Kai, Computer Arithmetic, Principles, Architecture and Design, John Wiley1979.
Anvesh Kumar, Ashish Raman, Low power, high speed ALU design by Vedic mathematics, in: Publish in National Conference, Organized by NIT, Hamirpur, 2009.
Shamim Akhter “VHDL Implementation of fast NXN Multiplier based on vedic mathematics”, 2007, IEEE.
Yun-Nan Chang , Janardhan H.Satyanarayana , KeshabK.Parhi, “Low-power DIGIT-SERIAL MULTIPLIER ”, International Symposium on circuits and systems, Hong Kong,1997, IEEE.
Himanshu Thapliyal and Hamid R. Arabnia, "A time area power efficient multiplier and square architecture based on ancient IndianVedicmathematics"www.vedicmathsindia.org.
Vishal Verma and Himanshu Thapliyal , “High Speed Efficient N X N Bit Multiplier Based On Ancient Indian Vedic Mathematics”, Proceedings International Conference On VLSI, Las Vegas, 2003,IEEE.
Refbacks
- There are currently no refbacks.
This work is licensed under a Creative Commons Attribution 3.0 License.