TOEIC Link Vocabulary — Post-Quantum Cryptography and Quantum Key Distribution Cluster: The Lattice-Based, Code-Based, and Hash-Based Lexical Inventory That Drives B2 Vocabulary Cross-Functional Briefing Comprehension

The TOEIC Link vocabulary section grades cross-functional briefing comprehension on multi-dimensional rubrics that include lexical recognition, semantic precision, register awareness, and — at the band-23-to-band-27 transition — technical-cluster fluency: whether the candidate's receptive vocabulary reliably recognizes the load-bearing terminology of cryptographic-migration briefings whose content includes the post-quantum and quantum-key-distribution material that has become standard in security-architecture and regulatory-compliance discourse. Candidates who treat post-quantum cryptography terminology as ambient noise and rely on guessing from sentence context lose points because the rubric grades cluster-level lexical recognition rather than ambient comprehension. Candidates who recognize individual terms but cannot discriminate among the lattice-based, code-based, hash-based, and multivariate families of primitives lose points because the rubric grades family-level discrimination as a separate competency from term-level recognition. The rubric rewards family-discriminating, register-matched, precision-bound receptive vocabulary — recognition that names the family the term belongs to, the register the term operates in, and the precise referent the term denotes. This LINK-N cluster catalogs the five families of post-quantum cryptography and quantum key distribution terminology the LINK vocabulary briefings deploy, maps each family to its register and semantic precision, and prescribes the drills that close the band-23-to-band-27 gap. For neighboring vocabulary clusters that this cluster connects to, see the confidential computing and trusted execution environment services cluster, the zero trust network access and microsegmentation cluster, and the venture capital and startup funding cluster guide.

Why post-quantum cryptography fluency controls the cross-functional briefing band gap

The LINK vocabulary briefings at the B2 boundary deliberately present cross-functional security-architecture content whose load-bearing terminology spans the cryptographic-primitive families that NIST has standardized in the post-quantum cryptography migration. A briefing that says the team has selected ML-KEM for key encapsulation and ML-DSA for digital signatures, with SLH-DSA reserved as a hash-based fallback, and the quantum key distribution channel has been deferred pending the readout of the channel-loss budget requires the candidate to recognize the family each primitive belongs to (lattice-based for ML-KEM and ML-DSA, hash-based for SLH-DSA), the role each primitive plays (key encapsulation, digital signature, fallback), and the channel the briefing is contrasting against (quantum key distribution as a separate transport layer). A candidate who recognizes only the surface term ML-KEM but does not know that it belongs to the lattice-based family loses the structural foothold the rubric grades as cluster-level fluency. A candidate who recognizes the family-level vocabulary and can reconstruct the briefing's structural decision logic produces the cluster-fluent recognition that the rubric grades as substantive comprehension.

The discipline the candidate must install is the rule that the first move under a cryptography briefing is to identify which family each named primitive belongs to, which register the briefing is operating in (engineering, regulatory, executive), and which precise referent each term denotes within its family. The family-discriminating move is a receptive move in its own right and the LINK vocabulary rubric grades it as substantive comprehension. The candidate who has internalized this rule converts every cryptography briefing into a three-move comprehension act: family identification followed by register matching followed by precision-bound referent fixing.

The five-family post-quantum cryptography and quantum key distribution lexical inventory

Family 1 — Lattice-based primitives and structured-lattice vocabulary

