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

Takuya Hayashi, Takeshi Shimoyama, Naoyuki Shinohara, Tsuyoshi Takagi

研究成果: 書籍/レポート タイプへの寄稿会議への寄与

27 被引用数 (Scopus)

抄録

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.

本文言語英語
ホスト出版物のタイトルAdvances in Cryptology, ASIACRYPT 2012 - 18th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings
ページ43-60
ページ数18
DOI
出版ステータス出版済み - 2012
イベント18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012 - Beijing, 中国
継続期間: 12月 2 201212月 6 2012

出版物シリーズ

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

その他

その他18th International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2012
国/地域中国
CityBeijing
Period12/2/1212/6/12

!!!All Science Journal Classification (ASJC) codes

  • 理論的コンピュータサイエンス
  • コンピュータ サイエンス(全般)

フィンガープリント

「Breaking pairing-based cryptosystems using ηT pairing over GF(397)」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル