Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over $GF(2^{m})$

  • Authors:

  • Sun-Mi Park;Ku-Young Chang

  • Affiliations:

  • Department of Mathematical Sciences, Korea Advanced Institute of Science and Technology, Daejeon, Korea;Cryptography Research Team, Electronics and Telecommunications Research Institute, Daejeon, Korea

  • Venue:
  • IEEE Transactions on Very Large Scale Integration (VLSI) Systems
  • Year:
  • 2011

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we present a new method to compute the Mastrovito matrix for $GF(2^{m})$ generated by an arbitrary irreducible polynomial using weakly dual basis of shifted polynomial basis. In particular, we derive the explicit formulas of the proposed multiplier for special type of irreducible pentanomial $x^{m}+x^{k_{3}}+x^{k_{2}}+x^{k_{1}}+1$ with $k_{1} . As a result, the time complexity of the proposed multiplier matches or outperforms the previously known results. On the other hand, the number of XOR gates of the proposed multiplier is slightly greater than the best known results.