论文信息 - An Efficient Optimal Normal Basis Type II Multiplier

An Efficient Optimal Normal Basis Type II Multiplier

This paper presents a new parallel multiplier for the Galois field GF(2/sup m/) whose elements are represented using the optimal normal basis of type II. The proposed multiplier requires 1.5(m/sup 2/-m) XOR gates, as compared to 2(m/sup 2/-m) XOR gates required by the Massey-Omura multiplier. The time complexities of the proposed and the Massey-Omura multipliers are similar.

Berk Sunar | Çetin Kaya Koç | B. Sunar | Ç. Koç

[1] A. Menezes,et al. Applications of Finite Fields , 1992 .

[2] V.K. Bhargava,et al. A Modified Massey-Omura Parallel Multiplier for a Class of Finite Fields , 1993, IEEE Trans. Computers.

[3] J. Davenport. Editor , 1960 .

[4] Berk Sunar,et al. Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields , 1998, IEEE Trans. Computers.

[5] Edoardo D. Mastrovito,et al. VLSI Designs for Multiplication over Finite Fields GF (2m) , 1988, AAECC.

[6] H. Niederreiter,et al. Introduction to finite fields and their applications: Factorization of Polynomials , 1994 .

[7] G. Seroussi,et al. Efficient Arithmetic in GF ( 2 n ) through Palindromic Representation , 1998 .

[8] Toshiya Itoh,et al. Structure of Parallel Multipliers for a Class of Fields GF(2^m) , 1989, Information and Computation.