Question: Give a polynomial-time algorithm for computing a^(b^c) mod p, given a, b, c, and prime p. The chegg answer doesnt make sense to me.
Give a polynomial-time algorithm for computing a^(b^c) mod p, given a, b, c, and prime p. The chegg answer doesnt make sense to me.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
