Modular exponentiation is about finding the value of the equation c = b mod m. This is the remainder when dividing b by m. It is the inverse function of the discrete logarithm. Because modular exponentiation is easy and fast, and finding the discrete logarithm is difficult, both are used in fields such as public-key cryptography.