Learn More
The discrete logarithm problem modulo a composite—abbreviate it as DLPC—is the following: given a (possibly) composite integer n ≥ 1 and elements $${a, b \in \mathbb{Z}_n^*}$$ , determine an $${x \in \mathbb{N}}$$ satisfying a x  = b if one exists. The question whether integer factoring can be reduced in deterministic polynomial time to the DLPC remains(More)
  • 1