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

Bonseok Koo; Dongwook Lee; Gwonho Ryu; Taejoo Chang; Sangjin Lee

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

Bonseok Koo, Dongwook Lee, Gwonho Ryu, Taejoo Chang, Sangjin Lee

School of Cybersecurity

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

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.

Original language	English
Title of host publication	Information Security and Cryptology - ICISC 2006
Subtitle of host publication	9th International Conference, Proceedings
Pages	81-93
Number of pages	13
Publication status	Published - 2006
Event	ICISC 2006: 9th International Conference on Information Security and Cryptology - Busan, Korea, Republic of Duration: 2006 Nov 30 → 2006 Dec 1

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	4296 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	ICISC 2006: 9th International Conference on Information Security and Cryptology
Country/Territory	Korea, Republic of
City	Busan
Period	06/11/30 → 06/12/1

Keywords

Booth's algorithm
Carry save adder
Chinese remainder theorem
Montgomery multiplication
RSA

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Cite this

Koo, B., Lee, D., Ryu, G., Chang, T., & Lee, S. (2006). High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theorem. In Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings (pp. 81-93). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4296 LNCS).

High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theorem. / Koo, Bonseok; Lee, Dongwook; Ryu, Gwonho et al.

Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. 2006. p. 81-93 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 4296 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Koo, B, Lee, D, Ryu, G, Chang, T & Lee, S 2006, High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theorem. in Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 4296 LNCS, pp. 81-93, ICISC 2006: 9th International Conference on Information Security and Cryptology, Busan, Korea, Republic of, 06/11/30.

Koo B, Lee D, Ryu G, Chang T, Lee S. High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theorem. In Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. 2006. p. 81-93. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

Koo, Bonseok ; Lee, Dongwook ; Ryu, Gwonho et al. / High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theorem. Information Security and Cryptology - ICISC 2006: 9th International Conference, Proceedings. 2006. pp. 81-93 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{f22914463e7a4341951161f8a4b8e123,

title = "High-speed RSA crypto-processor with radix-4 modular multiplication and Chinese remainder theorem",

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.",

keywords = "Booth's algorithm, Carry save adder, Chinese remainder theorem, Montgomery multiplication, RSA",

author = "Bonseok Koo and Dongwook Lee and Gwonho Ryu and Taejoo Chang and Sangjin Lee",

year = "2006",

language = "English",

isbn = "3540491120",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

pages = "81--93",

booktitle = "Information Security and Cryptology - ICISC 2006",

note = "ICISC 2006: 9th International Conference on Information Security and Cryptology ; Conference date: 30-11-2006 Through 01-12-2006",

}

TY - GEN

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

AU - Koo, Bonseok

AU - Lee, Dongwook

AU - Ryu, Gwonho

AU - Chang, Taejoo

AU - Lee, Sangjin

PY - 2006

Y1 - 2006

N2 - 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.

AB - 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.

KW - Booth's algorithm

KW - Carry save adder

KW - Chinese remainder theorem

KW - Montgomery multiplication

KW - RSA

UR - http://www.scopus.com/inward/record.url?scp=34547455438&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34547455438&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:34547455438

SN - 3540491120

SN - 9783540491125

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 81

EP - 93

BT - Information Security and Cryptology - ICISC 2006

T2 - ICISC 2006: 9th International Conference on Information Security and Cryptology

Y2 - 30 November 2006 through 1 December 2006

ER -

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

Abstract

Publication series

Other

Keywords

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this