On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits"

On "A new representation of elements of finite fields GF(2/sup m/) yielding small complexity arithmetic circuits"

For original article see G. Drolet, ibid., vol. 47, no. 9, p. 938-946, (Sept 1998). We characterize the smallest n with GF(2)[X]/(X/sup n/ + 1) containing an isomorphic copy of GF(2/sup m/). This characterization shows that the representation of finite fields described in a previous issue of the IEE...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on computers 2002-12, Vol.51 (12), p.1460-1461
Hauptverfasser: Geiselmann, W., Muller-Quade, J., Steinwandt, R.
Format: Artikel
Sprache:eng
Schlagworte:
Arithmetic
Circuits
Complexity
Galois fields
Hardware
Mathematical analysis
Optimization
Polynomials
Representations
Reproduction
Very large scale integration
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:For original article see G. Drolet, ibid., vol. 47, no. 9, p. 938-946, (Sept 1998). We characterize the smallest n with GF(2)[X]/(X/sup n/ + 1) containing an isomorphic copy of GF(2/sup m/). This characterization shows that the representation of finite fields described in a previous issue of the IEEE Transactions on Computers is not "optimal" as claimed. The representation considered there can often be improved significantly.
ISSN:0018-9340
1557-9956
DOI:10.1109/TC.2002.1146713