Cenk, Murat; Özbudak, Ferruh
(IEEE-Computer Soc, 2009-04)
Let n and l be positive integers and f(x) be an irreducible polynomial over F-2 such that ldeg(f(x)) < 2n - 1. We obtain an effective upper bound for the multiplication complexity of n-term polynomials modulo f(x)(l). This ...