High-Speed RSA Crypto-processor with Radix-4 Modular Multiplication and Chinese Remainder Theorem

Autor:	Sangjin Lee, Dong-Wook Lee, Gwon-Ho Ryu, Bon-Seok Koo, Taejoo Chang
Rok vydání:	2006
Předmět:	Modular exponentiation Exponentiation Modular arithmetic Computer science Clock rate Kochanski multiplication Parallel computing Montgomery reduction Ciphertext Radix Booth's multiplication algorithm Carry-save adder Hardware_ARITHMETICANDLOGICSTRUCTURES Arithmetic Chinese remainder theorem
Zdroj:	Information Security and Cryptology – ICISC 2006 ISBN: 9783540491125 ICISC
DOI:	10.1007/11927587_9
Popis:	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.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::c63c1e67e0595a6678b9a69fa425dd2e https://doi.org/10.1007/11927587_9 Zobrazit plný text záznamu