- Post-quantum cryptography (PQC)
- Public-key algorithms designed to resist attack by both classical and quantum computers, while running on today’s computers and networks.
- Quantum-safe
- Cryptography expected to remain secure against known quantum attacks. Used in India’s DST roadmap; often used interchangeably with quantum-resistant.
- ML-KEM
- Module-Lattice-Based Key-Encapsulation Mechanism, specified in NIST FIPS 203. It establishes a shared secret key between two parties.
- ML-DSA
- Module-Lattice-Based Digital Signature Algorithm, specified in NIST FIPS 204, for signing and verifying data.
- SLH-DSA
- Stateless Hash-Based Digital Signature Algorithm, specified in NIST FIPS 205. Its security rests on hash functions rather than lattices.
- Harvest now, decrypt later
- Recording encrypted data today in order to decrypt it once a cryptographically relevant quantum computer exists. Its counterpart for signatures is trust now, forge later.
- Cryptographically relevant quantum computer (CRQC)
- A quantum computer able to break widely used public-key algorithms such as RSA and elliptic-curve cryptography.
- Cryptographic bill of materials (CBOM)
- An inventory of cryptographic assets: algorithms, keys, protocols, certificates and dependencies, as defined in CERT-In’s guidelines.
- Hybrid key exchange
- Combining a classical algorithm such as X25519 with a post-quantum one such as ML-KEM, so that a session stays protected while either remains unbroken.
- Crypto-agility
- The ability to change cryptographic algorithms and parameters through configuration, without redesigning the system.
- Mosca’s inequality
- A timing test recommended in TEC’s migration report: if the years data must stay secure plus the years needed to migrate exceed the years until a capable quantum computer exists, the data is at risk.