A fast elliptic curve cryptosystem LSI embedding word-based montgomery multiplier

Jumpei Uchida*, Nozomu Togawa, Masao Yanagisawa, Tatsuo Ohtsuki


研究成果: Article査読


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.

ジャーナルIEICE Transactions on Electronics
出版ステータスPublished - 2006

ASJC Scopus subject areas

  • 電子材料、光学材料、および磁性材料
  • 電子工学および電気工学


「A fast elliptic curve cryptosystem LSI embedding word-based montgomery multiplier」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。