By Topic

Design of a scalable RSA and ECC crypto-processor

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

4 Author(s)
Ming-Cheng Sun ; Dept. of Electr. Eng., Nat. Tsing Hua Univ., Hsinchu, Taiwan ; Chih-Pin Su ; Chih-Tsun Huang ; Cheng-Wen Wu

In this paper, we propose a scalable word-based crypto-processor that performs modular multiplication based on the modified Montgomery algorithm for finite fields GF(P) and GF(2m). The unified crypto-processor supports scalable keys of length up to 2048 bits for RSA and 512 bits for elliptic curve cryptography (ECC). Further extension of the key length can be done easily by enlarging the memory module or using the external memory resource. With the proposed parity prediction technique, our pipelined crypto-processor achieves a 512-bit RSA encryption rate of 276 kbps and a 160-bit ECC encryption rate of 73.3 kbps for a 220 MHz clock rate.

Published in:

Design Automation Conference, 2003. Proceedings of the ASP-DAC 2003. Asia and South Pacific

Date of Conference:

21-24 Jan. 2003