Post‑Quantum Cryptography: Threats, Algorithms & Migration

 13 min video

 2 min read

YouTube video ID: _MoRcYLN-7U

Source: YouTube video by ComputerphileWatch original video

PDF

Quantum computers that can break today’s encryption do not exist yet. The largest error‑corrected machines hover around 50 qubits, and estimates place a truly powerful device many decades away. Even so, the “harvest now, decrypt later” approach encourages attackers to capture encrypted traffic today and store it for future decryption once quantum hardware matures. This forward‑looking threat motivates the search for quantum‑resistant security long before the hardware arrives.

Algorithmic Impacts

Grover’s algorithm gives a quadratic speedup for unstructured search, effectively halving the bit‑security of symmetric keys. Under Grover, AES‑128 drops to an effective 2^64 security level, while AES‑256 retains about 2^128. The simple fix is to adopt larger symmetric keys, such as AES‑256, to preserve a comfortable margin.

Shor’s algorithm, by contrast, solves integer factorization and discrete logarithms in polynomial time. A successful run would dismantle RSA, Diffie‑Hellman, and elliptic‑curve cryptography. Estimates suggest roughly 4,000 qubits are needed for Shor to break a typical RSA key, a far cry from today’s 50‑qubit machines but a clear target for future development.

Transitioning to Post‑Quantum

Since 2016, NIST has run a competition to standardize quantum‑resistant algorithms. The process has already eliminated vulnerable candidates; for example, the SIKE (Super‑singular Isogeny Key Exchange) scheme was broken in 2022. Modern TLS implementations now often employ hybrid key exchanges, pairing a classic elliptic‑curve method like X25519 with a post‑quantum scheme such as Kyber (ML‑KEM 768). This dual approach lets existing infrastructure continue to work while adding a lattice‑based layer that relies on the hardness of finding the nearest point in a high‑dimensional grid.

Hash‑based signature schemes also earn a place in the post‑quantum toolbox because they depend only on the one‑way nature of hash functions, a property that remains solid against quantum attacks. Together, lattice‑based key encapsulation and hash‑based signatures form a practical migration path for securing data well into the quantum era.

Sponsor Note

The conversation is brought to you by Jane Street, a trading firm that supports research into future‑proof cryptography. Their involvement underscores the industry‑wide recognition that preparing for quantum threats is not a speculative exercise but a prudent risk‑management strategy.

  Takeaways

  • Current quantum computers top out at about 50 error‑corrected qubits, keeping them far from the capability needed to break modern encryption.
  • Grover's algorithm halves symmetric key security, making AES‑128 equivalent to 2^64 bits, while AES‑256 still offers roughly 2^128 bits of protection.
  • Shor's algorithm would compromise RSA and elliptic‑curve cryptography, and estimates place the required qubit count around 4,000.
  • NIST's post‑quantum standardization effort, started in 2016, has already discarded vulnerable candidates like SIKE and promotes lattice‑based schemes such as Kyber.
  • Hybrid TLS key exchanges that combine classic elliptic‑curve methods with post‑quantum algorithms provide a practical bridge toward quantum‑resistant security.

Frequently Asked Questions

What does the "harvest now, decrypt later" strategy involve?

It involves intercepting and storing encrypted communications today with the intention of decrypting them in the future once quantum computers become powerful enough to break current encryption. The approach assumes attackers can retain data long enough for quantum breakthroughs to occur.

How many qubits are estimated to be needed for Shor's algorithm to break RSA?

Rough estimates put the requirement at about 4,000 qubits for Shor's algorithm to factor an RSA key successfully. This figure contrasts sharply with today's largest error‑corrected machines, which contain roughly 50 qubits.

Who is Computerphile on YouTube?

Computerphile is a YouTube channel that publishes videos on a range of topics. Browse more summaries from this channel below.

Does this page include the full transcript of the video?

Yes, the full transcript for this video is available on this page. Click 'Show transcript' in the sidebar to read it.

Helpful resources related to this video

If you want to practice or explore the concepts discussed in the video, these commonly used tools may help.

Links may be affiliate links. We only include resources that are genuinely relevant to the topic.

PDF