Low complexity parallel multipliers for Galois fields GF((2/sup n/)/sup 4/) based on special types of primitive polynomials
Christof Paar · 2002
This work is concerned with architectures for parallel multipliers with low complexity in finite fields of the type GF((2/sup n/)/sup 4/) which are isomorphic to GF(2/sup k/), k=4n. The multiplier is based on a shortened version of the Karatsuba-Ofman algorithm (1963) and a special class of polynomials which improves the k/sup 2/ complexity bound by 44%.>