Recommendations for key-encapsulation mechanisms
Open accessAbstract
A key-encapsulation mechanism (KEM) is a set of algorithms that can be used by two par-ties under certain conditions to securely establish a shared secret key over a public channel. A shared secret key that is established using a KEM can then be used with symmetric-key cryptographic algorithms to perform essential tasks in secure communications, such as encryption and authentication. This document describes the basic definitions, properties, and applications of KEMs. It also provides recommendations for implementing and using KEMs in a secure manner.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The construction's post-quantum security guarantee comes from the hardness of M-LWE, which classical KEMs based on factoring or discrete logarithms (e.g., RSA, ECC) cannot offer, since Shor's algorithm solves those problems in polynomial time but has no known effect on lattice-based hardness assumptions.
“This is what gives the construction its post-quantum security guarantee, something classical KEMs based on factoring or discrete logarithms (e.g., RSA, ECC) cannot offer, since Shor's algorithm solves those problems in polynomial time but has no known effect on lattice-based hardness assumptions [62].”
From A hybrid encryption algorithm based on AES and Kyber for secure image protection in the post-quantum era (2026) · cites this paper as [62]
Classical key exchange methods like RSA and ECC are highly vulnerable to Shor's algorithm.
“classical key exchange methods like RSA and ECC, which are highly vulnerable to Shor's algorithm.”
From A hybrid encryption algorithm based on AES and Kyber for secure image protection in the post-quantum era (2026) · cites this paper as [62]
No citation lists for this paper
No citation lists for this paper yet — checked again daily.
Cited by 27
- Authors
- Alagic, G., Barker, E., Chen, L., Moody, D., Robinson, A., Silberg, H., & Waller, N.
- Affiliations
- National Institute of Standards and Technology (US)
- Corresponding author
- Alagic, Gorjan
- Published
- 2025-09-18
- OpenAlex
- W4414205912
- Cited by
- 27
- References
- 0
- Citations by year
- 2026: 25 · 2025: 2
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Funders
- National Institute of Standards and Technology
- Information Technology Laboratory
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptography and Data Security
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Information Systems › Cryptography and Residue Arithmetic
- Keywords
- key encapsulation mechanism, key establishment, shared secret key, public-key cryptography, symmetric encryption, secure key exchange, secure communication
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
