Mathematics
Quadratic Residues and Their Cryptographic Applications
Quick fact
In the Diffie-Hellman key exchange, both parties can publicly share a number that is a quadratic residue, yet only they can compute a shared secret, because finding square roots modulo a large prime is computationally hard.
Why this is interesting
You know how every positive number has a square root? What if we only allowed remainders after division by a prime? Suddenly, some numbers have square roots and others don't—and this simple difference becomes a secret code for modern cryptography.