Bit-serial multiplication in GF(2m) using irreducible all-one polynomials
Authors:
- 1 January 1997
- journal article
- Published by Institution of Engineering and Technology (IET) in IEE Proceedings - Computers and Digital Techniques
- Vol. 144 (6) , 391-393
Abstract
Two architectures for carrying out bit-serial multiplication in GF(2m) are presented where the defining irreducible polynomial for the field is an all-one polynomial. The multipliers presented have low hardware requirements, regular structures and are therefore suitable for VLSI implementation.Keywords
This publication has 3 references indexed in Scilit:
- DVB channel coding standards for broadcasting compressed video servicesElectronics & Communication Engineering Journal, 1997
- GF(2/sup m/) multiplication and division over the dual basisIEEE Transactions on Computers, 1996
- Structure of parallel multipliers for a class of fields GF(2m)Information and Computation, 1989