페어링 암호 연산을 위한 $F_{3^m}$ 에서의 효율적인 세제곱근 연산 방법
Vol. 21, No. 2, pp. 3-12,
4월.
2011
10.13089/JKIISC.2011.21.2.3,
Full Text:
Keywords: Cube root, Shifted Polynomial Basis, finite field arithmetic
Abstract Statistics
Cite this article


Keywords: Cube root, Shifted Polynomial Basis, finite field arithmetic
Abstract Statistics
Cite this article
[IEEE Style]
Y. Cho, N. Chang, C. Kim, Y. Park, S. Hong, "Efficient Formulas for Cube roots in $F_{3^m}$ for Pairing Cryptography," Journal of The Korea Institute of Information Security and Cryptology, vol. 21, no. 2, pp. 3-12, 2011. DOI: 10.13089/JKIISC.2011.21.2.3.
[ACM Style]
Young-In Cho, Nam-Su Chang, Chang-Han Kim, Young-Ho Park, and Seok-Hie Hong. 2011. Efficient Formulas for Cube roots in $F_{3^m}$ for Pairing Cryptography. Journal of The Korea Institute of Information Security and Cryptology, 21, 2, (2011), 3-12. DOI: 10.13089/JKIISC.2011.21.2.3.