How intractable is the discrete logarithm for a general finite group?

Tatsuaki Okamoto, Kouichi Sakurai, Hiroki Shizuya

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

3 Citations (Scopus)

Abstract

GDL is the discrete logarithm problem for a general finitc group G. This paper gives a characterization for the intractability of GDL from the viewpoint of computational complexity theory. It is shown that GDL ∈ NP ∩ co-AM, assuming that G is in NP ∩ co-NP, and that the group law operation of G can be exccuted in a polynomial time of the element size. Furthermore, as a natural probabilistic extension, the complexity of GDL is investigated under the assumption that the group law operation is executed in an expected polynomial time of the element size. In this case, it is shown that GDL ∈ MA ∩ co-AM if G ∈ NP ∩ co-NP. Finally, we show that GDL is less intractable than NP-complete problems unless the polynomial time hierarchy collapses to the second level.

Original languageEnglish
Title of host publicationAdvances in Cryptology – EUROCRYPT 1992 - Workshop on the Theory and Application of Cryptographic Techniques, Proceedings
EditorsRainer A. Rueppel
PublisherSpringer Verlag
Pages420-428
Number of pages9
ISBN (Print)9783540564133
DOIs
Publication statusPublished - Jan 1 1993
Externally publishedYes
EventWorkshop on the Theory and Application of Cryptographic Technique, EUROCRYPT 1992 - Balatonfured, Hungary
Duration: May 24 1992May 28 1992

Publication series

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

Other

OtherWorkshop on the Theory and Application of Cryptographic Technique, EUROCRYPT 1992
CountryHungary
CityBalatonfured
Period5/24/925/28/92

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'How intractable is the discrete logarithm for a general finite group?'. Together they form a unique fingerprint.

Cite this