Design of ECC Scalar Multiplier based on a new Finite Field Division Algorithm 


Vol. 29,  No. 5, pp. 726-736, May  2004


PDF
  Abstract

In this paper, we proposed a new scalar multiplier structure needed for an elliptic curve cryptosystem(ECC) over the standard basis in GF(2^163). It consists of a bit-serial multiplier and a divider with control logics, and the divider consumes most of the processing time. To speed up the division processing, we developed a new division algorithm based on the extended Euclid algorithm. Dynamic data dependency of the Euclid algorithm has been transformed to static and fixed data flow by a localization technique, to make it independent of the input and field polynomial. Compared to other existing scalar multipliers, the new scalar multiplier requires smaller gate counts with improved processor performance. It has been synthesized using Samsung 0.18 urn CMOS technology, and the maximum operating frequency is estimated 250 MHz. The resulting performance is
148 kbps, that is, it takes l.l msec to process a 163-bit data frame. We assure that this performance is enough to be used for digital signature, encryption/decryption, and key exchanges in real time environments.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

E. Kim and Y. Jeong, "Design of ECC Scalar Multiplier based on a new Finite Field Division Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 5, pp. 726-736, 2004. DOI: .

[ACM Style]

Eui-seok Kim and Yong-jin Jeong. 2004. Design of ECC Scalar Multiplier based on a new Finite Field Division Algorithm. The Journal of Korean Institute of Communications and Information Sciences, 29, 5, (2004), 726-736. DOI: .

[KICS Style]

Eui-seok Kim and Yong-jin Jeong, "Design of ECC Scalar Multiplier based on a new Finite Field Division Algorithm," The Journal of Korean Institute of Communications and Information Sciences, vol. 29, no. 5, pp. 726-736, 5. 2004.