Subscribe

Issue No.08 - August (2008 vol.57)

pp: 1023-1031

Huapeng Wu , Univ of Windsor, Windsor

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.2008.67

ABSTRACT

In this paper, three small classes of finite fields GF$(2^m)$ are found for which low complexity bit-parallel multipliers are proposed. The proposed multipliers have lower complexities compared to those based on the irreducible pentanomials. It is also shown that there does not always exist an irreducible all-one polynomial, equally-spaced polynomial, or trinomial for the new classes of fields.

INDEX TERMS

Finite fields arithmetic, hardware architecture, polynomial basis, irreducible polynomial.

CITATION

Huapeng Wu, "Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields",

*IEEE Transactions on Computers*, vol.57, no. 8, pp. 1023-1031, August 2008, doi:10.1109/TC.2008.67REFERENCES