Title :
Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
Author :
Fan, Haining ; Hasan, M. Anwar
Author_Institution :
Dept. of Comput. Sci., Tsinghua Univ., Beijing
fDate :
5/1/2007 12:00:00 AM
Abstract :
For original paper see P.L. Montgomery, ibid., vol.54, no.3, p.362-369, (2005). We show that multiplication complexities of n-term Karatsuba-Like formulae of GF(2)[x] (7<n<19) presented in the above paper can be further improved using the Chinese Remainder Theorem and the construction multiplication modulo (x-infin)w
Keywords :
Galois fields; computational complexity; digital arithmetic; polynomials; Chinese Remainder Theorem; multiplication complexity; multiplication modulo; n-term Karatsuba-Like formulae; Karatsuba algorithm; finite field.; polynomial multiplication;
Journal_Title :
Computers, IEEE Transactions on
DOI :
10.1109/TC.2007.1024
