The DOI matches its Crossref record; 6 of the 7 references it cites were found in a registry or an index; none of the 2 sources its claims cite is checked for support yet.
Recommendation for password-based key derivation: part 1: storage applications
Open accessAbstract
This Recommendation specifies techniques for the derivation of master keys from passwords or passphrases to protect stored electronic data or data protection keys.
Overview
CoChat Summary
TL;DR
NIST SP 800-132 specifies password-based key derivation functions for deriving master keys from passwords or passphrases to protect stored electronic data or data-protection keys. It approves PBKDF2 using HMAC with an approved hash function and gives requirements and recommendations for salt, iteration count, and use of the derived master key.
Key findings
- Passwords/passphrases shall not be used directly as cryptographic keys because of low entropy and weak randomness; PBKDFs slow dictionary and brute-force attacks by increasing the time needed to test each password. Using C iterations raises the cost of attacking a password with t bits of entropy from 2^t operations to C×2^t operations.
- The salt shall be all or partly generated by an approved Random Bit Generator, and the randomly generated portion shall be at least 128 bits. For a given password, the number of possible resulting keys is approximately 2^sLen, where sLen is the salt length in bits.
- The iteration count shall be as large as possible while acceptable to users; a minimum of 1,000 is recommended, and for especially critical keys or very powerful systems, 10,000,000 may be appropriate. The desired master-key length kLen shall be at least 112 bits.
- PBKDF2 is approved as the PBKDF using HMAC with any approved hash function. The master key shall not be used for other purposes; it is used directly or via an approved KDF to derive/protect Data Protection Keys, with DPK protection using approved authenticated encryption or approved encryption plus authentication.
Methods
- This is a NIST Recommendation/specification, not an empirical study; it defines a family of password-based key derivation functions with mk = PBKDF(PRF, C)(P, S, kLen).
- It specifies salt generation, iteration-count selection, the PBKDF2/HMAC construction, and procedures for using the derived master key to protect data through DPKs in Options 1a, 1b, 2a, and 2b.
- Security rationale is provided in appendices: user-selected password entropy, dictionary/brute-force attacks, salt length, iteration-count tradeoffs, and DPK protection. No dataset, sample, or statistical analysis is reported.
Limitations
- Stated: the iteration count must balance attack cost against user-perceived performance; acceptable performance depends on the system and application, and larger counts hurt authorized users.
- Stated: some requirements are out-of-scope for CAVP or CMVP testing and are the responsibility of entities using, implementing, installing, or configuring applications that incorporate the Recommendation.
- Evident from the text: the document is normative guidance with no empirical validation, benchmarks, or measured outcomes; it also notes that user-chosen passwords have low entropy and that offline attacks are parallelizable.
Model-written summary. Check it against the paper before relying on it.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
0 Valid · 3 Not valid · 1 Not checked · 21 Own results and interpretations
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“An attacker with a list of likely passwords can evaluate the PBKDF using the known iteration counter and the salt.”
§ Recommendation for Password-Based Key Derivation Part 1: Storage Applications > Additional information
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“However, using an incorrect MK results in a failure during the authentication process used in recovering DPK.”
§ Recommendation for Password-Based Key Derivation Part 1: Storage Applications > Additional information
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Such passwords can only be recovered using inefficient brute force attacks that try all possible passwords.”
§ Recommendation for Password-Based Key Derivation Part 1: Storage Applications > Additional information
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: unclear — It is unclear whether the paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“For a given password, the number of possible resulting keys is approximately 2 sLen , where sLen is the length of the salt in bits.”
§ Recommendation for Password-Based Key Derivation Part 1: Storage Applications > Additional information
hedgedstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: unclear — It is unclear why the paper says it holds.
A conclusion the paper draws from its own results — it cites no other source for it, so there is none to check. The quote shows it is in the paper.
In the paper
“Since an attacker has to spend a significant amount of computing time for each try, it becomes harder to apply the dictionary or brute force attacks.”
§ Recommendation for Password-Based Key Derivation Part 1: Storage Applications > Additional information
plainstates a cause- Asserted: passes — The authors put it forward as true.
- Checkable: passes — It can be checked against evidence.
- Load-bearing: passes — The paper’s conclusions depend on it.
- Based: passes — The paper gives a reason why it holds.
4 more claims
Create a free account to see all 25 claims and every source verdict.
- Probably not a substantial claim. 15
- It may state two separate claims as one. 3
Citations
Cites
Recommendation for block cipher modes of operation: GaloisCounter Mode (GCM) and GMAC
Dworkin, M. J. (2007) · doi:10.6028/nist.sp.800-38d · Cited by 727
Recommendation for random number generation using deterministic random bit generators
Barker, E. B., & Kelsey, J. M. (2012) · doi:10.6028/nist.sp.800-90a · Cited by 306
Self-citationRecommendation for Random Number Generation Using Deterministic Random Bit Generators
Barker, E. B., & Kelsey, J. M. (2015) · doi:10.6028/nist.sp.800-90ar1 · Cited by 304
Self-citationDworkin, M. J. (2007) · doi:10.6028/nist.sp.800-38c · Cited by 297
The keyed-hash message authentication code (HMAC)
National Institute of Standards and Technology (US) (2008) · doi:10.6028/nist.fips.198-1 · Cited by 214
Recommendation for key derivation using pseudorandom functions
Chen, L. (2024) · doi:10.6028/nist.sp.800-108r1-upd1 · Cited by 55
Self-citation
Cited by
Report on lightweight cryptography
McKay, K. A., Bassham, L., Turan, M. S., & Mouha, N. (2017) · doi:10.6028/nist.ir.8114 · Cited by 353
Self-citationRecommendation for key management: part 1 - general
Barker, E. (2020) · doi:10.6028/nist.sp.800-57pt1r5 · Cited by 271
Self-citationFROST: Forensic Recovery of Scrambled Telephones
Müller, T., & Spreitzenbarth, M. (2013) · Lecture notes in computer science · doi:10.1007/978-3-642-38980-1_23 · Cited by 111
Recommendation for key management: part 2 -- best practices for key management organizations
Barker, E. B., & Barker, W. C. (2019) · doi:10.6028/nist.sp.800-57pt2r1 · Cited by 105
Self-citationOn the Economics of Offline Password Cracking
Blocki, J., Harsha, B., & Zhou, S. (2018) · IEEE Symposium on Security and Privacy (S&P) · doi:10.1109/sp.2018.00009 · Cited by 118
Metadata
- Authors
- Turan, M. S., Barker, E. B., Burr, W. E., & Chen, L.
- Published
- 2010
- OpenAlex
- W2644662048
- Cited by
- 103
- References
- 7
- Citations by year
- 2026: 16 · 2025: 9 · 2024: 10 · 2023: 3 · 2022: 5 · 2021: 8 · 2020: 10 · 2019: 4 · 2018: 6 · 2017: 7 · 2016: 3 · 2015: 6 · 2014: 7 · 2013: 6 · 2012: 1
- Type
- report
- Language
- en
- Open access
- gold
- doi.org
- Licence
- public-domain
- Funders
- National Security Agency
- National Institute of Standards and Technology
- Topics
- Physical Sciences › Computer Science › Information Systems › User Authentication and Security Systems
- Physical Sciences › Computer Science › Computer Networks and Communications › Advanced Authentication Protocols Security
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- password-based key derivation, passphrases, key management
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.
A language model drew the claims from the paper on 2026-11-16, under version 3 of the claim definition (model deepseek-v4.1-flash, prompt extract-v3).
A second model labelled each claim on 2026-11-16 (model jev-1.13-20260917, definition revision gold-guideline-v0.2).
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
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.