Low complexity bit-parallel systolic multiplier over GF(2m) using irreducible trinomials

A bit-parallel systolic multiplier in the finite field GF(2^m) over the polynomial basis, where irreducible trinomials x^m+xⁿ+1 generate the fields GF(2^m) is presented. The latency of the proposed multiplier requires only 2m-1 clock cycles. The architecture has the advantage of low latency, low circuit complexity and high throughput, as compared with traditional systolic multipliers. Moreover, the multiplier is highly regular, modular, and therefore, well-suited for VLSI implementation.