Highly Influenced

10 Excerpts

@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} }

- Published in IEEE Trans. Computers 1999
DOI:10.1109/12.769434

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

SHOWING 1-10 OF 134 CITATIONS, ESTIMATED 25% COVERAGE

Highly Influenced

10 Excerpts

Highly Influenced

7 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

22 Excerpts

Highly Influenced

8 Excerpts

Highly Influenced

8 Excerpts

Highly Influenced

10 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

5 Excerpts

Highly Influenced

10 Excerpts

**26**Highly Influenced Citations**Averaged 6 Citations**per year over the last 3 years

SHOWING 1-4 OF 4 REFERENCES

Loading similar papers…