Two Types of Algorithms for Finding the Cube Root in Finite Fields 


Vol. 41,  No. 5, pp. 499-503, May  2016


PDF
  Abstract

We study algorithms that can efficiently find cube roots by modifying Cipolla-Lehmer algorithm. In this paper, we present two type algorithms for finding cube roots in finite field, which improves Cipolla-Lehmer algorithm. If the number of multiplications of two type algorithms has a little bit of a difference, then it is more efficient algorithm which have less storage variables.

  Statistics
Cumulative Counts from November, 2022
Multiple requests among the same browser session are counted as one view. If you mouse over a chart, the values of data points will be shown.


  Cite this article

[IEEE Style]

G. H. Cho, "Two Types of Algorithms for Finding the Cube Root in Finite Fields," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 5, pp. 499-503, 2016. DOI: .

[ACM Style]

Gook Hwa Cho. 2016. Two Types of Algorithms for Finding the Cube Root in Finite Fields. The Journal of Korean Institute of Communications and Information Sciences, 41, 5, (2016), 499-503. DOI: .

[KICS Style]

Gook Hwa Cho, "Two Types of Algorithms for Finding the Cube Root in Finite Fields," The Journal of Korean Institute of Communications and Information Sciences, vol. 41, no. 5, pp. 499-503, 5. 2016.

Search
(IN TITLE, AUTHOR, ABSTRACT,KEYWORDS)

Advanced Search ▼

POPULAR KEYWORDS
(TOP 10 KEYWORDS)

Recent Publications
(LAST 3 YEARS)






pISSN : 1226 - 4717
eISSN : 2287 - 3880