Issue No. 08 - August (1998 vol. 47)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.707588
<p><b>Abstract</b>—New implementations of bit-parallel multipliers for a class of finite fields are proposed. The class of finite fields is constructed with irreducible AOPs (all one polynomials) and ESPs (equally spaced polynomials). The size and time complexities of our proposed multipliers are lower than or equal to those of the previously proposed multipliers of the same class.</p>
Galois or finite fields, bit-parallel multiplier, all one polynomial, equally spaced polynomial, dual basis.
M. A. Hasan and H. Wu, "Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields," in IEEE Transactions on Computers, vol. 47, no. , pp. 883-887, 1998.