## 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 language | English |
---|---|

Pages (from-to) | 61-65 |

Number of pages | 5 |

Journal | IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences |

Volume | E79-A |

Issue number | 1 |

Publication status | Published - 1996 Jan 1 |

## Keywords

- Computational complexity
- Cryptography
- Discrete logarithm

## ASJC Scopus subject areas

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