Discrete Logarithm and Minimum Circuit Size

  • Michael Rudow
  • Published 2016 in Electronic Colloquium on Computational Complexity

Abstract

This paper shows that the Discrete Logarithm Problem is in ZPP (where MCSP is the Minimum Circuit Size Problem). This result improves the previous bound that the Discrete Logarithm Problem is in BPP Allender et al. (2006). In doing so, this paper helps classify the relative difficulty of the Minimum Circuit Size Problem.

DOI: 10.1016/j.ipl.2017.07.005

Cite this paper

@article{Rudow2016DiscreteLA, title={Discrete Logarithm and Minimum Circuit Size}, author={Michael Rudow}, journal={Inf. Process. Lett.}, year={2016}, volume={128}, pages={1-4} }