Systematic design approach of Mastrovito multipliers over GF(2^m)

This paper considers the design of low-complexity bit-parallel dedicated finite field multiplier. A systematic design approach of Mastrovito multiplier is proposed, which is applicable to GF(2^m) generated by an arbitrary irreducible polynomial. This approach extensively exploits the spatial correlation of matrix elements in Mastrovito multiplication to reduce the complexity. The developed general Mastrovito multiplier is highly modular, which is desirable for VLSI hardware implementation. Meanwhile, the presented approach can be used to develop efficient Mastrovito multipliers for several special irreducible polynomials, such as trinomial and equally-spaced-polynomial, and further find some other special irreducible polynomials which can also lead to low-complexity multipliers.