Welcome to the resource topic for 2012/626
Title:
Bit-Parallel GF(2^{n}) Squarer Using Shifted Polynomial Basis
Authors: Xi Xiong, Haining Fan
Abstract: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 <n) and type-II irreducible pentanomials x^{n}+x^{k+1}+x^{k}+x^{k-1}+1 (3<k<(n-3)/2). The complexities of the proposed squarers match or slightly outperform the previous best results. These formulae can also be used to design polynomial basis Montgomery squarers without any change. Furthermore, we show by examples that XOR gate numbers of SPB squarers are different when different shift factors in the SPB definition, i.e., parameter v in {\{}x^{i-v}|0\leq i\leq n-1 {\}}, are used. This corrects previous misinterpretation.
ePrint: https://eprint.iacr.org/2012/626
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .