New Bit Parallel Multiplier With Low Space Complexity for All Irreducible Trinomials Over GF(2(n))

作者：Cho Young In^*; Chang Nam Su; Kim Chang Han; Park Young Ho; Hong Seokhie

来源：IEEE Transactions on Very Large Scale Integration Systems, 2012, 20(10): 1903-1908.

DOI：10.1109/TVLSI.2011.2162594

• Bit-parallel multiplier
• finite field
• irreducible trinomial
• Mastrovito multiplication
• polynomial basis

Koc and Sunar proposed an architecture of the Mastrovito multiplier for the irreducible trinomial f(x) = x(n) + x(k) + 1, where k not equal n/2 to reduce the time complexity. Also, many multipliers based on the Karatsuba-Ofman algorithm (KOA) was proposed that sacrificed time efficiency for low space complexity. In this paper, a new multiplication formula which is a variant of KOA presented. We also provide a straightforward architecture of a non-pipelined bit-parallel multiplier using the new formula. The proposed multiplier has lower space complexity than and comparable time complexity to previous Mastrovito multipliers%26apos; for all irreducible trinomials.

• 出版日期2012-10