Title :
Low complexity bit-parallel multipliers for a class of finite fields
Author :
Wu, Huapeng ; Hasan, M. Anwarul
Author_Institution :
Dept. of Electr. & Comput. Eng., Waterloo Univ., Ont., Canada
fDate :
8/1/1998 12:00:00 AM
Abstract :
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
Keywords :
computational complexity; digital arithmetic; polynomials; all one polynomials; equally spaced polynomials; finite fields; low complexity bit-parallel multipliers; time complexities; Cryptography; Electrostatic precipitators; Galois fields; Message-oriented middleware; Polynomials;
Journal_Title :
Computers, IEEE Transactions on
