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

Chang Han Kim, Sangho Oh, Jongin Lim

Research output: Contribution to journalArticle

12 Citations (Scopus)

Abstract

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
Volume51
Issue number1
DOIs
Publication statusPublished - 2002 Jan

Keywords

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

ASJC Scopus subject areas

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

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

  • Cite this