The lattice-based primitive family covers the NIST-standardized algorithms built on the mathematical hardness of lattice problems and the supporting vocabulary the briefings deploy around them. The cluster includes module learning with errors, module-LWE, ring learning with errors, Ring-LWE, module-SIS, short integer solution, lattice trapdoor, Gaussian sampling, rejection sampling, Number-Theoretic Transform, NTT-friendly modulus, Babai's rounding, BKZ block size, core-SVP hardness, quantum core-SVP hardness, ML-KEM, ML-KEM-512, ML-KEM-768, ML-KEM-1024, Kyber, ML-DSA, ML-DSA-44, ML-DSA-65, ML-DSA-87, Dilithium, Falcon, FALCON-512, FALCON-1024, compact signature, verification-key size, ciphertext size, encapsulation key, decapsulation key, shared secret derivation, chosen-ciphertext security, and IND-CCA2 transform. The cluster is the load-bearing recognition target of cryptographic-migration briefings because the lattice-based primitives are the NIST-selected default for both key encapsulation and digital signature. The candidate who recognizes the lattice-based family signals can reconstruct the briefing's selection rationale even when the briefing does not name the family explicitly.

Family 2 — Code-based primitives and error-correcting-code vocabulary

The code-based primitive family covers the alternate-line NIST-selected algorithms built on the hardness of decoding random linear codes and the supporting vocabulary the briefings deploy around them. The cluster includes code-based cryptography, McEliece cryptosystem, Classic McEliece, binary Goppa code, binary irreducible Goppa polynomial, Niederreiter cryptosystem, syndrome decoding problem, generator matrix, parity-check matrix, permutation matrix, quasi-cyclic code, quasi-cyclic moderate-density-parity-check, BIKE, HQC, Hamming Quasi-Cyclic, key encapsulation mechanism, KEM transform, Fujisaki-Okamoto transform, reaction-attack resistance, decoding failure rate, decryption failure probability, IND-CCA security, public-key size, private-key size, key generation cost, code rate, minimum distance, error-vector weight, and bit-flipping decoder. The cluster is a high-stakes recognition target because the code-based primitives are the NIST-selected backup line whose public-key size is materially larger than the lattice-based default and whose deployment trade-off the briefing's risk-budget discussion centers on. The candidate who recognizes the code-based family signals can reconstruct the briefing's contingency rationale.

Family 3 — Hash-based signatures and stateful-tree vocabulary

The hash-based signature family covers the conservative line of post-quantum digital signatures whose security reduces to the hardness of the underlying hash function and the supporting vocabulary the briefings deploy around them. The cluster includes hash-based signature, Merkle signature scheme, Merkle tree, binary hash tree, authentication path, one-time signature, Lamport signature, Winternitz one-time signature, WOTS+, XMSS, XMSS-MT, LMS, Leighton-Micali signature, hierarchical Merkle tree, stateful signature, state-management requirement, signature-counter discipline, SLH-DSA, SPHINCS+, stateless hash-based signature, few-time signature, FORS, forest of random subsets, hypertree, tree-height parameter, hash function security margin, Grover's algorithm, quantum preimage resistance, quantum collision resistance, bit-security target, NIST security level 1, NIST security level 3, and NIST security level 5. The cluster is the conservative-line recognition target because the hash-based signature family is the only post-quantum signature family whose security does not depend on any unproven hardness assumption beyond the underlying hash function and whose deployment trade-off the briefing's risk-tolerance discussion centers on. The candidate who recognizes the hash-based family signals can reconstruct the briefing's conservative-line fallback rationale.

Family 4 — Multivariate primitives and supersingular-isogeny vocabulary

The multivariate primitive family and the supersingular-isogeny family cover the alternate post-quantum signature and key-exchange candidates that the briefings reference as residual options and the supporting vocabulary the briefings deploy around them. The cluster includes multivariate cryptography, multivariate quadratic equations, MQ problem, unbalanced oil and vinegar, UOV, Rainbow signature scheme, Hidden Field Equations, HFEv-, GeMSS, MAYO signature scheme, multivariate signature, multivariate public key, multivariate private key, supersingular isogeny, supersingular elliptic curve, j-invariant, isogeny graph, CSIDH, commutative supersingular isogeny Diffie-Hellman, SQIsign, supersingular quaternion isogeny signature, endomorphism ring, Deuring correspondence, SIKE attack, Castryck-Decru attack, isogeny-based key exchange, restricted-effective-group-action, and class-group action. The cluster is a residual-option recognition target because the multivariate and isogeny-based families are the NIST-on-ramp candidates whose post-2024 status the briefings discuss in the context of cryptographic agility and migration-roadmap risk. The candidate who recognizes the multivariate and isogeny-based family signals can reconstruct the briefing's agility-rationale discussion.

