Bit Serial Multiplication in Finite Fields

Bit serial multiplication schemes for hardware implementation of arithmetic in a finite field of characteristic two are considered. In addition, certain aspects of polynomial bases in finite fields are investigated.

[1]  Ronald C. Mullin,et al.  Optimal normal bases in GF(pn) , 1989, Discret. Appl. Math..

[2]  F. MacWilliams,et al.  The Theory of Error-Correcting Codes , 1977 .

[3]  Elwyn R. Berlekamp,et al.  Bit-serial Reed - Solomon encoders , 1982, IEEE Transactions on Information Theory.