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 has been asked before and already has an answer. If those answers do not fully address your question, please ask a new question.
This is the Discrete Logarithm problem, and is not easy.
4 years ago