Flight Lab / Graduate algorithms / 05
Lesson 05 of 05 · about 4 min
RSA keeps every intermediate value modulo n. A power that looks huge collapses to a remainder smaller than the modulus. You can multiply and reduce one factor at a time, or reduce the whole power at the end. The remainder is the same.
Compute 2 to the 10th modulo 17. Enter the remainder.