Hi everyone! One of my classmates suggested to me this approach for reduction of powers and it really helps. You should try it out too if you want. Here is the link:

https://www.khanacademy.org/computing/computer-science/cryptography/modarithmetic/a/fast-modular-exponentiation

The portion of the article I referenced is where it says "How can we calculate A^B mod C quickly for any B ?".