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 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Computer Science Applications
- Theoretical Computer Science
Cite this
}
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
ER -