유한체 $F{_p}{^{k}}$ 에서 효율적으로 제곱근을 구하는 알고리즘들
Vol. 18, No. 6, pp. 3-16,
10월.
2008
10.13089/JKIISC.2008.18.6.3,
Full Text:
Keywords: square roots, Finite fields, Tonelli-Shanks algorithm
Abstract Statistics
Cite this article
![](https://d2kjln74dkk4oj.cloudfront.net/img/doi_icon.png)
![](https://d2kjln74dkk4oj.cloudfront.net/img/pdficon_small.png)
Keywords: square roots, Finite fields, Tonelli-Shanks algorithm
Abstract Statistics
Cite this article
[IEEE Style]
D. Han, D. Choi, H. Kim, J. Lim, "Efficient Computation of Square Roots in Finite Fields $F{_p}{^{k}}$ ," Journal of The Korea Institute of Information Security and Cryptology, vol. 18, no. 6, pp. 3-16, 2008. DOI: 10.13089/JKIISC.2008.18.6.3.
[ACM Style]
Dong-Guk Han, Doo-Ho Choi, Ho-Won Kim, and Jong-In Lim. 2008. Efficient Computation of Square Roots in Finite Fields $F{_p}{^{k}}$ . Journal of The Korea Institute of Information Security and Cryptology, 18, 6, (2008), 3-16. DOI: 10.13089/JKIISC.2008.18.6.3.