Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | 이향숙 | - |
dc.contributor.author | 조국화 | - |
dc.date.accessioned | 2020-08-13T16:30:10Z | - |
dc.date.available | 2020-08-13T16:30:10Z | - |
dc.date.issued | 2020 | - |
dc.identifier.issn | 1071-5797 | - |
dc.identifier.other | OAK-27265 | - |
dc.identifier.uri | https://dspace.ewha.ac.kr/handle/2015.oak/254923 | - |
dc.description.abstract | Let p be a prime such that p≡1(mod3). Let c be a cubic residue (modp) such that [Formula presented]. In this paper, we present a refinement of Müller's algorithm for computing a cube root of c [11], which also improves Williams' [14,15] Cipolla-Lehmer type algorithms. Under the assumption that a suitable irreducible polynomial of degree 3 is given, Müller gave a cube root algorithm which requires 8.5logp modular multiplications. Our algorithm requires only 7.5logp modular multiplications and is based on the recurrence relations arising from the irreducible polynomial h(x)=x3+ct3x−ct3 for some integer t. © 2020 Elsevier Inc. | - |
dc.language | English | - |
dc.publisher | Academic Press Inc. | - |
dc.subject | Cipolla-Lehmer algorithm | - |
dc.subject | Cube root | - |
dc.subject | Finite field | - |
dc.subject | Linear recurrence relation | - |
dc.title | A refinement of Müller's cube root algorithm | - |
dc.type | Article | - |
dc.relation.volume | 67 | - |
dc.relation.index | SCIE | - |
dc.relation.index | SCOPUS | - |
dc.relation.journaltitle | Finite Fields and their Applications | - |
dc.identifier.doi | 10.1016/j.ffa.2020.101708 | - |
dc.identifier.wosid | WOS:000570237000014 | - |
dc.identifier.scopusid | 2-s2.0-85087773636 | - |
dc.author.google | Cho G.H. | - |
dc.author.google | Kwon S. | - |
dc.author.google | Lee H.-S. | - |
dc.contributor.scopusid | 이향숙(34870017000) | - |
dc.contributor.scopusid | 조국화(55700404300) | - |
dc.date.modifydate | 20230411110859 | - |