The Community for Technology Leaders
Green Image
ABSTRACT
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-∞)<super>w</super>.
INDEX TERMS
Karatsuba algorithm, polynomial multiplication, finite field.
CITATION

H. Fan and M. A. Hasan, "Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae"," in IEEE Transactions on Computers, vol. 56, no. , pp. 716-717, 2007.
doi:10.1109/TC.2007.1024
91 ms
(Ver 3.3 (11022016))