A new hardware architecture for operations in GF(2n)

Chang Han Kim, Sangho Oh, Jongin Lim

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


The efficient computation of the arithmetic operations in finite fields is closely related to the particular ways in which the field elements are presented. The common field representations are a polynomial basis representation and a normal basis representation. In this paper, we introduce a nonconventional basis [8] and present a new bit-parallel multiplier which is as efficient as the modified Massey-Omura multiplier [2] using the type I optimal normal basis.

Original languageEnglish
Pages (from-to)90-92
Number of pages3
JournalIEEE Transactions on Computers
Issue number1
Publication statusPublished - 2002 Jan

Bibliographical note

Funding Information:
This work is supported in part by the Ministry of Information & Communication of Korea (“Support Project of University Information Technology Research Center” supervised by IITA).


  • Elliptic curve
  • Finite fields
  • Nonconventional basis
  • Public-key cryptosystems

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics


Dive into the research topics of 'A new hardware architecture for operations in GF(2n)'. Together they form a unique fingerprint.

Cite this