Loading web-font TeX/Math/Italic
Fast Bit-Parallel Shifted Polynomial Basis Multiplier Using Weakly Dual Basis Over - | IEEE Journals & Magazine | IEEE Xplore

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


Abstract:

In this paper, we present a new method to compute the Mastrovito matrix for GF(2m) generated by an arbitrary irreducible polynomial using weakly dual basis of shifted pol...Show More

Abstract:

In this paper, we present a new method to compute the Mastrovito matrix for GF(2m) 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 xm+xk3+xk2+xk1+1 with k1 <; k2 ≤ (k1+k3)/2 <; k3 <; min(2k1,m/2). 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.
Page(s): 2317 - 2321
Date of Publication: 28 October 2010

ISSN Information:


References

References is not available for this document.