The big is the small.

https://www.youtube.com/watch?v=9DeOnCKfSuY

Watching this entire video will explain how discrete logarithms are calculated using the solution to integer factorization, and may even conta

We can state the problem of factorization as a discrete logarithm like so:

We pick any number that is relatively prime to c and call it k, (it is easy to find a relative prime, it is any number for which GCD(c, k) == 1).

Where ϕ(c) is Euler's totient function,

k^(ϕ(c)) ≡ 1 (mod c)

Read as: "k to the totient of c is congruent to 1 mod c." Thus, since it is easy to select a valid k, the factorization problem is restated as a discrete logarithm.

Using an example of 123, if we use 122 as k (GCD(123, 122) == 1), then 122^ϕ(123) ≡ 1 (mod c). We just have to calculate this exponent.

Are there any other equivalences of this problem?