Abstract
In this paper, we discuss solving the DLP over GF(36.97) by using the function field sieve (FFS) for breaking paring-based cryptosystems using the ηT pairing over GF(397). The extension degree 97 has been intensively used in benchmarking tests for the implementation of the ηT pairing, and the order (923-bit) of GF(3 6.97) is substantially larger than the previous world record (676-bit) of solving the DLP by using the FFS. We implemented the FFS for the medium prime case, and proposed several improvements of the FFS. Finally, we succeeded in solving the DLP over GF(36.97). The entire computational time requires about 148.2 days using 252 CPU cores. © International Association for Cryptologic Research 2012.
Author supplied keywords
Cite
CITATION STYLE
Hayashi, T., Shimoyama, T., Shinohara, N., & Takagi, T. (2012). Breaking pairing-based cryptosystems using ηT pairing over GF(397). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7658 LNCS, pp. 43–60). https://doi.org/10.1007/978-3-642-34961-4_5
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
