Efficient Bit-Parallel Multiplier for Irreducible Pentanomials Using a Shifted Polynomial Basis

摘要

In this paper, we present a bit-parallel multiplier for GF(2^m) defined by an irreducible pentanomial x^m+x^{k_3}+x^{k_2}+x^{k_1}+1, where 1leq k_1 < k_2