DocumentCode
3065079
Title
Implementation of RSA cryptoprocessor based on Montgomery algorithm
Author
Yuliang, Deng ; Zhigang, Mao ; Yizheng, Ye ; Tao, Wang
Author_Institution
Harbin Inst. of Technol., China
fYear
1998
fDate
1998
Firstpage
524
Lastpage
526
Abstract
The RSA algorithm is a major method in implementing a public key cryptosystem. On the basis that the Montgomery algorithm can modular-multiply in a fast way, this paper presents a hardware implementation of a 1024-bit RSA cryptoprocessor. It has been shown that the processor can encrypt 1024 bit message in less than 0.65 seconds, with which a 3 mm2 die area. It is suitable for smart IC cards
Keywords
digital arithmetic; digital signal processing chips; public key cryptography; smart cards; Montgomery algorithm; RSA cryptoprocessor; hardware implementation; modular-multiplication; public key cryptosystem; smart IC cards; Application software; CMOS technology; Computer applications; Computer networks; Computer security; Data security; Digital signatures; Hardware; Information security; Public key cryptography;
fLanguage
English
Publisher
ieee
Conference_Titel
Solid-State and Integrated Circuit Technology, 1998. Proceedings. 1998 5th International Conference on
Conference_Location
Beijing
Print_ISBN
0-7803-4306-9
Type
conf
DOI
10.1109/ICSICT.1998.785937
Filename
785937
Link To Document