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
130 Citations