An efficient optimal normal basis type II multiplier

An efficient optimal normal basis type II multiplier

This paper presents a new parallel multiplier for the Galois field GF(2/sup m/) whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires 1.5(m/sup 2/-m) XOR gates, as compared to 2(m/sup 2/-m) XOR gates required by the Massey-Omura multiplier. The ti...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 2001-01, Vol.50 (1), p.83-87
Hauptverfasser: Sunar, B., Koc, C.K.
Format: Artikel
Sprache:eng
Schlagworte:
Algebra
Algorithm design and analysis
Application software
Codes
Complexity
Cryptography
Digital arithmetic
Galois fields
Gates
Hardware
Multipliers
Optimization
Polynomials
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:This paper presents a new parallel multiplier for the Galois field GF(2/sup m/) whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires 1.5(m/sup 2/-m) XOR gates, as compared to 2(m/sup 2/-m) XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar.
ISSN:0018-9340
1557-9956
DOI:10.1109/12.902754