background

The problem and classical response

Some widely used public-key schemes depend on mathematical problems that Shor's algorithms could solve efficiently on a sufficiently capable quantum computer. This is a conditional hardware threat, not evidence that all encryption is broken.

Sources: Peter Shor, author manuscript

reported

What happened

On August 13, 2024, NIST announced its first three finalized post-quantum standards: ML-KEM for key establishment, and ML-DSA and SLH-DSA for signatures. These are algorithms for classical computers. Migration is separate from buying quantum hardware.

Sources: NIST

interpretation

The remaining work

The standardization event does not prove every organization's systems have migrated. Inventories, interoperability and implementation checks are practical parts of adoption. This page explains the distinction; deployment choices require the applicable current technical guidance.

Sources: NIST

Sources and review scope

Source-linked. Editorial review: .

  1. Polynomial-time algorithms for prime factorization and discrete logarithms ↗

    Peter Shor, author manuscript · Accessed 2026-10-02

  2. First three finalized post-quantum encryption standards ↗

    NIST · Accessed 2026-10-02

Keep exploring

1994 · Quantum

Factoring changes the quantum conversation

Shor presented efficient quantum algorithms for factoring and discrete logarithms. Algorithmic possibility requires suitable hardware; it did not mean contemporary encryption was immediately broken.

2024 · Quantum

A cryptography response

NIST finalized its first three post-quantum cryptography standards in August 2024. These protect information using classical systems; they are not a quantum computer deployment.