A tiny RSA coprocessor based on optimized systolic Montgomery architecture

Zongbin Liu; Luning Xia; Jiwu Jing; Peng Liu

A tiny RSA coprocessor based on optimized systolic Montgomery architecture

Zongbin Liu, Luning Xia, Jiwu Jing, Peng Liu

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

Abstract

In this paper we propose a new hardware architecture of modular exponentiation, which is based on the optimized Montgomery multiplication. At CHES 1999, Tenca introduced a new architecture for implementing the Montgomery multiplication which was later improved by Huang et al. at PKC 2008. In this paper we improve the architecture of Huang and the improved one occupies less hardware resource, at the same time we add the final subtraction of the Montgomery algorithm into the architecture in order to do the exponentiation computation. Finally we use this improved architecture to build a RSA coprocessor. Compared with the previous work, the new 1024-bit RSA coprocessor saved nearly 50% of area, and the area utilization is greatly improved. This design is the smallest design as we know in the literature, and we verified the correctness by huge test data.

Original language	English (US)
Title of host publication	SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography
Pages	105-113
Number of pages	9
State	Published - Sep 12 2011
Event	International Conference on Security and Cryptography, SECRYPT 2011 - Seville, Spain Duration: Jul 18 2011 → Jul 21 2011

Publication series

Name	SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography

Other

Other	International Conference on Security and Cryptography, SECRYPT 2011
Country	Spain
City	Seville
Period	7/18/11 → 7/21/11

All Science Journal Classification (ASJC) codes

Computer Science Applications
Theoretical Computer Science

Access to Document

Fingerprint Dive into the research topics of 'A tiny RSA coprocessor based on optimized systolic Montgomery architecture'. Together they form a unique fingerprint.

Cite this

Liu, Z., Xia, L., Jing, J., & Liu, P. (2011). A tiny RSA coprocessor based on optimized systolic Montgomery architecture. In SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography (pp. 105-113). (SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography).

@inproceedings{6ae92081319a42ecabca9eb6e6181be9,

title = "A tiny RSA coprocessor based on optimized systolic Montgomery architecture",

abstract = "In this paper we propose a new hardware architecture of modular exponentiation, which is based on the optimized Montgomery multiplication. At CHES 1999, Tenca introduced a new architecture for implementing the Montgomery multiplication which was later improved by Huang et al. at PKC 2008. In this paper we improve the architecture of Huang and the improved one occupies less hardware resource, at the same time we add the final subtraction of the Montgomery algorithm into the architecture in order to do the exponentiation computation. Finally we use this improved architecture to build a RSA coprocessor. Compared with the previous work, the new 1024-bit RSA coprocessor saved nearly 50% of area, and the area utilization is greatly improved. This design is the smallest design as we know in the literature, and we verified the correctness by huge test data.",

author = "Zongbin Liu and Luning Xia and Jiwu Jing and Peng Liu",

year = "2011",

month = sep,

day = "12",

language = "English (US)",

isbn = "9789898425713",

series = "SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography",

pages = "105--113",

booktitle = "SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography",

note = "International Conference on Security and Cryptography, SECRYPT 2011 ; Conference date: 18-07-2011 Through 21-07-2011",

}

Liu, Z, Xia, L, Jing, J & Liu, P 2011, A tiny RSA coprocessor based on optimized systolic Montgomery architecture. in SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography. SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography, pp. 105-113, International Conference on Security and Cryptography, SECRYPT 2011, Seville, Spain, 7/18/11.

A tiny RSA coprocessor based on optimized systolic Montgomery architecture. / Liu, Zongbin; Xia, Luning; Jing, Jiwu; Liu, Peng.

SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography. 2011. p. 105-113 (SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography).

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

TY - GEN

T1 - A tiny RSA coprocessor based on optimized systolic Montgomery architecture

AU - Liu, Zongbin

AU - Xia, Luning

AU - Jing, Jiwu

AU - Liu, Peng

PY - 2011/9/12

Y1 - 2011/9/12

N2 - In this paper we propose a new hardware architecture of modular exponentiation, which is based on the optimized Montgomery multiplication. At CHES 1999, Tenca introduced a new architecture for implementing the Montgomery multiplication which was later improved by Huang et al. at PKC 2008. In this paper we improve the architecture of Huang and the improved one occupies less hardware resource, at the same time we add the final subtraction of the Montgomery algorithm into the architecture in order to do the exponentiation computation. Finally we use this improved architecture to build a RSA coprocessor. Compared with the previous work, the new 1024-bit RSA coprocessor saved nearly 50% of area, and the area utilization is greatly improved. This design is the smallest design as we know in the literature, and we verified the correctness by huge test data.

AB - In this paper we propose a new hardware architecture of modular exponentiation, which is based on the optimized Montgomery multiplication. At CHES 1999, Tenca introduced a new architecture for implementing the Montgomery multiplication which was later improved by Huang et al. at PKC 2008. In this paper we improve the architecture of Huang and the improved one occupies less hardware resource, at the same time we add the final subtraction of the Montgomery algorithm into the architecture in order to do the exponentiation computation. Finally we use this improved architecture to build a RSA coprocessor. Compared with the previous work, the new 1024-bit RSA coprocessor saved nearly 50% of area, and the area utilization is greatly improved. This design is the smallest design as we know in the literature, and we verified the correctness by huge test data.

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

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

M3 - Conference contribution

AN - SCOPUS:80052487538

SN - 9789898425713

T3 - SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography

SP - 105

EP - 113

BT - SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography

T2 - International Conference on Security and Cryptography, SECRYPT 2011

Y2 - 18 July 2011 through 21 July 2011

ER -