Efficient Multiplier Architectures for Galois Fields GF(2 4n)

This contribution introduces a new class of multipliers for finite fields GF((2 n ) 4 ). The architecture is based on a modified version of the Karatsuba-Ofman algorithm (KOA). By determining optimized field polynomials of degree four, the last stage of the KOA and the modulo reduction can be combined. This saves computation and area in VLSI implementations… (More)