IACR News item: 08 November 2012
Xi Xiong, Haining Fan
ePrint Report
We present explicit formulae and complexities of bit-parallel shifted polynomial basis (SPB)
squarers in finite field $GF(2^{n})$s generated by general irreducible trinomials
$x^{n}+x^{k}+1$ ($0< k
Additional news items may be found on the IACR news page.