dc.contributor.author |
Cenk, Murat
|
|
dc.contributor.author |
Özbudak, Ferruh
|
|
dc.date.accessioned |
2016-06-06T10:49:30Z |
|
dc.date.available |
2016-06-06T10:49:30Z |
|
dc.date.issued |
2009-04 |
|
dc.identifier.citation |
Cenk, 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.207 |
tr_TR |
dc.identifier.issn |
0018-9340 |
|
dc.identifier.uri |
http://hdl.handle.net/20.500.12416/1033 |
|
dc.description.abstract |
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 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 |
tr_TR |
dc.language.iso |
eng |
tr_TR |
dc.publisher |
IEEE-Computer Soc |
tr_TR |
dc.relation.isversionof |
10.1109/TC.2008.207 |
tr_TR |
dc.rights |
info:eu-repo/semantics/closedAccess |
|
dc.subject |
Finite Field Polynomial Multiplication |
tr_TR |
dc.subject |
Chinese Remainder Theorem |
tr_TR |
dc.title |
Improved polynomial multiplication formulas over F-2 using chinese remainder theorem |
tr_TR |
dc.type |
article |
tr_TR |
dc.relation.journal |
IEEE Transactions on Computers |
tr_TR |
dc.contributor.authorID |
220172 |
tr_TR |
dc.contributor.authorID |
2212 |
tr_TR |
dc.identifier.volume |
58 |
tr_TR |
dc.identifier.issue |
4 |
tr_TR |
dc.identifier.startpage |
572 |
tr_TR |
dc.identifier.endpage |
576 |
tr_TR |
dc.contributor.department |
Çankaya Üniversitesi, Fen Edebiyat Fakültesi, Matematik Bilgisayar Bölümü |
tr_TR |