Dual basis systolic multipliers for GF(2^m)

Two systolic multipliers for GF(2^m) are presented, one bit-serial and one bit-parallel. Both multipliers are hardware efficient and support pipelining. Both architectures are highly regular, require only local communication lines and have longest delay paths independent of m. Consequently these multipliers can be clocked at high speeds and are suitable for VLSI implementation. The design of both these multipliers is also independent of the defining irreducible polynomial for the field