New bit parallel multiplier with low space complexity for all irreducible trinomials over GF(2 n)

Young In Cho, Nam Su Chang, Chang Han Kim, Young Ho Park, Seokhie Hong

Research output: Contribution to journalArticle

11 Citations (Scopus)


Koç and Sunar proposed an architecture of the Mastrovito multiplier for the irreducible trinomial f(x)=x n+x k+1 , where k ≠ 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' for all irreducible trinomials.

Original languageEnglish
Article number5999752
Pages (from-to)1903-1908
Number of pages6
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Issue number10
Publication statusPublished - 2012 Jan 1


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

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture
  • Software

Cite this