Skip to content

Video companion

After PBS Infinite Series: period-finding and the quantum threat to PKI

PBS Infinite Series walks through the mathematics behind Shor's algorithm — period-finding and the quantum Fourier transform — without assuming a quantum physics background.

Period-finding concept diagram for Shor's algorithm.
Hacking at Quantum Speed with Shor's Algorithm Watch on YouTube

What the video gets right

The core insight: factoring (N = p \times q) reduces to finding the period (r) of (a^x \mod N). Classical computers struggle with this; a quantum computer uses superposition and the quantum Fourier transform to extract the period efficiently.

That is why RSA and elliptic-curve cryptography — both built on hard number-theoretic problems — fall to Shor's. Pair this video with minutephysics' Shor's explainer for a two-part foundation.

NIST's overview explains why lattice-based replacements (ML-KEM, ML-DSA) resist known quantum attacks.

What it does not cover

Period-finding is elegant mathematics; your audit committee wants asset lists. Engineers need to know where RSA and ECDH appear: TLS handshakes, code signing, email (S/MIME), VPN, and JWKS endpoints for OIDC tokens.

This quarter

  1. Complete both Shor explainers (minutephysics + PBS) and confirm you can explain the threat without slides.
  2. Extend inventory beyond web TLS to JWKS, STARTTLS, and SSH host keys.
  3. Export a CBOM and crosswalk to NIST IR 8547 migration phases.

Continue on the Q-Day hub: What is Q-Day? guide

References & further reading

Authoritative primary sources cited in this article. Summaries are our own — follow links for full context.

Last verified 2026-06-21

See your exposure with evidence

Run a live PQC inventory scan, export a CBOM, and verify signed reports independently.