Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18
| dc.authorscopusid | 6504402955 | |
| dc.authorscopusid | 6603589033 | |
| dc.authorwosid | Ozbudak, Ferruh/Aaz-6893-2020 | |
| dc.authorwosid | Cenk, Murat/Agu-7577-2022 | |
| dc.contributor.author | Cenk, Murat | |
| dc.contributor.author | Cenk, Murat | |
| dc.contributor.author | Ozbudak, Ferruh | |
| dc.contributor.other | Matematik | |
| dc.date.accessioned | 2020-04-08T12:20:21Z | |
| dc.date.available | 2020-04-08T12:20:21Z | |
| dc.date.issued | 2008 | |
| dc.department | Çankaya University | en_US |
| dc.department-temp | [Cenk, Murat] Cankaya Univ, Dept Math & Comp Sci, Ankara, Turkey; [Ozbudak, Ferruh] Middle East Tech Univ, Inst Appl Math, Dept Math, Ankara, Turkey | en_US |
| dc.description.abstract | Using a method based on Chinese Remainder Theorem for polynomial multiplication and suitable reductions, we obtain an efficient multiplication method for finite fields of characteristic 3. Large finite fields of characteristic 3 are important for pairing based cryptography [3]. For 5 <= l <= 18, we show that our method gives canonical multiplication formulae over F-3lm for any m >= 1 with the best multiplicative complexity improving the bounds in [6]. We give explicit formula in the case F-36.97. | en_US |
| dc.description.woscitationindex | Conference Proceedings Citation Index - Science | |
| dc.identifier.citation | Cenk, Murat; Özbudak, Ferruh, "Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18", Progress In Cryptology - Africacrypt 2008, Vol.5023, (2008). | en_US |
| dc.identifier.doi | 10.1007/978-3-540-68164-9_27 | |
| dc.identifier.endpage | 414 | en_US |
| dc.identifier.isbn | 3540681590 | |
| dc.identifier.isbn | 9783540681595 | |
| dc.identifier.issn | 0302-9743 | |
| dc.identifier.issn | 1611-3349 | |
| dc.identifier.scopus | 2-s2.0-45449109186 | |
| dc.identifier.scopusquality | Q3 | |
| dc.identifier.startpage | 406 | en_US |
| dc.identifier.uri | https://doi.org/10.1007/978-3-540-68164-9_27 | |
| dc.identifier.volume | 5023 | en_US |
| dc.identifier.wos | WOS:000256541200027 | |
| dc.identifier.wosquality | N/A | |
| dc.language.iso | en | en_US |
| dc.publisher | Springer-verlag Berlin | en_US |
| dc.relation.ispartof | 1st International Conference on Cryptology in Africa -- JUN 11-14, 2008 -- Casablanca, MOROCCO | en_US |
| dc.relation.ispartofseries | Lecture Notes in Computer Science | |
| dc.relation.publicationcategory | Konferans Öğesi - Uluslararası - Kurum Öğretim Elemanı | en_US |
| dc.rights | info:eu-repo/semantics/closedAccess | en_US |
| dc.scopus.citedbyCount | 8 | |
| dc.subject | Chinese Remainder Theorem | en_US |
| dc.subject | Finite Field Multiplication | en_US |
| dc.subject | Pairing Based Cryptography | en_US |
| dc.title | Efficient multiplication in F-3lm, m >= 1 and 5 <= l <= 18 | tr_TR |
| dc.title | Efficient Multiplication in F3lm, M≥1 and 5≤l≤18 | en_US |
| dc.type | Conference Object | en_US |
| dc.wos.citedbyCount | 5 | |
| dspace.entity.type | Publication | |
| relation.isAuthorOfPublication | c113b273-5f48-4f7d-9923-6d43468a5794 | |
| relation.isAuthorOfPublication.latestForDiscovery | c113b273-5f48-4f7d-9923-6d43468a5794 | |
| relation.isOrgUnitOfPublication | 26a93bcf-09b3-4631-937a-fe838199f6a5 | |
| relation.isOrgUnitOfPublication.latestForDiscovery | 26a93bcf-09b3-4631-937a-fe838199f6a5 |
Files
License bundle
1 - 1 of 1
No Thumbnail Available
- Name:
- license.txt
- Size:
- 1.71 KB
- Format:
- Item-specific license agreed upon to submission
- Description: