Parallel GF(2n) multipliers

Abstract

Operations over polynomial Galois fields GF(2n) are employed in a variety of cryptographic systems. These operations include multiplication and reduction with respect to an irreducible polynomial modulus. Fast parallel multipliers can be designed but require substantial die area. Building on prior work, two fully parallel polynomial n× n multipliers are presented with O(log2 n) latency, which use lookup tables to store modular reduction terms.