Mathematics
Modular Arithmetic and Its Role in Cryptography
Quick fact
In modular arithmetic, 11 + 3 equals 2 (on a 12-hour clock), and this idea powers RSA encryption, where a message can be encrypted with one number but decryption requires finding a secret exponent modulo a large number—a task that takes even supercomputers centuries without that secret.
Why this is interesting
You rely on modular arithmetic every time you check a clock—but the same math that tells you it's '3 hours after 11' also protects your credit card numbers online. How can such a simple idea be powerful enough to secure digital communication?