Evolutionary hardware architecture for division in elliptic curve cryptosystems over GF(2n)

  • Authors:
  • Jun-Cheol Jeon;Kee-Won Kim;Kee-Young Yoo

  • Affiliations:
  • Department of Computer Engineeing, Kyungpook National University, Daegu, Korea;Department of Computer Engineeing, Kyungpook National University, Daegu, Korea;Department of Computer Engineeing, Kyungpook National University, Daegu, Korea

  • Venue:
  • ICNC'05 Proceedings of the First international conference on Advances in Natural Computation - Volume Part III
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Cellular automata (CA) have been accepted as a good evolutionary computational model for the simulation of complex physical systems. They have been used for various applications, such as parallel processing computations and number theory. In the meanwhile, elliptic curve cryptosystems (ECC) are in the spotlight owing to their significantly smaller parameters. The most costly arithmetic operation in ECC is division, which is performed by multiplying the inverse of a multiplicand. Thus, this paper presents an evolutionary hardware architecture for division based on CA over GF(2n) in ECC. The proposed architecture has the advantage of high regularity, expandability, and a reduced latency based on periodic boundary CA. The proposed architecture can be used for the hardware design of crypto-coprocessors.