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.
Chapter PDF
References
W. Aiello, J. Håstad, “Perfect zero-knowledge languages can be recognized in two rounds,” Proc. 28th FOCS, pp. 439–448 (1987).
R. Boppana, J. Håstad, and S. Zachos, “Does co-NP have short interactive proofs?” Inform. Proc. Lett., vol.25, pp.127–132 (1987).
G. Brassard, “A note on the complexity of cryptography,” IEEE Trans. Inf. Theory, vol.IT-25, no.2, pp.232–233 (1979).
L. J. Fortnow, “The complexity of perfect zero-knowledge,” Proc. 19th STOC, pp.204–209 (1987).
S. Goldwasser and M. Sipser, “Private coins versus public coins in interactive proof systems,” Proc. 18th STOC, pp.59–68 (1986).
A. Klapper, “Generalized lowness and highness and probabilistic complexity classes,” Math. Syst. Theory, vol.22, pp.37–45 (1989).
N. Koblitz, “Elliptic curve cryptosystems,” Math. Comp., vol.48, no.177, pp.203–209 (1987).
N. Koblitz, “Hyperelliptic cryptosystems,” J. Cryptology, vol.1, no.3, pp.139–150 (1989).
V. S. Miller, “Use of elliptic curves in cryptography,” Advances in Cryptology: Proceedings of Crypto’ 85, LNCS 218, pp.417–426 (1985).
T. Okamoto, K. Sakurai, “Efficient algorithms for the construction of hyperelliptic cryptosystems,” Advances in Cryptology: Proceedings of Crypto’ 91, LNCS 576, Springer-Verlag, pp.265–278 (1992).
V. R. Pratt, “Every prime has a succinct certificate,” SIAM J. Comput., vol.4, pp.214–220 (1975).
U. Schöning, “A low and high hierarchy within NP,” J. Comp. Syst. Sci., vol.27, pp.14–28 (1983).
H. Shizuya, T. Itoh, K. Sakurai, “On the complexity of hyperelliptic discrete logarithm problem”, Advances in Cryptology: Proceedings of Eurocrypt’ 91, LNCS 547, Springer-Verlag, pp.337–351 (1991).
M. Tompa and H. Woll, “Random self-reducibility and zero knowledge interactive proofs of possession of information,” Proc. 28th FOCS, pp. 472–482 (1987).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Okamoto, T., Sakurai, K., Shizuya, H. (1993). How Intractable Is the Discrete Logarithm for a General Finite Group?. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_34
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_34
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive