This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Five, Six, and Seven-Term Karatsuba-Like Formulae
March 2005 (vol. 54 no. 3)
pp. 362-369
The Karatsuba-Ofman algorithm starts with a way to multiply two 2-term (i.e., linear) polynomials using three scalar multiplications. There is also a way to multiply two 3-term (i.e., quadratic) polynomials using six scalar multiplications. These are used within recursive constructions to multiply two higher-degree polynomials in subquadratic time. We present division-free formulae which multiply two 5-term polynomials with 13 scalar multiplications, two 6-term polynomials with 17 scalar multiplications, and two 7-term polynomials with 22 scalar multiplications. These formulae may be mixed with the 2-term and 3-term formulae within recursive constructions, leading to improved bounds for many other degrees. Using only the 6-term formula leads to better asymptotic performance than standard Karatsuba. The new formulae work in any characteristic, but simplify in characteristic 2. We describe their application to elliptic curve arithmetic over binary fields. We include some timing data.

[1] A.V. Aho, J.E. Hopcroft, and J.D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974.
[2] D.G. Cantor, “On Arithmetical Algorithms over Finite Fields,” J. Combinatorial Theory, Series A 50, pp. 285-300, 1989.
[3] D.G. Cantor and E. Kaltofen, “On Fast Multiplication of Polynomials over Arbitrary Algebras,” Acta Informatica, vol. 28, pp. 693-701, 1991.
[4] D.E. Knuth, “Seminumerical Algorithms,” The Art of Computer Programming, vol 2, third ed., Addison-Wesley, 1997.
[5] Recommended Elliptic Curves for Federal Government Use, July 1999. Appendix 6 to FIPS publication 186-2, Digital Signature Standard (DSS), US Dept. of Commerce, Nat'l Inst. of Standards and Tech nology, Jan. 2000, http://www.itl.nist.gov/fipspubsfip186.htm .
[6] A.L. Toom, “The Complexity of a Scheme of Functional Elements Realizing the Multiplication of Integers,” Soviet Math., vol. 4, pp. 714-716, 1963.
[7] A. Weimerskirch and C. Paar, “Generalizations of the Karatsuba Algorithm for Efficient Implementations,” 2003, http://www. crypto.ruhr-uni-bochum.de/imperia/ md/content/textekaweb.pdf.
[8] D. Zuras, “More on Squaring and Multiplying Large Integers,” IEEE Trans. Computers, vol. 43, no. 8, pp. 899-908, Aug. 1994.

Index Terms:
Karatsuba, Karatsuba-Ofman, polynomial multiplication, characteristic 2, binary fields, Galois fields, elliptic curve arithmetic.
Citation:
Peter L. Montgomery, "Five, Six, and Seven-Term Karatsuba-Like Formulae," IEEE Transactions on Computers, vol. 54, no. 3, pp. 362-369, March 2005, doi:10.1109/TC.2005.49
Usage of this product signifies your acceptance of the Terms of Use.