The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.07 - July (2009 vol.58)
pp: 1001-1008
Alessandro Cilardo , University of Naples Federico II, Napoli
ABSTRACT
This work studies efficient bit-parallel multiplication in GF(2^m) for irreducible pentanomials, based on the so-called Shifted Polynomial Bases (SPBs). We derive a closed expression of the reduced SPB product for a class of polynomials x^m+x^{k_s}+ x^{k_{s-1}}+\cdots +x^{k_1}+1, with k_s-k_1\le {m+1\over 2}. Then, we apply the above formulation to the case of pentanomials. The resulting multiplier outperforms, or is as efficient as the best proposals in the technical literature, but it is suitable for a much larger class of pentanomials than those studied so far. Unlike previous works, this property enables the choice of pentanomials optimizing different field operations (for example, inversion), yet preserving an optimal implementation of field multiplication, as discussed and quantitatively proved in the last part of the paper.
INDEX TERMS
GF(2^m) bit-parallel multiplication, shifted polynomial bases, irreducible pentanomials.
CITATION
Alessandro Cilardo, "Efficient Bit-Parallel GF(2^m) Multiplier for a Large Class of Irreducible Pentanomials", IEEE Transactions on Computers, vol.58, no. 7, pp. 1001-1008, July 2009, doi:10.1109/TC.2009.16
REFERENCES
[1] I.F. Blake, G. Seroussi, and N.P. Smart, Elliptic Curves in Cryptography. Cambridge Univ. Press, 1999.
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool