Special Section on Cryptography and Information Security
NPMV-Complete Functions That Compute Discrete Logarithms and Integer Factorization
2008 Volume E91.A Issue 1 Pages 342-344
Details
2008 Volume E91.A Issue 1 Pages 342-344
We define two functions fDL and fIF in NPMV, the class of all partial, multivalued functions computed nondeterministically in polynomial time. We prove that they are complete for NPMV, and show that (a) computing discrete logarithms modulo a prime reduces to fDL, and (b) computing integer factorization reduces to fIF. These are the first complete functions that have explicit reductions from significant cryptographic primitives.
