New bit-serial systolic multiplier for GF (2 m ) using irreducible trinomials
Menouer Diab, Alain Poli · Electronics Letters · 1991
A bit-serial systolic architecture is presented for the product-sum computation P = AB + C in a finite field GF(2m) = GF(2)[x]/[F(x)], such that F(x) = xm + x + 1 is an irreducible trinomial over GF(2). It has a low complexity and does not require connections for the serial transfer of F(x).