On the complexity of hyperelliptic discrete logarithm problem

Hiroki Shizuya, Toshiya Itoh, Kouichi Sakurai

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

5 被引用数 (Scopus)

抄録

We give a characterization for the intractability of hyperelliptic discrete logarithm problem from a viewpoint of computational complexity theory. It is shown that the language of which complexity is equivalent to that of the hyperelliptic discrete logarithm problem is in NP ∩ co-AM, and that especially for elliptic curves, the corresponding language is in NP ∩ co-NP. It should be noted here that the language of which complexity is equivalent to that of the discrete logarithm problem defined over the multiplicative group of a finite field is also characterized as in NP ∩ co-NP.

本文言語英語
ホスト出版物のタイトルAdvances in Cryptology—EUROCRYPT 1991 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
編集者Donald W. Davies
出版社Springer Verlag
ページ337-351
ページ数15
ISBN(印刷版)9783540546207
DOI
出版ステータス出版済み - 1991
外部発表はい
イベントWorkshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991 - Brighton, 英国
継続期間: 4月 8 19914月 11 1991

出版物シリーズ

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

その他

その他Workshop on the Theory and Application of Cryptographic Techniques, EUROCRYPT 1991
国/地域英国
CityBrighton
Period4/8/914/11/91

!!!All Science Journal Classification (ASJC) codes

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

フィンガープリント

「On the complexity of hyperelliptic discrete logarithm problem」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル