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...

Full description

Bibliographic Details

Published in:	Information processing letters Vol. 132; pp. 33 - 38
Main Authors:	Niehues, L. Boppre, Custódio, R., Panario, D.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.04.2018
Subjects:	Cryptography Finite field Number theory Polynomial Squaring Polynomial Finite field Cryptography Number theory Squaring
ISSN:	0020-0190, 1872-6119
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!