Cryptology ePrint Archive: Report 2014/003

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

Category / Keywords: implementation / •implementation

Date: received 1 Jan 2014

Contact author: xixiong91 at gmail com

Available format(s): PDF | BibTeX Citation

Version: 20140102:095907 (All versions of this report)

Short URL: ia.cr/2014/003

Discussion forum: Show discussion | Start new discussion