$GF(2^n)$ Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials

Xi Xiong and Haining Fan

Abstract

We present explicit formulae and complexities of bit-parallel $GF(2^{n})$ squarers for a new class of irreducible pentanomials $x^{n}+x^{n-1}+x^{k}+x+1$, where $n$ is odd and $1<k<(n-1)/2$. The squarer is based on the generalized polynomial basis of $GF(2^{n})$. Its gate delay matches the best results, while its XOR gate complexity is $n+1$, which is only about 2/3 of the current best results.

Available format(s)
Category
Implementation
Publication info
Preprint. MINOR revision.
Keywords
•implementation
Contact author(s)
xixiong91 @ gmail com
History
Short URL
https://ia.cr/2014/003

CC BY

BibTeX

@misc{cryptoeprint:2014/003,
author = {Xi Xiong and Haining Fan},
title = {$GF(2^n)$ Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials},
howpublished = {Cryptology ePrint Archive, Paper 2014/003},
year = {2014},
note = {\url{https://eprint.iacr.org/2014/003}},
url = {https://eprint.iacr.org/2014/003}
}

Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.