Breaking pairing-based cryptosystems using ηT pairing over GF(397)

Takuya Hayashi, Takeshi Shimoyama, Naoyuki Shinohara, Tsuyoshi Takagi

Research output: Chapter in Book/Report/Conference proceedingConference contribution

20 Citations (Scopus)

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.

Original languageEnglish
Title of host publicationAdvances in Cryptology, ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
Pages43-60
Number of pages18
DOIs
Publication statusPublished - Dec 31 2012
Event18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012 - Beijing, China
Duration: Dec 2 2012Dec 6 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7658 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012
CountryChina
CityBeijing
Period12/2/1212/6/12

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Breaking pairing-based cryptosystems using η<sub>T</sub> pairing over GF(3<sup>97</sup>)'. Together they form a unique fingerprint.

  • Cite this

    Hayashi, T., Shimoyama, T., Shinohara, N., & Takagi, T. (2012). Breaking pairing-based cryptosystems using ηT pairing over GF(397). In Advances in Cryptology, ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 43-60). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 7658 LNCS). https://doi.org/10.1007/978-3-642-34961-4_5