Formulas for cube roots in F-3(m) using shifted polynomial basis
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Cho, Young In | - |
dc.contributor.author | Chang, Nam Su | - |
dc.contributor.author | Hong, Seokhie | - |
dc.date.accessioned | 2021-09-05T08:36:49Z | - |
dc.date.available | 2021-09-05T08:36:49Z | - |
dc.date.created | 2021-06-15 | - |
dc.date.issued | 2014-06 | - |
dc.identifier.issn | 0020-0190 | - |
dc.identifier.uri | https://scholar.korea.ac.kr/handle/2021.sw.korea/98461 | - |
dc.description.abstract | Evaluation of cube roots in characteristic three finite fields is required for Tate (or modified Tate) pairing computation. The Hamming weight of x(1/3) means that the number of nonzero coefficients in the polynomial representation of x(1/3) in F-3(m) = F-3[x]/(f), where f is an element of F-3[x] is an irreducible polynomial. The Hamming weight of x(1/3) determines the efficiency of cube roots computation for characteristic three finite fields. Ahmadi et al. found the Hamming weight of x(1/3) using polynomial basis [4]. In this paper, we observe that shifted polynomial basis (SPB), a variation of polynomial basis, can reduce Hamming weights of x(1/3) and x(2/3). Moreover, we provide the suitable SPB that eliminates modular reduction process in cube roots computation. (c) 2014 Elsevier B.V. All rights reserved. | - |
dc.language | English | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE BV | - |
dc.subject | ALGORITHMS | - |
dc.title | Formulas for cube roots in F-3(m) using shifted polynomial basis | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Hong, Seokhie | - |
dc.identifier.doi | 10.1016/j.ipl.2014.01.001 | - |
dc.identifier.scopusid | 2-s2.0-84894262735 | - |
dc.identifier.wosid | 000334485800009 | - |
dc.identifier.bibliographicCitation | INFORMATION PROCESSING LETTERS, v.114, no.6, pp.331 - 337 | - |
dc.relation.isPartOf | INFORMATION PROCESSING LETTERS | - |
dc.citation.title | INFORMATION PROCESSING LETTERS | - |
dc.citation.volume | 114 | - |
dc.citation.number | 6 | - |
dc.citation.startPage | 331 | - |
dc.citation.endPage | 337 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | Cryptography | - |
dc.subject.keywordAuthor | Shifted polynomial basis | - |
dc.subject.keywordAuthor | Cube roots | - |
dc.subject.keywordAuthor | Finite field arithmetic | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
(02841) 서울특별시 성북구 안암로 14502-3290-1114
COPYRIGHT © 2021 Korea University. All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.