Another Look at the Sequential Multiplier over Normal Bases

The Massey-Omura multiplier is a well-known sequential multiplier over finite fields GF(2^m), which can perform multiplication in m clock cycles for the normal basis. In this article, the authors propose a new architecture to carry out the sequential multiplier using normal basis. The time complexity in each cycle of this new multiplier is O(1) and the number of inputs is lower down to m+1, instead of 2m, which is the number needed for most previous multipliers. These merits make it easier to the VLSI implementation