Modified sequential normal basis multipliers for type II optimal normal bases

Dong Jin Yang, Chang Han Kim, Youngho Park, Yongtae Kim, Jongin Lim

Research output: Contribution to journalConference article

7 Citations (Scopus)

Abstract

The arithmetic in finite field GF(2m) is important in cryptographic application and coding theory. Especially, the area and time efficient multiplier in GF(2m) has many applications in cryptographic fields, for example, ECC. In that point optimal normal basis give attractiveness in area efficient implementation. In [2], Reyhani-Masoleh and Hasan suggested an area efficient linear array for multiplication in GF(2 m) with slightly increased critical path delay from Agnew et al's structure. But in [3], S.Kwon et al. suggested an area efficient linear array for multiplication in GF(2m) without losing time efficiency from Agnew et al's structure. We propose a modification of Reyhani-Masoleh and Hasan's structure with restriction to optimal normal basis type-II. The time and area efficiency of our multiplier is exactly same as that of S.Kwon et al's structure.

Original languageEnglish
Pages (from-to)647-656
Number of pages10
JournalLecture Notes in Computer Science
Volume3481
Issue numberII
DOIs
Publication statusPublished - 2005
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

Keywords

  • ECC
  • Finite fields
  • Gaussian Normal Basis
  • Massey-Omura multiplier

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Modified sequential normal basis multipliers for type II optimal normal bases'. Together they form a unique fingerprint.

  • Cite this