This Article 
 Bibliographic References 
 Add to: 
Mastrovito Multiplier for General Irreducible Polynomials
May 2000 (vol. 49 no. 5)
pp. 503-518

Abstract—We present a new formulation of the Mastrovito multiplication matrix for the field $GF(2^m)$ generated by an arbitrary irreducible polynomial. We study in detail several specific types of irreducible polynomials, e.g., trinomials, all-one-polynomials, and equally-spaced-polynomials, and obtain the time and space complexity of these designs. Particular examples illustrating the properties of the proposed architecture are also given. The complexity results established in this paper match the best complexity results known to date. The most important new result is the space complexity of the Mastrovito multiplier for an equally-spaced-polynomial, which is found as $(m^2 - \Delta)$ XOR gates and $m^2$ AND gates, where $\Delta$ is the spacing factor.

[1] G. Golub and C. Van Loan, Matrix Computations, third ed. Baltimore: Johns Hopkins Univ. Press, 1996.
[2] A. Halbutogullari and Ç.K. Koç, “Mastrovito Multiplier for General Irreducible Polynomials,” Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, pp. 498-507, 1999.
[3] M.A. Hasan, M. Wang, and V.K. Bhargava, Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields$GF(2^m)$ IEEE Trans. Computers, vol. 41, no. 8, pp. 962-971, Aug. 1992.
[4] T. Itoh and S. Tsujii, “Structure of Parallel Multipliers for a Class of Finite Fields$GF(2^m)$,” Information and Computation, vol. 83, pp. 21-40, 1989.
[5] Ç.K. Koç and B. Sunar, Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields IEEE Trans. Computers, vol. 47, no. 3, pp. 353-356, Mar. 1998.
[6] R. Lidl and H. Niederreiter,An Introduction to Finite Fields and Their Applications.Cambridge: Cambridge Univ. Press, 1986.
[7] E.D. Mastrovito,"VLSI Design for Multiplication over Finite Fields," LNCS-357, Proc. AAECC-6, pp. 297-309,Rome, July 1988, Springer-Verlag.
[8] E.D. Mastrovito, “VLSI Architectures for Computation in Galois Fields,” PhD thesis, Dept. of Electrical Eng., Linköping Univ., Linköping, Sweden, 1991.
[9] A.J. Menezes, Elliptic Curve Public Key Cryptosystems. Boston: Kluwer Academic, 1993.
[10] A.J. Menezes, I.F. Blake, X. Gao, R.C. Mullen, S.A. Vanstone, and T. Yaghoobian, Applications of Finite Fields. Boston: Kluwer Academic, 1993.
[11] J. Omura and J. Massey, “Computational Method and Apparatus for Finite Field Arithmetic,” U.S. Patent Number 4,587,627, May 1986.
[12] C. Paar, “Efficient VLSI Architectures for Bit Parallel Computation in Galois Fields,” PhDthesis, Universität GH Essen, VDI Verlag, 1994.
[13] C. Paar, “A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Fields,” IEEE Trans. Computers, vol. 45, no. 7, pp. 846-861, July 1996.
[14] B. Sunar and Ç.K. Koç, Mastrovito Multiplier for All Trinomials IEEE Trans. Computers, vol. 48, no. 5, pp. 522-527, May 1999.

Index Terms:
Finite fields, multiplication, polynomial basis, complexity, irreducible polynomials.
A. Halbutogullari, Çetin K. Koç, "Mastrovito Multiplier for General Irreducible Polynomials," IEEE Transactions on Computers, vol. 49, no. 5, pp. 503-518, May 2000, doi:10.1109/12.859542
Usage of this product signifies your acceptance of the Terms of Use.