论文信息 - Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields - 字舞流文

Low Complexity Bit-Parallel Multiplier for a Class of Finite Fields

This short paper summarizes our recent results on construction of low-complexity bit-parallel finite field multiplier using polynomial basis. The complexity and time delay of the proposed multipliers are lower than those of the similar proposals.

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

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

[3] Mohammed Benaissa,et al. GF(2^m) Multiplication and Division Over the Dual Basis , 1996, IEEE Trans. Computers.

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

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

[6] M.A. Hasan,et al. New Low-Complexity Bit-Parallel Finite Field Multipliers Using Weakly Dual Bases , 1998, IEEE Trans. Computers.

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