On Multiplication in Finite Fields
| dc.contributor.author | Ozbudak, Ferruh | |
| dc.contributor.author | Cenk, Murat | |
| dc.date.accessioned | 2020-04-17T00:02:58Z | |
| dc.date.accessioned | 2025-09-18T15:43:43Z | |
| dc.date.available | 2020-04-17T00:02:58Z | |
| dc.date.available | 2025-09-18T15:43:43Z | |
| dc.date.issued | 2010 | |
| dc.description | Ozbudak, Ferruh/0000-0002-1694-9283; Cenk, Murat/0000-0003-4941-8734 | en_US |
| dc.description.abstract | We present a method for multiplication in finite fields which gives multiplication algorithms with improved or best known bilinear complexities for certain finite fields. Our method generalizes some earlier methods and combines them with the recently introduced complexity notion (M) over cap (q)(l), which denotes the minimum number of multiplications needed in F-q in order to obtain the coefficients of the product of two arbitrary l-term polynomials modulo x(l) in F-q[x]. We study our method for the finite fields F(q)n, where 2 <= n <= 18 and q = 2, 3,4 and we improve or reach the currently best known bilinear complexities. We also give some applications in cryptography. (C) 2010 Published by Elsevier Inc. | en_US |
| dc.description.sponsorship | TUBITAK [TBAG-107T826] | en_US |
| dc.description.sponsorship | We would like to thank the anonymous reviewers for their insightful and useful comments that improved the paper. The authors were partially supported by TUBITAK under Grant No. TBAG-107T826. | en_US |
| dc.identifier.citation | Cenk, Murat; Ozbudak, Ferruh,"On multiplication in finite fields", Journal of Complexıty, Vol. 26, No. 2, pp. 172-186, (2010) | en_US |
| dc.identifier.doi | 10.1016/j.jco.2009.11.002 | |
| dc.identifier.issn | 0885-064X | |
| dc.identifier.issn | 1090-2708 | |
| dc.identifier.scopus | 2-s2.0-77649339854 | |
| dc.identifier.uri | https://doi.org/10.1016/j.jco.2009.11.002 | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12416/14021 | |
| dc.language.iso | en | en_US |
| dc.publisher | Academic Press inc Elsevier Science | en_US |
| dc.relation.ispartof | Journal of Complexity | |
| dc.rights | info:eu-repo/semantics/openAccess | en_US |
| dc.subject | Finite Fields | en_US |
| dc.subject | Algebraic Function Fields | en_US |
| dc.subject | Bilinear Complexity | en_US |
| dc.title | On Multiplication in Finite Fields | en_US |
| dc.title | On Multiplication In Finite Fields | tr_TR |
| dc.type | Article | en_US |
| dspace.entity.type | Publication | |
| gdc.author.id | Ozbudak, Ferruh/0000-0002-1694-9283 | |
| gdc.author.id | Cenk, Murat/0000-0003-4941-8734 | |
| gdc.author.scopusid | 6504402955 | |
| gdc.author.scopusid | 6603589033 | |
| gdc.author.wosid | Ozbudak, Ferruh/Aaz-6893-2020 | |
| gdc.author.wosid | Cenk, Murat/Agu-7577-2022 | |
| gdc.author.yokid | 6093 | |
| gdc.bip.impulseclass | C4 | |
| gdc.bip.influenceclass | C4 | |
| gdc.bip.popularityclass | C4 | |
| gdc.coar.access | open access | |
| gdc.coar.type | text::journal::journal article | |
| gdc.collaboration.industrial | false | |
| gdc.description.department | Çankaya University | en_US |
| gdc.description.departmenttemp | [Ozbudak, Ferruh] Middle E Tech Univ, Dept Math, TR-06531 Ankara, Turkey; [Ozbudak, Ferruh] Middle E Tech Univ, Inst Appl Math, TR-06531 Ankara, Turkey; [Cenk, Murat] Cankaya Univ, Dept Math & Comp Sci, Ankara, Turkey | en_US |
| gdc.description.endpage | 186 | en_US |
| gdc.description.issue | 2 | en_US |
| gdc.description.publicationcategory | Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı | en_US |
| gdc.description.scopusquality | Q2 | |
| gdc.description.startpage | 172 | en_US |
| gdc.description.volume | 26 | en_US |
| gdc.description.woscitationindex | Science Citation Index Expanded | |
| gdc.description.wosquality | Q1 | |
| gdc.identifier.openalex | W2039816130 | |
| gdc.identifier.wos | WOS:000276662200004 | |
| gdc.index.type | WoS | |
| gdc.index.type | Scopus | |
| gdc.oaire.accesstype | HYBRID | |
| gdc.oaire.diamondjournal | false | |
| gdc.oaire.downloads | 2 | |
| gdc.oaire.impulse | 6.0 | |
| gdc.oaire.influence | 4.2821964E-9 | |
| gdc.oaire.isgreen | true | |
| gdc.oaire.keywords | Algebraic function fields | |
| gdc.oaire.keywords | Statistics and Probability | |
| gdc.oaire.keywords | Numerical Analysis | |
| gdc.oaire.keywords | Algebra and Number Theory | |
| gdc.oaire.keywords | Control and Optimization | |
| gdc.oaire.keywords | Applied Mathematics | |
| gdc.oaire.keywords | Bilinear complexity | |
| gdc.oaire.keywords | Finite fields | |
| gdc.oaire.keywords | Analysis of algorithms and problem complexity | |
| gdc.oaire.keywords | bilinear complexity | |
| gdc.oaire.keywords | Algebraic coding theory; cryptography (number-theoretic aspects) | |
| gdc.oaire.keywords | Structure theory for finite fields and commutative rings (number-theoretic aspects) | |
| gdc.oaire.keywords | Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) | |
| gdc.oaire.keywords | algebraic function fields | |
| gdc.oaire.keywords | finite fields | |
| gdc.oaire.popularity | 7.0840724E-9 | |
| gdc.oaire.publicfunded | false | |
| gdc.oaire.sciencefields | 0102 computer and information sciences | |
| gdc.oaire.sciencefields | 0101 mathematics | |
| gdc.oaire.sciencefields | 01 natural sciences | |
| gdc.oaire.views | 2 | |
| gdc.openalex.collaboration | National | |
| gdc.openalex.fwci | 3.81148436 | |
| gdc.openalex.normalizedpercentile | 0.95 | |
| gdc.openalex.toppercent | TOP 10% | |
| gdc.opencitations.count | 24 | |
| gdc.plumx.crossrefcites | 13 | |
| gdc.plumx.mendeley | 5 | |
| gdc.plumx.scopuscites | 27 | |
| gdc.publishedmonth | 4 | |
| gdc.scopus.citedcount | 27 | |
| gdc.virtual.author | Cenk, Murat | |
| gdc.wos.citedcount | 22 | |
| relation.isAuthorOfPublication | c113b273-5f48-4f7d-9923-6d43468a5794 | |
| relation.isAuthorOfPublication.latestForDiscovery | c113b273-5f48-4f7d-9923-6d43468a5794 | |
| relation.isOrgUnitOfPublication | 26a93bcf-09b3-4631-937a-fe838199f6a5 | |
| relation.isOrgUnitOfPublication | 28fb8edb-0579-4584-a2d4-f5064116924a | |
| relation.isOrgUnitOfPublication | 0b9123e4-4136-493b-9ffd-be856af2cdb1 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 26a93bcf-09b3-4631-937a-fe838199f6a5 |