Mastrovito Multiplier for All Trinomials

@article{Sunar1999MastrovitoMF,
  title={Mastrovito Multiplier for All Trinomials},
  author={Berk Sunar and Çetin Kaya Koç},
  journal={IEEE Trans. Computers},
  year={1999},
  volume={48},
  pages={522-527}
}
An efficient algorithm for the multiplication in GF (2 m) was introduced by Mastrovito. The space complexity of the Mastrovito multiplier for the irreducible trinomial x m + x + 1 was given as m 2 − 1 XOR and m 2 AND gates. In this paper, we describe an architecture based on a new formulation of the multiplication matrix, and show that the Mastrovito multiplier for the generating trinomial x m + x n + 1, where m = 2n, also requires m 2 − 1 XOR and m 2 AND gates. However, m 2 − m/2 XOR gates are… CONTINUE READING

From This Paper

Figures, tables, and topics from this paper.

Citations

Publications citing this paper.
SHOWING 1-10 OF 134 CITATIONS, ESTIMATED 25% COVERAGE

FILTER CITATIONS BY YEAR

1998
2019

CITATION STATISTICS

  • 26 Highly Influenced Citations

  • Averaged 6 Citations per year over the last 3 years

Similar Papers

Loading similar papers…