Technical Program

Paper Detail

Paper:VLSI-L16.5
Session:Cryptography
Time:Tuesday, May 25, 17:12 - 17:30
Presentation: Lecture
Topic: VLSI Systems and Applications: Digital VLSI Circuits
Title: TWO FAST RSA IMPLEMENTATIONS USING HIGH-RADIX MONTGOMERY ALGORITHM
Authors: Soner Yesil; TÜBITAK-BILTEN 
 A. Neslin Ismailoglu; TÜBITAK-BILTEN 
 Yusuf Cagatay Tekmen; Middle East technical University 
 Murat Askar; Middle East Technical University 
Abstract: This paper presents two semi-custom VLSI implementations of 1024-bit RSA Public-Key Cryptosystem in radix-4 and radix-16. These implementations are both based on the same design methodology, in which The R-L Binary Method and Montgomery Algorithm are used for exponentiation and modular multiplication, respectively. The Squaring and Multiplication operations in the exponentiation are performed in parallel in a systolic modular multiplication unit. Both designs are implemented using AMI Semiconductor 0.35um CMOS Technology. Radix-4 implementation resulted in 3.97ns worst-case clock period with ~n2 worst-case number of cycles (237 Kbps) and 132K gate count. Radix-16 implementation resulted in 5.1ns worst-case clock period with ~n2/2 worst-case number of cycles (377 Kbps) and 155K gate count.
 
           Back


Home -||- Technical Program -||- Call for Participation -||- Paper Submission -||- Paper Review -||- Plenaries
Invited Sessions -||- Registration -||- Tutorials/Short Courses -||- Forums -||- Technical Program Committee
MySchedule -||- Exhibits -||- Housing -||- Information -||- Committee -||- Contact Us

©2021 Conference Management Services -||- email: organizers@iscas2004.org -||- Last updated Friday, August 17, 2012