Low-complexity finite field multiplier using irreducible trinomials

Abstract

A low-complexity array multiplier for GF(2m) fields with an irreducible trinomial Xm+Xn+1 is presented. The space complexity of the proposed multiplier is reduced from order O(m2) to O(m) compared with the Lee's array multiplier. The time complexity of the proposed multiplier is about half that of Lee's array multiplier.