Skip to content
Back to the 1994 chronicle
Technology & structures

Shor's algorithm shows the explosive power of quantum computers – how long ago was it?

1994
About 32 years ago

The background

In 1994, the mathematician Peter Shor developed a quantum algorithm that could break down large integers into their prime factors much more efficiently than the well-known classical methods. This is much more than just a mathematical exercise: the difficulty of this decomposition forms the security basis of the widespread RSA encryption method. Shor's work shows that a sufficiently powerful quantum computer would fundamentally endanger important digital security procedures. However, this does not create an immediately usable tool for cracking encrypted messages. The algorithm requires a suitable quantum computer; In particular, the reliable control and error correction of many quantum states pose enormous technical requirements. Its significance lies primarily in its theoretical breakthrough: quantum computers no longer appear just as unusual computing machines, but as possible problem solvers with far-reaching practical consequences. The work will become a central starting point for quantum information technology and, in the long term, will strengthen the search for encryption methods that can also withstand quantum attacks.