🧮

How would a quantum computer break RSA, and why hasn't one yet?

In 1994 Peter Shor showed that a quantum computer could factor huge numbers in polynomial time. Three decades on, lab demonstrations have only managed tiny numbers, and none has met the algorithm's full requirements.

Tap to go on, or swipe →