The Community for Technology Leaders
ABSTRACT
<p><b>Abstract</b>—This paper presents a new parallel multiplier for the Galois field <tmath>$GF(2^m)$</tmath> whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires <tmath>$1.5(m^2-m)$</tmath> XOR gates, as compared to <tmath>$2(m^2-m)$</tmath> XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar.</p>
INDEX TERMS
Galois field, optimal normal basis, Massey-Omura multiplier, space complexity.
CITATION
Ç.k. Koç, B. Sunar, "An Efficient Optimal Normal Basis Type II Multiplier", IEEE Transactions on Computers, vol. 50, no. , pp. 83-87, January 2001, doi:10.1109/12.902754