How would you find x in a modulo arithmetic expression x^e mod p knowing only e and p?
e is an integer, 0 ≤ e < p, that is relatively prime to p-1; and x is an integer, 0 ≤ x < p.
This question was marked as an exact duplicate of an existing question.
This is the Discrete Logarithm problem, and is not easy.
5 years ago