Solving a 676-bit discrete logarithm problem in GF(36n)

Takuya Hayashi, Naoyuki Shinohara, Lihua Wang, Shin'Ichiro Matsuo, Masaaki Shirase, Tsuyoshi Takagi

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

15 引用 (Scopus)

抜粋

Pairings on elliptic curves over finite fields are crucial for constructing various cryptographic schemes. The η T pairing on supersingular curves over GF(3 n ) is particularly popular since it is efficiently implementable. Taking into account the Menezes-Okamoto-Vanstone (MOV) attack, the discrete logarithm problem (DLP) in GF(36n ) becomes a concern for the security of cryptosystems using η T pairings in this case. In 2006, Joux and Lercier proposed a new variant of the function field sieve in the medium prime case, named JL06-FFS. We have, however, not yet found any practical implementations on JL06-FFS over GF(36n ). Therefore, we first fulfill such an implementation and we successfully set a new record for solving the DLP in GF(36n ), the DLP in GF(36•71) of 676-bit size. In addition, we also compare JL06-FFS and an earlier version, named JL02-FFS, with practical experiments. Our results confirm that the former is several times faster than the latter under certain conditions.

元の言語英語
ホスト出版物のタイトルPublic Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings
ページ351-367
ページ数17
DOI
出版物ステータス出版済み - 12 1 2010
イベント13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010 - Paris, フランス
継続期間: 5 26 20105 28 2010

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
6056 LNCS
ISSN(印刷物)0302-9743
ISSN(電子版)1611-3349

その他

その他13th International Conference on Practice and Theory in Public Key Cryptography, PKC 2010
フランス
Paris
期間5/26/105/28/10

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント Solving a 676-bit discrete logarithm problem in GF(3<sup>6n</sup>)' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用

    Hayashi, T., Shinohara, N., Wang, L., Matsuo, SI., Shirase, M., & Takagi, T. (2010). Solving a 676-bit discrete logarithm problem in GF(36n). : Public Key Cryptography, PKC 2010 - 13th International Conference on Practice and Theory in Public Key Cryptography, Proceedings (pp. 351-367). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); 巻数 6056 LNCS). https://doi.org/10.1007/978-3-642-13013-7_21