By Topic

RSA encryption/decryption in wireless networks using an efficient high speed multiplier

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Thapliyal, H. ; Center for VLSI & Embedded Syst. Technol., Int. Inst. of Inf. Technol., Hyderabad, India ; Kamala, R.V. ; Srinivas, M.B.

This paper proposes a faster RSA encryption/decryption circuit utilizing a high speed multiplier architecture. The proposed two's complement N XN bit multiplier architecture is based on two concepts: the partial products can be generated in parallel with a delay of d; and thereafter the addition can be reduced to log2N steps. The most significant aspect of the proposed RSA hardware is that any future proposed efficient adder can be implemented in the proposed multiplier, without changing the original hardware architecture, thereby improving its efficiency to a great extent. The coding of the RSA is done in Verilog HDL and the FPGA synthesis is done using Xilinx libraries. The result shows that the RSA hardware implemented using the proposed architecture is faster than RSA hardware implemented using the traditional multiplication algorithm.

Published in:

Personal Wireless Communications, 2005. ICPWC 2005. 2005 IEEE International Conference on

Date of Conference:

23-25 Jan. 2005