Improved n-term karatsuba-like formulas in GF(2)

Research output: Contribution to journalArticlepeer-review

13 Citations (Scopus)


It is well known that Chinese Remainder Theorem (CRT) can be used to construct efficient algorithms for multiplication of polynomials over GF(2). In this note, we show how to select an appropriate set of modulus polynomials to obtain minimal number of multiplications.

Original languageEnglish
Article number5661770
Pages (from-to)1212-1216
Number of pages5
JournalIEEE Transactions on Computers
Issue number8
Publication statusPublished - 2011
Externally publishedYes


  • Chinese remainder theorem
  • fast algorithm
  • Karatsuba algorithm
  • Polynomial multiplication


Dive into the research topics of 'Improved n-term karatsuba-like formulas in GF(2)'. Together they form a unique fingerprint.

Cite this