Improved n-Term Karatsuba-Like Formulas in GF(2)
Ivan Valer'evich Oseledets · IEEE Transactions on Computers · 2010
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.