Recommendation for Applications Using Approved Hash Algorithms¶
Dang, Q. (2012). Recommendation for Applications Using Approved Hash Algorithms. National Institute of Standards and Technology.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Mechanisms¶
- Adversarial Birthday-Attack Review
- Its strength is that it catches the archetype's most dangerous blind spot: a system sized against accidental collisions that is wide open to deliberate ones, where the real margin is `√N` and half the apparent bit-length has quietly evaporated.
This sourceStates that an L-bit hash provides about L/2 bits of collision resistance—roughly square-root work in the output-space size.
- Its strength is that it catches the archetype's most dangerous blind spot: a system sized against accidental collisions that is wide open to deliberate ones, where the real margin is `√N` and half the apparent bit-length has quietly evaporated.
- Collision Probability Table
- A table almost always assumes uniform, independent draws over a single shared space; a reader who applies it to biased generators, merged partitions, or a truncated hash
This sourceExplains that truncating a hash digest reduces its collision resistance.
- A table almost always assumes uniform, independent draws over a single shared space; a reader who applies it to biased generators, merged partitions, or a truncated hash
- Hash-Collision Budget Review
- … catching the slow drift that point-in-time sizing can't: the namespace that was ample at launch and quietly became marginal, and — critically for security — the gap between estimating accidental collision probability and defending against an adversary running a birthday attack to force a matching pair on purpose.
This sourceNIST assigns an L-bit hash roughly L/2 bits of collision-resistance strength, reflecting the birthday-bound cost of finding a matching pair.
- … catching the slow drift that point-in-time sizing can't: the namespace that was ample at launch and quietly became marginal, and — critically for security — the gap between estimating accidental collision probability and defending against an adversary running a birthday attack to force a matching pair on purpose.
- Hash Collision Risk Assessment
- That pairing of probability and consequence is exactly what the archetype demands.
This sourceDefines risk assessment through the combination of threat-event likelihood and the magnitude of resulting adverse impact.
- That pairing of probability and consequence is exactly what the archetype demands.
Verification¶
Does it exist? Confirmed. This work's DOI resolves to a registered record, which fixes its identity. That is all it fixes.
Does it back the claim? Not recorded. Neither this nor any other of the 4 citations of this work carries a recorded support check.
Support is checked per citation rather than per work — the same source can be cited soundly in one article and wrongly in another. Per-citation recording began recently, so a citation with no recorded check is a gap in the record rather than evidence it went unchecked.
See how references were verified.
Registry ID ref:16a6c13a38c9 · see in the full table