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

Authors:
Huapeng Wu
Affiliations:
Univ of Windsor, Windsor
Venue:
IEEE Transactions on Computers
Year:
2008

Citing 0
Cited 3

Efficient bit-parallel multipliers over finite fields GF(2m)

Computers and Electrical Engineering
Low-complexity multiplier for GF(2m) based on all-one polynomials

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Low latency systolic montgomery multiplier for finite field GF(2m) based on pentanomials

IEEE Transactions on Very Large Scale Integration (VLSI) Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

In this paper, three small classes of finite fields GF$(2^m)$ 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.