论文信息 - Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields

Low-Complexity Bit-Parallel Canonical and Normal Basis Multipliers for a Class of Finite Fields

We present a new low-complexity bit-parallel canonical basis multiplier for the field GF(2m) generated by an all-one-polynomial. The proposed canonical basis multiplier requires m/sup 2/-1 XOR gates and m/sup 2/ AND gates. We also extend this canonical basis multiplier to obtain a new bit-parallel normal basis multiplier.

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

[1] J. Davenport. Editor , 1960 .

[2] Trieu-Kien Truong,et al. VLSI Architectures for Computing Multiplications and Inverses in GF(2m) , 1983, IEEE Transactions on Computers.

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

[4] Toshiya Itoh,et al. Structure of Parallel Multipliers for a Class of Fields GF(2^m) , 1989, Inf. Comput..

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

[6] Vijay K. Bhargava,et al. Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2^m) , 1992, IEEE Trans. Computers.

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

[8] Harald Niederreiter,et al. Introduction to finite fields and their applications: Preface , 1994 .

[9] B. Sunar,et al. Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields , 1998, Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252).