Efficient Implementation of Punctured Parallel Finite Field Multipliers

Finite field multipliers are embedded in many applications. In some applications, e.g., in cryptographic primitives protected by security oriented codes, only r bits out of the m-bit product are required. In such cases, the circuit area can be significantly reduced by implementing a punctured finite field multiplier. This article deals with efficient implementation of multipliers. It is shown that the number of binary operations (equivalently, the number of gates) depends on both the chosen irreducible polynomial that defines the finite field and the indices of the r coordinates that are computed. Upper and lower bounds are presented on the implementation cost of punctured multipliers over a finite field defined by an irreducible trinomial, and a set of r coordinates that achieves the lower bound is itemized.