Abstract
Elliptic curve cryptosystems are expected to be a next standard of public-key cryptosystems. A security level of elliptic curve cryptosystems depends on a difficulty of a discrete logarithm problem on elliptic curves. The security level of a elliptic curve cryptosystem which has a public-key of 160-bit is equivalent to that of a RSA system which has a public-key of 1024-bit. We propose an elliptic curve cryptosystem LSI architecture embedding word-based Montgomery multipliers. A Montgomery multiplication is an efficient method for a finite field multiplication. We can design a scalable architecture for an elliptic curve cryptosystem by selecting structure of word-based Montgomery multipliers. Experimental results demonstrate effectiveness and efficiency of the proposed architecture. In the hardware evaluation using 0.18 μ m CMOS library, the high-speed design using 126 Kgates with 20 × 8-bit multipliers achieved operation times of 3.6 ms for a 160-bit point multiplication.
| Original language | English |
|---|---|
| Pages (from-to) | 243-249 |
| Number of pages | 7 |
| Journal | IEICE Transactions on Electronics |
| Volume | E89-C |
| Issue number | 3 |
| DOIs | |
| Publication status | Published - 2006 |
Fingerprint
Keywords
- Elliptic curve cryptosystem
- LSI design
- Montgmery multiplier
- Public-key cryptosystem
ASJC Scopus subject areas
- Electrical and Electronic Engineering
Cite this
A fast elliptic curve cryptosystem LSI embedding word-based montgomery multiplier. / Uchida, Jumpei; Togawa, Nozomu; Yanagisawa, Masao; Ohtsuki, Tatsuo.
In: IEICE Transactions on Electronics, Vol. E89-C, No. 3, 2006, p. 243-249.Research output: Contribution to journal › Article
}
TY - JOUR
T1 - A fast elliptic curve cryptosystem LSI embedding word-based montgomery multiplier
AU - Uchida, Jumpei
AU - Togawa, Nozomu
AU - Yanagisawa, Masao
AU - Ohtsuki, Tatsuo
PY - 2006
Y1 - 2006
N2 - Elliptic curve cryptosystems are expected to be a next standard of public-key cryptosystems. A security level of elliptic curve cryptosystems depends on a difficulty of a discrete logarithm problem on elliptic curves. The security level of a elliptic curve cryptosystem which has a public-key of 160-bit is equivalent to that of a RSA system which has a public-key of 1024-bit. We propose an elliptic curve cryptosystem LSI architecture embedding word-based Montgomery multipliers. A Montgomery multiplication is an efficient method for a finite field multiplication. We can design a scalable architecture for an elliptic curve cryptosystem by selecting structure of word-based Montgomery multipliers. Experimental results demonstrate effectiveness and efficiency of the proposed architecture. In the hardware evaluation using 0.18 μ m CMOS library, the high-speed design using 126 Kgates with 20 × 8-bit multipliers achieved operation times of 3.6 ms for a 160-bit point multiplication.
AB - Elliptic curve cryptosystems are expected to be a next standard of public-key cryptosystems. A security level of elliptic curve cryptosystems depends on a difficulty of a discrete logarithm problem on elliptic curves. The security level of a elliptic curve cryptosystem which has a public-key of 160-bit is equivalent to that of a RSA system which has a public-key of 1024-bit. We propose an elliptic curve cryptosystem LSI architecture embedding word-based Montgomery multipliers. A Montgomery multiplication is an efficient method for a finite field multiplication. We can design a scalable architecture for an elliptic curve cryptosystem by selecting structure of word-based Montgomery multipliers. Experimental results demonstrate effectiveness and efficiency of the proposed architecture. In the hardware evaluation using 0.18 μ m CMOS library, the high-speed design using 126 Kgates with 20 × 8-bit multipliers achieved operation times of 3.6 ms for a 160-bit point multiplication.
KW - Elliptic curve cryptosystem
KW - LSI design
KW - Montgmery multiplier
KW - Public-key cryptosystem
UR - http://www.scopus.com/inward/record.url?scp=33645797111&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33645797111&partnerID=8YFLogxK
U2 - 10.1093/ietele/e89-c.3.243
DO - 10.1093/ietele/e89-c.3.243
M3 - Article
AN - SCOPUS:33645797111
VL - E89-C
SP - 243
EP - 249
JO - IEICE Transactions on Electronics
JF - IEICE Transactions on Electronics
SN - 0916-8524
IS - 3
ER -