Fast modular reduction and squaring in GF(2m)

We present an efficient bit-parallel algorithm for squaring in GF(2m) using polynomial basis. This algorithm achieves competitive efficiency while being aimed at any choice of low-weight irreducible polynomial. For a large class of irreducible polynomials it is more efficient than the previously bes...

Celý popis

Podrobná bibliografia

Vydané v:	Information processing letters Ročník 132; s. 33 - 38
Hlavní autori:	Niehues, L. Boppre, Custódio, R., Panario, D.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 01.04.2018
Predmet:	Cryptography Finite field Number theory Polynomial Squaring Polynomial Finite field Cryptography Number theory Squaring
ISSN:	0020-0190, 1872-6119
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!