$G$ and $P$ are known prime.
$$b = a^G \bmod P$$
What is the complexity time of finding $a$ from $b$?
Find the inverse $F:= G^{-1} \bmod P{-}1$ (using eg. Extended Euclidean) and then calculate $b^F \bmod P$ (exponentiation by squaring).
Copyright © 2021 JogjaFile Inc.
Find the inverse $F:= G^{-1} \bmod P{-}1$ (using eg. Extended Euclidean) and then calculate $b^F \bmod P$ (exponentiation by squaring).