openskills.info
Course Preview

Post-Quantum Cryptography

Post-quantum cryptography is public-key cryptography designed to resist attacks from both conventional and future large quantum computers. It replaces quantum-vulnerable key establishment and digital signatures while continuing to run on ordinary computers and networks.

itIdentity, access, and cryptography

Post-Quantum Cryptography

Post-quantum cryptography, or PQC, is public-key cryptography designed around mathematical problems that are believed to resist attacks by both conventional and large quantum computers. It runs on conventional hardware. It is different from quantum key distribution, which depends on quantum communication equipment.

The transition matters because a sufficiently capable quantum computer running Shor's algorithm could solve the factoring and discrete-logarithm problems behind RSA, finite-field Diffie–Hellman, elliptic-curve Diffie–Hellman, DSA, and ECDSA. Those systems provide key establishment, authentication, and signatures across TLS, virtual private networks, software updates, certificates, messaging, and identity systems. Grover's algorithm gives a smaller, quadratic speedup against brute-force search. Symmetric encryption and hashing therefore need adequate key and output sizes, but they do not require the same wholesale replacement as vulnerable public-key systems.

No cryptographically relevant quantum computer is known to exist. Migration still begins before one does. An attacker can record encrypted traffic now and attempt to decrypt it later. Long-lived secrets face this harvest-now-decrypt-later risk as soon as their required confidentiality period extends beyond the expected migration and quantum-computer timelines.

Two jobs, three standards

PQC does not provide one universal replacement algorithm. Public-key cryptography has two main jobs, and NIST's first standards separate them.

ML-KEM, specified by FIPS 203, is a key-encapsulation mechanism. One party generates an encapsulation key and a decapsulation key. Another party uses the encapsulation key to produce a ciphertext and a shared secret. The holder of the decapsulation key recovers the same shared secret from that ciphertext. A protocol then feeds the shared secret into symmetric-key derivation and uses the resulting keys for encryption and authentication. ML-KEM does not encrypt an application message directly and does not authenticate the peer by itself.

Continue the course

This section is part of the paid course.

See pricing to subscribe, or log in if you already have access.

Where this skill leads

Relevant careers

See how this topic contributes to broader role-level skill maps.

Sources