International Association
for Cryptologic Research

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