Complexity of finding a root in ring P

43 Views Asked by At

$G$ and $P$ are known prime.

$$b = a^G \bmod P$$

What is the complexity time of finding $a$ from $b$?

1

There are 1 best solutions below

0
On BEST ANSWER

Find the inverse $F:= G^{-1} \bmod P{-}1$ (using eg. Extended Euclidean) and then calculate $b^F \bmod P$ (exponentiation by squaring).