Mathematics
Computational Complexity and the P Versus NP Problem
Quick fact
The P versus NP problem is one of the seven Millennium Prize Problems; a correct solution earns $1 million, and a proof that P = NP would collapse many modern cryptographic systems.
Why this is interesting
You have a lock that can be opened only by trying many combinations, but you can check any guess instantly. Could you design a master key that opens it without endless trial and error? This is the heart of the P versus NP problem.