Family 5 — Quantum key distribution and quantum-channel vocabulary

The quantum key distribution family covers the alternate-channel approach to post-quantum security that does not rely on computational hardness assumptions and the supporting vocabulary the briefings deploy around them. The cluster includes quantum key distribution, QKD, BB84 protocol, B92 protocol, E91 protocol, decoy-state protocol, measurement-device-independent QKD, MDI-QKD, twin-field QKD, TF-QKD, continuous-variable QKD, CV-QKD, discrete-variable QKD, DV-QKD, coherent state, weak coherent pulse, single-photon source, entangled-photon pair, quantum bit error rate, QBER, secret-key rate, channel loss budget, dark count rate, detector efficiency, privacy amplification, information reconciliation, Cascade reconciliation, Low-Density Parity-Check reconciliation, quantum repeater, entanglement swapping, trusted-node assumption, unconditional security, composable security, finite-key analysis, asymptotic key rate, quantum random number generator, and QRNG. The cluster is the alternate-channel recognition target because the quantum key distribution family is the only post-quantum approach whose security is grounded in physics rather than computational hardness and whose deployment trade-off the briefing's transport-layer discussion centers on. The candidate who recognizes the quantum-channel family signals can reconstruct the briefing's transport-layer contrast.

The register-discrimination matrix

The five families are pragmatically distinct and the candidate must learn to discriminate among them rather than collapse them into a single cryptography vocabulary set. The lattice-based family carries the default-line register; the code-based family carries the backup-line register; the hash-based family carries the conservative-line register; the multivariate and isogeny-based families carry the agility-option register; the quantum key distribution family carries the alternate-channel register. A candidate who treats every cryptography briefing as a single undifferentiated vocabulary set produces flat recognition that the rubric grades as low-content. The band-27 candidate identifies the family signature of each named primitive and reconstructs the briefing's selection logic at the family level.

The discrimination drill should run on every cryptography briefing the candidate practices during preparation. The drill is simple: read the briefing, identify the named primitives, classify each primitive into its family, identify the register the briefing operates in, and confirm that the candidate's comprehension reconstructs the selection logic at the family level. The drill that the candidate runs across thirty cryptography briefings in the first two weeks of preparation installs the discrimination reflex at a speed that supports the LINK vocabulary module's pacing constraint.

The two-week practice routine

Week 1 — Five-family recognition drill

The candidate practices fifteen cryptography briefings and classifies each named primitive into its family. The week's output is a five-family recognition log that maps each briefing to the families deployed and the selection logic reconstructed. The drill builds the structural reflex that converts term-level recognition into family-level discrimination.

Week 2 — Integrated register and selection-logic drill

The candidate practices fifteen cryptography briefings and produces a register-matched, selection-logic-reconstructed comprehension act within the LINK vocabulary module's pacing budget. The week's output is a comprehension log that records the register identified, the selection logic reconstructed, and the family discrimination achieved. The drill builds the receptive reflex that converts the five-family inventory into a deployable comprehension act under LINK vocabulary pacing.

Closing the band gap

The post-quantum cryptography and quantum key distribution vocabulary cluster does not yield to flashcard memorization of individual terms. It yields to structural decomposition into five families whose registers are pragmatically distinct and whose family signatures are testable on every briefing. The candidate who installs the five-family inventory and runs the two-week routine reliably exits the band-23-to-band-27 transition on cryptography briefings and reaches the band-27 ceiling on this cluster. For the upstream vocabulary cluster that supports the cryptographic-migration register, see the confidential computing and trusted execution environment services cluster guide. For the related cluster that gives the candidate the network-architecture vocabulary used in transport-layer discussions, see the zero trust network access and microsegmentation cluster guide.