Modular exponent problem
programming
Statement
Modular exponent problem
Given 3 $n$-bit integers $x, y, N \geq 0$ what is $x^y$ mod $N$.
Solutions
- Modular exponent algorithm
- This runs in $O(n^3)$.
Given 3 $n$-bit integers $x, y, N \geq 0$ what is $x^y$ mod $N$.