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

Changho Seo, Jong In Lim, Hichun Eun

Research output: Contribution to journalArticle

Abstract

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
Volume51
Issue number3
DOIs
Publication statusPublished - 1995 Dec 1

Fingerprint

Analysis of Algorithms
Multiplication
Galois field
Normal Basis
Standard Basis
Encoder
Chip

ASJC Scopus subject areas

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

Cite this

On comparison and analysis of algorithms for multiplication in GF(2m). / Seo, Changho; Lim, Jong In; Eun, Hichun.

In: Journal of Computer and System Sciences, Vol. 51, No. 3, 01.12.1995, p. 456-459.

Research output: Contribution to journalArticle

@article{a32894fed4214851bd5b8ee05b2fb5a5,
title = "On comparison and analysis of algorithms for multiplication in GF(2m)",
abstract = "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.",
author = "Changho Seo and Lim, {Jong In} and Hichun Eun",
year = "1995",
month = "12",
day = "1",
doi = "10.1006/jcss.1995.1081",
language = "English",
volume = "51",
pages = "456--459",
journal = "Journal of Computer and System Sciences",
issn = "0022-0000",
publisher = "Academic Press Inc.",
number = "3",

}

TY - JOUR

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

AU - Seo, Changho

AU - Lim, Jong In

AU - Eun, Hichun

PY - 1995/12/1

Y1 - 1995/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0029517099&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029517099&partnerID=8YFLogxK

U2 - 10.1006/jcss.1995.1081

DO - 10.1006/jcss.1995.1081

M3 - Article

VL - 51

SP - 456

EP - 459

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

SN - 0022-0000

IS - 3

ER -