Modular Divider for Elliptic Curve Cryptographic Hardware Based on Programmable CA

  • Jun-Cheol Jeon
  • Kee-Won Kim
  • Jai-Boo Oh
  • Kee-Young Yoo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3994)


This study presents an efficient division architecture using irreducible trinomial in GF(2 n ), based on programmable cellular automata (PCA). The most expensive arithmetic operation in elliptic curve cryptosystems (ECC) is division, which is performed by multiplying the inverse of a multiplicand. The proposed architecture is highly regular, expandable, and has reduced latency. The proposed architecture can be efficiently used in the hardware design of crypto-coprocessors.


Cellular Automaton Elliptic Curve Finite Field Polynomial Basis Irreducible Polynomial 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


  1. 1.
    Rao, T.R.N., Fujiwara, E.: Error-Control Coding for Computer Systems. Prentice-Hall, Englewood Cliffs (1989)Google Scholar
  2. 2.
    Drescher, W., Bachmann, K., Fettweis, G.: VLSI Architecture for Non Sequential Inversion over GF(2m) using the Euclidean Algorithm. In: The International Conference on Signal Processing Applications and Technology, vol. 2, pp. 1815–1819 (1997)Google Scholar
  3. 3.
    Menezes, A.J.: Elliptic Curve Public Key Cryptosystems. Kluwer Academic Publishers, Boston (1993)MATHGoogle Scholar
  4. 4.
    Zhang, C.N., Deng, M.Y., Mason, R.: A VLSI Programmable Cellular Automata Array for Multiplication in GF(2n). In: PDPTA 1999 International Conference (1999)Google Scholar
  5. 5.
    Choudhury, P.P., Barua, R.: Cellular Automata Based VLSI Architecture for Computing Multiplication and Inverses in GF(2m). In: IEEE 7th International Conference on VLSI Design, pp. 279–282 (1994)Google Scholar
  6. 6.
    Jeon, J.-C., Yoo, K.-Y.: An Evolutionary Approach to the Design of Cellular Automata Architecture for Multiplication in Elliptic Curve Cryptography over Finite Fields. In: Zhang, C., Guesgen, H.W., Yeap, W.-K. (eds.) PRICAI 2004. LNCS (LNAI), vol. 3157, pp. 241–250. Springer, Heidelberg (2004)CrossRefGoogle Scholar
  7. 7.
    Menezs, A.J.: Applications of Finite Fields. Kluwer Academic Publishers, Boston (1993)Google Scholar
  8. 8.
    IEEE P1363, Standard Specifications for Public Key Cryptography (2000) Google Scholar
  9. 9.
    Wei, S.W.: VLSI architecture of divider for finite field GF(2m). In: IEEE International Symposium on Circuit and Systems, vol. 2, pp. 482–485 (1998)Google Scholar
  10. 10.
    Wang, C.L., Guo, J.H.: New Systolic Arrays for C+ AB2, inversion, and division in GF(2m). IEEE Trans. on Computer 49(10), 1120–1125 (2000)CrossRefGoogle Scholar
  11. 11.
    Kim, N.Y., Yoo, K.Y.: Systolic architecture for inversion/division using AB2 circuits in GF(2m). Integration, the VLSI Journal 35, 11–24 (2003)CrossRefGoogle Scholar
  12. 12.
    Kaufman, C., Perlman, R., Speciner, M.: Network Security private communication in a public world. Prentice Hall, New Jersey (2002)Google Scholar
  13. 13.
    SEC 1: Elliptic Curve Cryptography version 1.0, Certicom Reserch (2000)Google Scholar
  14. 14.
    Lafe, O.: Cellular Automata Transforms: Theory and Applications in Multimedia Compression, Encryption, and Modeling. Kluwer Academic Publishers, Dordrecht (2000)MATHGoogle Scholar
  15. 15.
    Gajski, D.D.: Principles of digital design. Prentice-Hall International Inc., Englewood Cliffs (1997)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Jun-Cheol Jeon
    • 1
  • Kee-Won Kim
    • 1
  • Jai-Boo Oh
    • 1
  • Kee-Young Yoo
    • 1
  1. 1.Department of Computer EngineeingKyungpook National UniversityDaeguKorea

Personalised recommendations