ON COMPARISON AND ANALYSIS OF ALGORITHMS FOR MULTIPLICATION IN GF(2(M))

Authors
SEO C LIM J EUN HC
Citation
C. Seo et al., ON COMPARISON AND ANALYSIS OF ALGORITHMS FOR MULTIPLICATION IN GF(2(M)), Journal of computer and system sciences, 51(3), 1995, pp. 456-459
Citations number
14
Categorie Soggetti
System Science","Computer Science Hardware & Architecture","Computer Science Theory & Methods
Journal title
Journal of computer and system sciences → ACNP
ISSN journal
00220000
Volume
51
Issue
3
Year of publication
1995
Pages
456 - 459
Database
ISI
SICI code
0022-0000(1995)51:3<456:OCAAOA>2.0.ZU;2-T
Abstract
The design of a good finite field multiplication algorithm that can be realized easily on VLSI chips is important in the implementation of R eed-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 norm al basis algorithm. The implementation has been done in a SUN SPARC-2 station, using C-language. (C) 1995 Academic Press, Inc.