JOURNAL BROWSE
Search
Advanced SearchSearch Tips
Two Types of Algorithms for Finding the Cube Root in Finite Fields
facebook(new window)  Pirnt(new window) E-mail(new window) Excel Download
 Title & Authors
Two Types of Algorithms for Finding the Cube Root in Finite Fields
Cho, Gook Hwa;
  PDF(new window)
 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.
 Keywords
cube root algorithm;finite field;Cipolla-Lehmer algorithm;linear recurrence relation;
 Language
Korean
 Cited by
 References
1.
G. H. Cho, N. Koo, E. Ha, and S. Kwon, "New cube root algorithm based on the third order linear recurrence relations in finite fields," Designs, Codes and Cryptography, vol. 75, no. 3, pp. 483-495, 2015. crossref(new window)

2.
M. Cipolla, "Un metodo per la risoluzione della congruenza di secondo grado," Rendicono dell'Accademia Scienze Fisiche e Matematiche, vol. 9, no. 3, pp. 154-163, 1903.

3.
L. E. Dickson, "Criteria for the irreducibility of functions in a finite field," Bull. Am. Math. Soc., vol. 13, no. 1, pp. 1-8, 1906. crossref(new window)

4.
G. Gong, L. Harn, and H. Wu, "The GH public-key cryptosystem," Selected Areas in Cryptography, Springer Berlin Heidelberg, pp. 284-300, Dec. 2001.

5.
D. H. Lehmer, "Computer technology applied to the theory of numbers," Studies in Number Theory, Math. Assoc. Am. (distributed by Prentice-Hall, Englewood Cliffs, N. J.), pp. 117-151, 1969.

6.
N. Nishihara, R. Harasawa, Y. Sueyoshi, and A. Kudo, A remark on the computation of cube roots in finite fields, preprint, 2009, from http://eprint.iacr.org/2009/457.pdf.

7.
NIST, Digital Signature Standard, Federal Information Processing Standard 186-3, 2000, from http://csrc.nist.gov/publications/fips/.

8.
D. Shanks, "Five number-theoretic algorithms," in Proc. Second Manitoba Conf. Numerical Math., pp. 51-70, Winnipeg, Canada, Oct. 1972.

9.
A. Tonelli, "Bemerkung uber die Auflosung Quadratisher Congruenzen," Gottinger Nachrichten, pp. 344-346, 1891.