Implementation of a fast square in RSA encryption/decryption architecture

Himanshu Thapliyal, M. B. Srinivas, Hamid R. Arabnia

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper proposes the hardware implementation of RSA encryption algorithm using the recently proposed square architecture. It is an object of the present paper to provide a RSA encryption/ decryption circuit which can reduce circuit size by eliminating unnecessary logic in comparison to computing the square with a dedicated multiplier. The coding of the RSA is done in Verilog HDL and the FPGA synthesis is done using Xilinx libraries. The result shows that RSA hardware implemented using the proposed architecture is faster than RSA hardware implemented using traditional multiplication algorithm.

Original languageEnglish
Title of host publicationProceedings of The 2005 International Conference on Security and Management, SAM'05
Pages371-374
Number of pages4
StatePublished - 2005
Event2005 International Conference on Security and Management, SAM'05 - Las Vegas, NV, United States
Duration: Jun 20 2005Jun 23 2005

Publication series

NameProceedings of The 2005 International Conference on Security and Management, SAM'05

Conference

Conference2005 International Conference on Security and Management, SAM'05
Country/TerritoryUnited States
CityLas Vegas, NV
Period6/20/056/23/05

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Hardware and Architecture
  • Software

Fingerprint

Dive into the research topics of 'Implementation of a fast square in RSA encryption/decryption architecture'. Together they form a unique fingerprint.

Cite this