How would you find $x$ in a modulo arithmetic expression $x^e \bmod p$ knowing only $e$ and $p$?
$e$ is an integer, $0 \leq e \lt p$, that is relatively prime to $p-1$; and $x$ is an integer, $0 \leq x < p$.
How would you find $x$ in a modulo arithmetic expression $x^e \bmod p$ knowing only $e$ and $p$?
$e$ is an integer, $0 \leq e \lt p$, that is relatively prime to $p-1$; and $x$ is an integer, $0 \leq x < p$.