VLSI Implementation of RSA Encryption System Using Ancient Indian Vedic Mathematics

Simple item page
dc.creatorThapliyal, Himanshu
dc.creatorSrinivas, M. B
dc.date2006-09-07
dc.date.accessioned2026-07-07T07:23:48Z
dc.date.available2026-07-07T07:23:48Z
dc.descriptionThis paper proposes the hardware implementation of RSA encryption/decryption algorithm using the algorithms of Ancient Indian Vedic Mathematics that have been modified to improve performance. The recently proposed hierarchical overlay multiplier architecture is used in the RSA circuitry for multiplication operation. The most significant aspect of the paper is the development of a division architecture based on Straight Division algorithm of Ancient Indian Vedic Mathematics and embedding it in RSA encryption/decryption circuitry for improved efficiency. The coding is done in Verilog HDL and the FPGA synthesis is done using Xilinx Spartan library. The results show that RSA circuitry implemented using Vedic division and multiplication is efficient in terms of area/speed compared to its implementation using conventional multiplication and division architectures
dc.description5 Pages: Proceedings of SPIE -- Volume 5837 VLSI Circuits and Systems II, Jose F. Lopez, Francisco V. Fernandez, Jose Maria Lopez-Villegas, Jose M. de la Rosa, Editors, June 2005, pp. 888-892
dc.identifierhttps://arxiv.org/abs/cs/0609028
dc.identifierhttp://arxiv.org/abs/cs/0609028
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/116116
dc.subjectHardware Architecture
dc.titleVLSI Implementation of RSA Encryption System Using Ancient Indian Vedic Mathematics
dc.typetext

Files

Collections

arXiv