By Topic

A new RSA cryptosystem hardware implementation based on high-radix Montgomery's algorithm

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

2 Author(s)
Fang Yingli ; Inst. of Microelectron., Tsinghua Univ., Beijing, China ; Gao Zhiqiang

In this paper, we propose an efficient hardware-oriented modular multiplication algorithm based on Montgomery's algorithm. We employ the high-radix technique and modify the original Montgomery's algorithm to reduce hardware complexity and improve processing speed. A RSA cryptosystem hardware design based on this proposed algorithm is presented. The design has been implemented to a single-chip 512-bit RSA processor with CSMC (Central Semiconductor Manufacture Corporation) 0.6um CMOS standard cell library. The processor contains about 96k gates and delivers a baud rate of 113kbits/sec with 40MHz clock in the worst case

Published in:

ASIC, 2001. Proceedings. 4th International Conference on

Date of Conference:

2001