primes - Modular Exponentiation with Fermat's little theorem

Question

How can I compute x^(y^z) mod p in O(log(max{x, y, z, p}) time using Fermat's little theorem where x,y,z,p are Natural numbers and p is prime

question from:https://stackoverflow.com/questions/65930901/modular-exponentiation-with-fermats-little-theorem

Answer 1

Waitting for answers