## Modular Exponentiation – A curvy road to simplicity

Modular Exponentiation helps us in computing modulo of some numbers which are extremely large. E.g. if x and y are two variables of 100 and 500 bits long respectively, then calculating [latex]x^y mod N[/latex] is pretty damn difficult with normal multiplications and divisions. And what about if N itself is of extremely long number of bits. There are huge applications of such calculations in cryptography, and modular exponentiation makes it easy for us. So in modular exponentiation, we ask the simple question Given 3 numbers x, y, and N, compute [latex]x^y mod N[/latex] Let’s assume x and y as 30-bits long. Then [latex]x^y[/latex] would be likeRead More →