| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 4950845 | Information Processing Letters | 2017 | 10 Pages |
Abstract
This paper shows that the Discrete Logarithm Problem is in ZPPMCSP (where MCSP is the Minimum Circuit Size Problem). This result improves the previous bound that the Discrete Logarithm Problem is in BPPMCSP, shown by Allender et al. [1]. In doing so, this paper helps classify the relative difficulty of the Minimum Circuit Size Problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
M. Rudow,