On comparison and analysis of algorithms for multiplication in GF(2m)

Changho Seo, Jong In Lim, Hichun Eun

Research output: Contribution to journalArticle


The design of a good finite field multiplication algorithm that can be realized easily on VLSI chips is important in the implementation of Reed-Solomon encoders, decoders, and in some cryptographic algorithms. In this paper, a new algorithm to carry out fast multiplication in the finite field GF(2m) using modified standard basis is presented. The new algorithm will be proved to be more efficient than the usual normal basis algorithm. The implementation has been done in a SUN SPARC-2 station, using C-language.

Original languageEnglish
Pages (from-to)456-459
Number of pages4
JournalJournal of Computer and System Sciences
Issue number3
Publication statusPublished - 1995 Dec 1

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Theoretical Computer Science
  • Applied Mathematics
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'On comparison and analysis of algorithms for multiplication in GF(2<sup>m</sup>)'. Together they form a unique fingerprint.

  • Cite this