The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (2007 vol.56)
pp: 716-717
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
Haining Fan, M. Anwar Hasan, "Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae"", IEEE Transactions on Computers, vol.56, no. 5, pp. 716-717, May 2007, doi:10.1109/TC.2007.1024
17 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool