Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
Murat Cenk, Ferruh Özbudak · IEEE Transactions on Computers · 2008
Let n and lscr be positive integers and f(x) be an irreducible polynomial over IF2such that lscrdeg(f(x))lscr. This upper bound allows a better selection of the moduli when Chinese Remainder Theorem is used for polynomial multiplication over IF2. We give improved formulae to multiply polynomials of small degree over IF2. In particular we improve the best known multiplication complexities over IF2in the literature in some cases.