Implementation of RSA Cryptosystem Using Ancient Indian Vedic Mathematics
Journal: International Journal of Science and Research (IJSR) (Vol.4, No. 5)Publication Date: 2015-05-05
Authors : Shahina M. Salim; Sonal A. Lakhotiya;
Page : 3221-3230
Keywords : RSA Cryptosystem; Modular Multiplication; Modular exponentiation; Vedic Mathematics; FPGA; VHDL;
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.
Other Latest Articles
- Automatic Speaker Recognition Using SVM
- MHD Free Convective Flow Over A Vertical Porous Surface with Ohmic Heating, Thermal Radiation and Chemical Reaction
- Experimental Study of Heat Absorbing Packed Bed Regenerator for Space Heating for Industrial Purpose
- Offline Hand Writer Identification Based on Scale Invariant Feature Transform
- Specific Relevance of Laboratory Examinations in Patients with Chronic Hepatic Disease-Our Experience
Last modified: 2021-06-30 21:46:31