Corpus ID: 122912725

Discrete Logarithms and Factoring

@inproceedings{Bach1984DiscreteLA,
  title={Discrete Logarithms and Factoring},
  author={E. Bach},
  year={1984}
}
This note discusses the relationship between the two problems of the title. We present probabilistic polynomial-time reduction that show: 1) To factor n, it suffices to be able to compute discrete logarithms modulo n. 2) To compute a discrete logarithm modulo a prime power p^E, it suffices to know It mod p. 3) To compute a discrete logarithm modulo any n, it suffices to be able to factor and compute discrete logarithms modulo primes. To summarize: solving the discrete logarithm problem for a… Expand
Reductions among Number Theoretic Problems
  • H. Woll
  • Computer Science, Mathematics
  • Inf. Comput.
  • 1987
The Discrete Logarithm Modulo a Composite Hides O(n) Bits
Interpolation of Functions Related to the Integer Factoring Problem
On Deterministic Reduction of Factoring Integers to Computing the Exponents of Elements in Modular Group
  • J. Pomykala
  • Mathematics, Computer Science
  • Fundam. Informaticae
  • 2017
Solving discrete logarithm problem over prime fields using quantum annealing and $\frac{n^3}{2}$ logical qubits
...
1
2
3
4
5
...