Design and Implementation of a Polynomial Basis Multiplier Architecture Over GF(2m)

In this paper, the design and circuit implementation of a polynomial basis multiplier architecture over Galois Fields GF(2(m)) is presented. The proposed architecture supports field multiplication of two m-term polynomials where m is a positive integer. Circuit implementations based on this parameterized architecture where m is configurable is suitable for applications in error control coding and cryptography. The proposed architecture offers low latency, polynomial basis multiplication where the irreducible polynomial P(x) = x (m) + p (kt) . x (kt) + aEuro broken vertical bar aEuro parts per thousand+ p (1). x + 1 with m a parts per thousand yen kt + 4 is dynamically reconfigurable. Results of the complexity analysis show that the proposed architecture requires less logic resources compared to existing sequential polynomial basis multipliers. In terms of timing performance, the proposed architecture has a latency of m/4, which is the lowest among the multipliers found in literature for GF(2(m)).