Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields

We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m/sup 2/-1 XOR gates and m/sup 2/ AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel n...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 1998-03, Vol.47 (3), p.353-356
Hauptverfasser: Koc, C.K., Sunar, B.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Algorithmics. Computability. Computer arithmetics
Application software
Applied sciences
Codes
Computer science
control theory
systems
Cryptography
Digital arithmetic
Exact sciences and technology
Galois fields
Hardware
Polynomials
Process design
Theoretical computing
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m/sup 2/-1 XOR gates and m/sup 2/ AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.
ISSN:0018-9340
1557-9956
DOI:10.1109/12.660172