New answers tagged


No one knows, but: It is suspected that neither factoring nor discrete logarithm are NP-complete, but we have no proof. (Evidence for the suspicion: they are in NP $\cap$ coNP. See, e.g.,, for factoring. It's similarly easy to prove that discrete log is in NP $\...

Top 50 recent answers are included