On Comparison and Analysis of Algorithms for Multiplication in GF(2m)

C. Seo; J. Lim; H. C. Eun

doi:10.1006/jcss.1995.1081

On Comparison and Analysis of Algorithms for Multiplication in GF(2^m)

C. Seo, J. Lim, H. C. Eun

School of Cybersecurity

Research output: Contribution to journal › Article › peer-review

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(2^m) 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 language	English
Pages (from-to)	456-459
Number of pages	4
Journal	Journal of Computer and System Sciences
Volume	51
Issue number	3
DOIs	https://doi.org/10.1006/jcss.1995.1081
Publication status	Published - 1995 Dec

ASJC Scopus subject areas

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

Access to Document

10.1006/jcss.1995.1081

Cite this

@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 = "C. Seo and J. Lim and Eun, {H. C.}",

year = "1995",

month = dec,

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, C.

AU - Lim, J.

AU - Eun, H. C.

PY - 1995/12

Y1 - 1995/12

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

U2 - 10.1006/jcss.1995.1081

DO - 10.1006/jcss.1995.1081

M3 - Article

AN - SCOPUS:0029517099

SN - 0022-0000

VL - 51

SP - 456

EP - 459

JO - Journal of Computer and System Sciences

JF - Journal of Computer and System Sciences

IS - 3

ER -

On Comparison and Analysis of Algorithms for Multiplication in GF(2^m)

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this