On the complexity of the discrete logarithm for a general finite group

Tatsuaki Okamoto, Kouichi Sakurai, Hiroki Shizuya

Research output: Contribution to journalArticle

Abstract

GDL is the language whose membership problem is polynomial-time Turing equivalent to the discrete logarithm problem for a general finite group G. This paper gives a characterization 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 executed in 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 ε MA ∩ co-MA. As a consequence, we show that GDL is not NP-complete unless the polynomial time hierarchy collapses to the second level.

Original languageEnglish
Pages (from-to)61-65
Number of pages5
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE79-A
Issue number1
Publication statusPublished - 1996

Fingerprint

Discrete Logarithm
Polynomial time
Finite Group
Polynomials
Discrete Logarithm Problem
Complexity Theory
Turing
Computational complexity
Computational Complexity
NP-complete problem

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

On the complexity of the discrete logarithm for a general finite group. / Okamoto, Tatsuaki; Sakurai, Kouichi; Shizuya, Hiroki.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E79-A, No. 1, 1996, p. 61-65.

Research output: Contribution to journalArticle

@article{6ee7356295b64890823a918102e27afa,
title = "On the complexity of the discrete logarithm for a general finite group",
abstract = "GDL is the language whose membership problem is polynomial-time Turing equivalent to the discrete logarithm problem for a general finite group G. This paper gives a characterization 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 executed in 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 ε MA ∩ co-MA. As a consequence, we show that GDL is not NP-complete unless the polynomial time hierarchy collapses to the second level.",
author = "Tatsuaki Okamoto and Kouichi Sakurai and Hiroki Shizuya",
year = "1996",
language = "English",
volume = "E79-A",
pages = "61--65",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "1",

}

TY - JOUR

T1 - On the complexity of the discrete logarithm for a general finite group

AU - Okamoto, Tatsuaki

AU - Sakurai, Kouichi

AU - Shizuya, Hiroki

PY - 1996

Y1 - 1996

N2 - GDL is the language whose membership problem is polynomial-time Turing equivalent to the discrete logarithm problem for a general finite group G. This paper gives a characterization 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 executed in 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 ε MA ∩ co-MA. As a consequence, we show that GDL is not NP-complete unless the polynomial time hierarchy collapses to the second level.

AB - GDL is the language whose membership problem is polynomial-time Turing equivalent to the discrete logarithm problem for a general finite group G. This paper gives a characterization 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 executed in 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 ε MA ∩ co-MA. As a consequence, we show that GDL is not NP-complete unless the polynomial time hierarchy collapses to the second level.

UR - http://www.scopus.com/inward/record.url?scp=0029732406&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0029732406&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0029732406

VL - E79-A

SP - 61

EP - 65

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 1

ER -