NL repository
menu
검색
Library
Browse
Communities & Collections
By Date
Authors
Titles
Subject
My Repository
My Account
Receive email updates
Edit Profile
DSpace at EWHA
자연과학대학
수학전공
Journal papers
View : 608 Download: 0
A refinement of Müller's cube root algorithm
Title
A refinement of Müller's cube root algorithm
Authors
Cho G.H.
;
Kwon S.
;
Lee H.-S.
Ewha Authors
이향숙
;
조국화
SCOPUS Author ID
이향숙
; 조국화
Issue Date
2020
Journal Title
Finite Fields and their Applications
ISSN
1071-5797
Citation
Finite Fields and their Applications vol. 67
Keywords
Cipolla-Lehmer algorithm
;
Cube root
;
Finite field
;
Linear recurrence relation
Publisher
Academic Press Inc.
Indexed
SCIE; SCOPUS
Document Type
Article
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.
DOI
10.1016/j.ffa.2020.101708
Appears in Collections:
자연과학대학
>
수학전공
>
Journal papers
Files in This Item:
There are no files associated with this item.
Export
RIS (EndNote)
XLS (Excel)
XML
Show full item record
Find@EWHA
트윗하기
BROWSE
Communities & Collections
By Date
Authors
Titles
Subject