Efficient normal basis multipliers in composite fields

Sangho Oh, Chang Han Kim, Jongin Lim, Dong Hyeon Cheon

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)


It is well-known that a class of finite fields GF(2n) using an optimal normal basis is most suitable for a hardware implementation of arithmetic in finite fields. In this paper, we introduce composite fields of some hardware-applicable properties resulting from the normal basis representation and the optimal condition. We also present a hardware architecture of the proposed composite fields including a bit-parallel multiplier.

Original languageEnglish
Pages (from-to)1133-1138
Number of pages6
JournalIEEE Transactions on Computers
Issue number10
Publication statusPublished - 2000 Oct

Bibliographical note

Funding Information:
This paper was partially supported by the Korea Information Security Agency.

ASJC Scopus subject areas

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


Dive into the research topics of 'Efficient normal basis multipliers in composite fields'. Together they form a unique fingerprint.

Cite this