DocumentCode
2247473
Title
A Fast Bit-Interleaving RSA Cryptosystem Based on Radix-4 Cellular-Array Modular Multiplier
Author
Hong, Jin-Hua ; Tsai, Bin-Yan
Author_Institution
Dept. of Electr. Eng., Kaohsiung Nat. Univ.
fYear
2006
fDate
4-7 Dec. 2006
Firstpage
1446
Lastpage
1449
Abstract
A fast bit-interleaving RSA cryptosystem is designed based on radix-4 cellular array modular multiplier. Due to reduced number of iterations and pipelining, our radix-4 RSA cryptosystem is four times faster than the conventional RSA cryptosystem. The critical path delay in our design is only 2.43ns. It takes about 0.26M clock cycles to finish a 512-bit modular exponentiation. Therefore, the baud rate is about 656Kb/s at 333MHz clock
Keywords
cellular arrays; iterative methods; multiplying circuits; pipeline arithmetic; public key cryptography; 2.43 ns; 333 MHz; 512 bit; Booth algorithm; Montgomery algorithm; RSA cryptosystem; iterations; pipelining; radix-4 cellular array modular multiplier; Circuits; Clocks; Delay; Pipeline processing; Public key cryptography; Booth Algorithm; Cryptosystem; Modular Multiplier; Montgomery Algorithm; RSA; Radix-4;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems, 2006. APCCAS 2006. IEEE Asia Pacific Conference on
Conference_Location
Singapore
Print_ISBN
1-4244-0387-1
Type
conf
DOI
10.1109/APCCAS.2006.342474
Filename
4145674
Link To Document