Low-complexity linear array multiplier for normal basis of type-II

In many cryptographic applications, the finite field is usually defined as the normal basis representation, and accordingly, much research on fast implementation of such a basis are reported. By restricting the characteristics of an optimal normal basis (ONB) of type-II, we used the palindromic representation of type-II ONB to derive a linear array multiplier with a low-complexity architecture. The space complexity of the proposed multiplier can be reduced from O(m/sup 2/) to O(m) as compared with the related normal basis multipliers.