The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1998 vol.47)
pp: 883-887
ABSTRACT
<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>
INDEX TERMS
Galois or finite fields, bit-parallel multiplier, all one polynomial, equally spaced polynomial, dual basis.
CITATION
Huapeng Wu, M. Anwarul Hasan, "Low Complexity Bit-Parallel Multipliers for a Class of Finite Fields", IEEE Transactions on Computers, vol.47, no. 8, pp. 883-887, August 1998, doi:10.1109/12.707588
27 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool