Affiliation: Tsinghua University
Overlap-free Karatsuba-Ofman Polynomial Multiplication Algorithm
We describe how a recently proposed way to split input operands allows for fast VLSI implementations of GF(2)[x] Karatsuba-Ofman multipliers. The XOR gate delay of the proposed multiplier is better than that of previous Karatsuba-Ofman multipliers. For example, it is reduced by about 33% and 25% for n = 2^i and n = 3^i (i > 1), respectively.