Issue No. 12 - December (2003 vol. 52)
?etin Kaya Ko? , IEEE
<p><b>Abstract</b>—The state-of-the-art Galois field GF(2^m) multipliers offer advantageous space and time complexities when the field is generated by some special irreducible polynomial. To date, the best complexity results have been obtained when the irreducible polynomial is either a trinomial or an equally spaced polynomial (ESP). Unfortunately, there exist only a few irreducible ESPs in the range of interest for most of the applications, e.g., error-correcting codes, computer algebra, and elliptic curve cryptography. Furthermore, it is not always possible to find an irreducible trinomial of degree m in this range. For those cases where neither an irreducible trinomial nor an irreducible ESP exists, the use of irreducible pentanomials has been suggested. Irreducible pentanomials are abundant, and there are several eligible candidates for a given m. In this paper, we promote the use of two special types of irreducible pentanomials. We propose new Mastrovito and dual basis multiplier architectures based on these special irreducible pentanomials and give rigorous analyses of their space and time complexity.</p>
Finite fields arithmetic, parallel multipliers, pentanomials, multipliers for GF(2^m).
?. K. Ko? and F. Rodr?guez-Henr?quez, "Parallel Multipliers Based on Special Irreducible Pentanomials," in IEEE Transactions on Computers, vol. 52, no. , pp. 1535-1542, 2003.