Science, Cryptography, Art, Drawing, Quantum Computing.
the best algorithms for cracking RSA encryption scale exponetentially with time. But, in 1997, a breakthrough happened! Peter Shor showed in a seminal paper how one can factorize numbers in polynomial time on a quantum computer. While the implementation is rather technical, you can read a good