论文信息 - Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields

Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields

In this paper, three small classes of finite fields GF(2m) are found for which low complexity bit-parallel multipliers are proposed. The proposed multipliers have lower complexities compared to those based on the irreducible pentanomials. It is also shown that there does not always exist an irreducible all-one polynomial, equally-spaced polynomial, or trinomial for the new classes of fields.

Huapeng Wu | Huapeng Wu

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

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

[3] Alfred Menezes,et al. Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[4] Vijay K. Bhargava,et al. Division and bit-serial multiplication over GF(qm) , 1992 .

[5] Francisco Rodríguez-Henríquez,et al. Parallel Multipliers Based on Special Irreducible Pentanomials , 2003, IEEE Trans. Computers.

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

[7] Elwyn R. Berlekamp,et al. Bit-serial Reed - Solomon encoders , 1982, IEEE Transactions on Information Theory.

[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] Tong Zhang,et al. Systematic Design of Original and Modified Mastrovito Multipliers for General Irreducible Polynomials , 2001, IEEE Trans. Computers.

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

[12] Ian F. Blake,et al. Finite Field Multiplier Using Redundant Representation , 2002, IEEE Trans. Computers.