Title :
Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
Author :
Koc, C.K. ; Sunar, B.
Author_Institution :
Dept. of Electr. & Comput. Eng., Oregon State Univ., Corvallis, OR, USA
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 m 2-1 XOR gates and m2 AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier
Keywords :
Galois fields; computational complexity; digital arithmetic; logic gates; polynomials; AND gates; GF(2m) field; XOR gates; all-one-polynomial; finite fields; low-complexity bit-parallel canonical basis multipliers; normal basis multipliers; Algebra; Application software; Codes; Concurrent computing; Cryptography; Delay; Digital arithmetic; Galois fields; Hardware; Timing;
Conference_Titel :
Information Theory, 1998. Proceedings. 1998 IEEE International Symposium on
Conference_Location :
Cambridge, MA
Print_ISBN :
0-7803-5000-6
DOI :
10.1109/ISIT.1998.708899
