We present a new formulation of the Mastrovito multiplication matrix and an architecture for the multiplication operation in 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―Δ)XOR gates and m~2 AND gates, where Δis the spacing factor.
展开▼
