Stack Exchange network consists of 174 Q&A communities including Stack Overflow, the largest, most trusted online community for developers to learn, share their knowledge, and build their careers.
Are these two equations:
\ (g^a Mod\ p)^b\,
\ (g^a)^b (Mod\ p)\,
one and the same? If yes then how And if no then how to solve the first equation?
Your question is addressed by a repeated application of the following easily proved fact:
If $a\equiv a'\pmod n$ and $b\equiv b'\pmod n$, then $ab\equiv a'b'\pmod n\,$.
5 years, 6 months ago