Skip to main content
Definition Website Computer and Technology

Post-Quantum Cryptography

Subject: Computer and Technology noun /ˌpoʊstˈkwɑːn.təm krɪpˈtɑː.ɡrə.fi/ 1 definition

  1. Definition (noun)

    Entry #343 · Updated

    Post-Quantum Cryptography (PQC) (also called quantum-resistant cryptography) comprises cryptographic algorithms engineered to execute on classical computers while remaining secure against cryptanalysis by both conventional and large-scale fault-tolerant quantum computers. Because Shor's quantum algorithm solves integer factorization and discrete logarithm problems in polynomial time, it compromises classical public-key schemes such as RSA and Elliptic-Curve Cryptography (ECC), driving the shift toward PQC key-encapsulation mechanisms (KEMs) and digital signatures grounded in hard lattice, error-correcting code, hash-based, or multivariate problems. Unlike quantum key distribution (QKD), which requires specialized optical hardware to transmit quantum states over dedicated physical channels, PQC provides a purely mathematical software replacement inside existing network protocols to mitigate threats such as harvest-now, decrypt-later interception. While symmetric primitives like AES-256 and SHA-3 already maintain strong margins against Grover's quadratic search speedup, PQC replaces vulnerable asymmetric infrastructure—typically trading larger public keys, ciphertexts, or signatures for long-term quantum resilience.

    Common Types

    • Lattice-Based Cryptography: Relies on hard geometric problems in high-dimensional lattices—such as Module Learning With Errors (MLWE) and Short Integer Solution (SIS)—powering NIST-standardized ML-KEM (FIPS 203) and ML-DSA (FIPS 204) with balanced key sizes and fast execution.

    • Hash-Based Signatures: Derives unforgeability solely from the collision and preimage resistance of underlying cryptographic hash functions, spanning stateful schemes (XMSS, LMS) and the stateless SLH-DSA (FIPS 205) standard as a conservative fallback with larger signatures.

    • Code-Based Cryptography: Grounds security in the difficulty of decoding random linear error-correcting codes—exemplified by Classic McEliece and NIST-selected HQC—offering decades of cryptanalytic confidence and fast encapsulation alongside larger public keys.

    • Multivariate Cryptography: Builds trapdoor functions from systems of nonlinear multivariate quadratic equations over finite fields, enabling compact, fast-to-verify digital signatures while remaining less suited for general encryption.

    Example

    To protect long-lived financial traffic against harvest-now, decrypt-later collection, a gateway configures its TLS 1.3 stack to negotiate the hybrid X25519MLKEM768 key-exchange group. During the handshake, the client transmits a 1,216-byte key share combining a 32-byte X25519 public key with a 1,184-byte ML-KEM-768 encapsulation key, and the server replies with a 1,120-byte share pairing its X25519 key with a 1,088-byte ML-KEM-768 ciphertext to derive shared session keys for AES-256-GCM encryption.