# Modular Exponentiation

Modular Exponentiation as also known as repeated sequence algorithm which performs exponentiation over modulus. Which essential in computer cryptosystems. A typical problem related to cryptography involves exponentials with a very large number e.g. 36078267 mod 17. To perform these very large number calculation we need an efficient approach. The approach should be a time-efficient and memory-efficient approach. As directly calculating (36078 * 267 mod 17) … Continue reading Modular Exponentiation