DocumentCode :
3615848
Title :
Two fast RSA implementations using high-radix montgomery algorithm
Author :
S. Yesil;A.N. Ismailoglu;Y.C. Tekmen;M. Askar
Author_Institution :
Dept. of Electr. & Electron. Eng., Middle East Tech. Univ., Ankara, Turkey
Volume :
2
fYear :
2004
fDate :
6/26/1905 12:00:00 AM
Lastpage :
557
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.35 /spl mu/m CMOS technology. Radix-4 implementation resulted in 3.97 ns worst-case clock period with /spl sim/n/sup 2/ worst-case number of cycles (237 Kbps) and 132 K gate count. Radix-16 implementation resulted in 5.1 ns worst-case clock period with /spl sim/n/sup 2//2 worst-case number of cycles (377 Kbps) and 155 K gate count.
Keywords :
"Public key cryptography","Signal processing algorithms","Clocks","Hardware","CMOS technology","Data security","Very large scale integration","Design methodology","Ambient intelligence","Business"
Publisher :
ieee
Conference_Titel :
Circuits and Systems, 2004. ISCAS ´04. Proceedings of the 2004 International Symposium on
Print_ISBN :
0-7803-8251-X
Type :
conf
DOI :
10.1109/ISCAS.2004.1329332
Filename :
1329332
Link To Document :
بازگشت