Title :
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
Author :
KoÇ, Ç K. ; Sunar, B.
Author_Institution :
Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
fDate :
3/1/1998 12:00:00 AM
Abstract :
We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m2-1 XOR gates and m2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier
Keywords :
computational complexity; digital arithmetic; logic design; multiplying circuits; all-one-polynomial; bit-parallel; canonical basis; finite fields; low-complexity; multiplication; multiplier; normal basis; Algebra; Application software; Codes; Cryptography; Digital arithmetic; Galois fields; Hardware; Polynomials; Process design;
Journal_Title :
Computers, IEEE Transactions on
