페어링 암호 시스템을 위한 $F_{3^m}$ 에서의 효율적인 MapToPoint 방법
Vol. 21, No. 6, pp. 3-12,
12월.
2011
10.13089/JKIISC.2011.21.6.3, Full Text:
Keywords: Map to point, Cube root, finite field arithmetic
Abstract Statistics
Cite this article
10.13089/JKIISC.2011.21.6.3, Full Text:
Keywords: Map to point, Cube root, finite field arithmetic
Abstract Statistics
Cite this article
[IEEE Style]
Y. Park, Y. Cho, N. Chang, "Faster MapToPoint over $F_{3^m}$ for Pairing-based Cryptosystems," Journal of The Korea Institute of Information Security and Cryptology, vol. 21, no. 6, pp. 3-12, 2011. DOI: 10.13089/JKIISC.2011.21.6.3.
[ACM Style]
Young-Ho Park, Young-In Cho, and Nam-Su Chang. 2011. Faster MapToPoint over $F_{3^m}$ for Pairing-based Cryptosystems. Journal of The Korea Institute of Information Security and Cryptology, 21, 6, (2011), 3-12. DOI: 10.13089/JKIISC.2011.21.6.3.