Academic
Publications
High-Speed RSA Crypto-processor with Radix4 Modular Multiplication and Chinese Remainder Theorem

High-Speed RSA Crypto-processor with Radix4 Modular Multiplication and Chinese Remainder Theorem,10.1007/11927587_9,Bonseok Koo,Dongwook Lee,Gwonho Ry

High-Speed RSA Crypto-processor with Radix4 Modular Multiplication and Chinese Remainder Theorem  
BibTex | RIS | RefWorks Download
Today, RSA is one of the most popular public-key crypto-system in various applications. In this paper, we present a high-speed RSA crypto-processor with modified radix-4 Montgomery multiplication algorithm and Chinese Remainder Theorem (CRT). Our design takes 0.84M clock cycles for a 1024-bit modular exponentiation and 0.25M clock cycles for two 512-bit exponentiations. Using 0.18 um standard cell library, the processor achieves 365Kbps for a 1024-bit exponentiation and 1,233Kbps for two 512-bit exponentiations at a 300MHz clock rate. For the high performance RSA crypto-system, the processor can also execute modular reduction, which is essential for calculating the Montgomery mapping constant and the modularly reduced ciphertext in CRT technique.
Conference: Information Security and Cryptology - ICISC , pp. 81-93, 2006
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.