Implementation of RSA Cryptosystem Using Ancient Indian Vedic Mathematics

Shahina M. Salim, Sonal A. Lakhotiya

Abstract: RSA is one of the most safest standard algorithm based on public key, for providing security in network. The hierarchical overlay multiplier is used in RSA circuitry for multiplication operation. The most significant aspect is the development of division architecture based on Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. Typically, modular-multiplication algorithm is used since no trial division is necessary, and the carry-save addition (CSA) is employed to reduce the critical path. The implementation of RSA encryption/decryption algorithm using the algorithm of Ancient Indian Vedic Mathematics that have been modified to improve performance. RSA circuitry implemented using vedic multiplication is efficient in terms of area, speed compared to its implementation using conventional multiplication.

Keywords: RSA Cryptosystem, Modular Multiplication, , Modular exponentiation, Vedic Mathematics, FPGA, VHDL

How to Cite?: Shahina M. Salim, Sonal A. Lakhotiya, "Implementation of RSA Cryptosystem Using Ancient Indian Vedic Mathematics", Volume 4 Issue 5, May 2015, International Journal of Science and Research (IJSR), Pages: 3221-3230, https://www.ijsr.net/getabstract.php?paperid=SUB154843, DOI: https://dx.doi.org/10.21275/SUB154843