International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Paper: Optimal Irreducible Polynomials for GF(2^m) Arithmetic

Authors:
Michael Scott
Download:
URL: http://eprint.iacr.org/2007/192
Search ePrint
Search Google
Abstract: The irreducible polynomials recommended for use by multiple standards documents are in fact far from optimal on many platforms. Specifically they are suboptimal in terms of performance, for the computation of field square roots and in the application of the ``almost inverse'' field inversion algorithm. In this paper we question the need for the standardisation of irreducible polynomials in the first place, and derive the ``best'' polynomials to use depending on the underlying processor architecture. Surprisingly it turns out that a trinomial polynomial is in many cases not necessarily the best choice. Finally we make some specific recommendations for some particular types of architecture.
BibTeX
@misc{eprint-2007-13473,
  title={Optimal Irreducible Polynomials for GF(2^m) Arithmetic},
  booktitle={IACR Eprint archive},
  keywords={implementation / Irreducible polynomials, implementation},
  url={http://eprint.iacr.org/2007/192},
  note={ mike@computing.dcu.ie 13663 received 23 May 2007, last revised 30 May 2007},
  author={Michael Scott},
  year=2007
}