Prime factorization

Scott Aaronson on Computational Complexity Theory and Quantum Computers

Y Combinator

The process of finding the prime numbers that multiply together to make the original number, used as an example of an NP-complete problem underlying cryptography.