#2
|
|||
|
|||
Re: Modular exponentiation question
well, you can compute the number of elements relatively prime to m (the order of (Z/mZ)^X). If this is n, then a^n=1 mod m.
This should allow you to reduce it to seeing what b^(c^d) mod n is. Repeat. |
|
|