Polynomial Basis Multiplication over GF(2m)

In this paper, we describe, analyze and compare various $GF(2^m)$ multipliers. Particularly, we investigate the standard modular multiplication, the Montgomery multiplication, and the matrix–vector multiplication techniques.

[1]  Tong Zhang,et al.  Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials , 2001, IEEE Trans. Computers.

[2]  ÇETIN K. KOÇ,et al.  Montgomery Multiplication in GF(2k) , 1998, Des. Codes Cryptogr..

[3]  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.

[4]  Huapeng Wu,et al.  Bit-Parallel Finite Field Multiplier and Squarer Using Polynomial Basis , 2002, IEEE Trans. Computers.

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

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

[7]  M. Anwar Hasan,et al.  Low complexity bit parallel architectures for polynomial basis multiplication over GF(2m) , 2004, IEEE Transactions on Computers.

[8]  Berk Sunar,et al.  Mastrovito Multiplier for All Trinomials , 1999, IEEE Trans. Computers.

[9]  Alfred Menezes,et al.  Handbook of Applied Cryptography , 2018 .

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

[11]  M. Anwar Hasan,et al.  Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields , 1998, 2006 International Conference on Communications, Circuits and Systems.

[12]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: List of Symbols , 1986 .

[13]  Çetin Kaya Koç,et al.  Mastrovito Multiplier for General Irreducible Polynomials , 2000, IEEE Trans. Computers.

[14]  Huapeng Wu.  Montgomery Multiplier and Squarer for a Class of Finite Fields , 2002, IEEE Trans. Computers.