Acceleration of index calculus for solving ECDLP over prime fields and its limitation

Momonari Kudo, Yuki Yokota, Yasushi Takahashi, Masaya Yasuda

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

抄録

In 2018, Amadori et al. proposed a new variant of index calculus to solve the elliptic curve discrete logarithm problem (ECDLP), using Semaev’s summation polynomials. The variant drastically decreases the number of required Gröbner basis computations, and it outperforms other index calculus algorithms for the ECDLP over prime fields. In this paper, we provide several improvements to accelerate to solve systems of multivariate equations arising in the variant. A main improvement is to apply the hybrid method, which mixes exhaustive search and Gröbner bases techniques to solve multivariate systems over finite fields. We also make use of symmetries of summation polynomials. We show experimental results of our improvements, and give their complexity analysis to discuss a limitation of our acceleration in both theory and practice.

本文言語英語
ホスト出版物のタイトルCryptology and Network Security - 17th International Conference, CANS 2018, Proceedings
編集者Panos Papadimitratos, Jan Camenisch
出版社Springer Verlag
ページ377-393
ページ数17
ISBN(印刷版)9783030004330
DOI
出版ステータス出版済み - 1 1 2018
イベント17th International Conference on Cryptology and Network Security, CANS 2018 - Naples, イタリア
継続期間: 9 30 201810 3 2018

出版物シリーズ

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

その他

その他17th International Conference on Cryptology and Network Security, CANS 2018
Countryイタリア
CityNaples
Period9/30/1810/3/18

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Acceleration of index calculus for solving ECDLP over prime fields and its limitation」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル