Ozbudak, FerruhCenk, Murat2016-06-062025-09-182016-06-062025-09-182009Cenk, M., Özbudak, F. (2009). Improved polynomial multiplication formulas over F-2 using chinese remainder theorem. IEEE Transactions on Computers, 58(4), 572-576. http://dx.doi.org/ 10.1109/TC.2008.2070018-93401557-9956https://doi.org/10.1109/TC.2008.207https://hdl.handle.net/20.500.12416/14979Ozbudak, Ferruh/0000-0002-1694-9283; Cenk, Murat/0000-0003-4941-8734Let 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 upper bound allows a better selection of the moduli when the Chinese Remainder Theorem is used for polynomial multiplication over F-2. We give improved formulas to multiply polynomials of small degree over F-2. In particular, we improve the best known multiplication complexities over F-2 in the literature in some cases.eninfo:eu-repo/semantics/closedAccessFinite Field Polynomial MultiplicationChinese Remainder TheoremArticle10.1109/TC.2008.2072-s2.0-63049100179