High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theorem

B Koo, D Lee, G Ryu, T Chang, S Lee - Information Security and …, 2006 - Springer
B Koo, D Lee, G Ryu, T Chang, S Lee
Information Security and Cryptology–ICISC 2006: 9th International Conference …, 2006Springer
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.84 M clock cycles for a 1024-bit modular exponentiation and 0.25 M 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,233 Kbps for two 512-bit exponentiations at a …
Abstract
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.
Springer
Showing the best result for this search. See all results