Low-Complexity Bit-Parallel Square Root Computation over GF(2^) for All Trinomials

In this contribution, we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied to any type of irreducible polynomials. We derive explicit formulas for the space and time complexities associated with the square ro...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on computers Jg. 57; H. 4; S. 472 - 480
Hauptverfasser:	Rodriguez-Henriquez, F., Morales-Luna, G., Lopez, J.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.04.2008 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Complexity theory Computation Computational efficiency Computations in finite fields Computer arithmetic Computing time Delay Elliptic curves Equations Finite element methods Galois fields Hardware Logic gates Mathematical analysis Operators Polynomials Roots Computations in finite fields Computer arithmetic Algorithms
ISSN:	0018-9340, 1557-9956
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!