On Fully Parallel Karatsuba Multipliers for GF(2^m)F. Rodriguez-Henriquez and C. K. KocProceedings of the International Conference on Computer Science and Technology - CST 2003, pages 405-410, Acta Press, Cancun, Mexico, May 19-21, 2003.AbstractIn this paper we present a new approach that generalizes the classic Karatsuba multiplier technique. In contrast with versions of this algorithm previously discussed [1,2], in our approach we do not use composite fields to perform the ground field arithmetic. The most attractive feature of the new algorithm presented here is that the degree of the defining irreducible polynomial can be arbitrarily selected by the designer, allowing the usage of prime degrees. |