Handbook of Applied Cryptography¶
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (1996). Handbook of Applied Cryptography. CRC Press.
Retired. This is not a bibliographic entry. Our extractor captured an inline prose definition from an article and stored it as a work. The concept is real; this registry record is a parsing defect. This entry is kept so the citations that pointed at it still resolve, and so the correction is visible rather than silent.
Cited by¶
4 citations across 4 artifacts.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Attestation
- In cryptography it is digital signatures, X.509 certificate chains, signed software releases, and blockchain inclusion proofs.
This sourceCanonical reference for digital signatures, hash functions, and the binding of a principal to an artifact via a key, including key-compromise semantics for past versus future signatures.
- In cryptography it is digital signatures, X.509 certificate chains, signed software releases, and blockchain inclusion proofs.
- Authentication
- Information security — passwords, hardware tokens, biometrics, certificate chains, and challenge-response protocols that bind a claimed identity to evidence.
This sourceCanonical reference for identification and entity-authentication protocols — passwords, challenge-response, certificate chains binding a claimed identity to evidence.
- Information security — passwords, hardware tokens, biometrics, certificate chains, and challenge-response protocols that bind a claimed identity to evidence.
- Hashing
- In cryptography and security it is document-fingerprint digests, message-authentication codes, password hashing, commitment schemes, Merkle trees, content-addressed storage, and digital signatures that sign the hash.
This sourceStandard reference on cryptographic hash functions — one-wayness, collision-resistance, the avalanche property, the birthday bound, MACs, and Merkle trees.
- In cryptography and security it is document-fingerprint digests, message-authentication codes, password hashing, commitment schemes, Merkle trees, content-addressed storage, and digital signatures that sign the hash.
Mechanisms¶
- Deterministic ID Allocator
- Shorten a random ID for prettiness and the birthday problem makes a collision far likelier than intuition admits — collisions among random draws become likely after roughly the square root of the space size, not near its exhaustion.
This sourceDerives the birthday bound: collisions among random identifiers become likely after on the order of the square root of the identifier space.
- Shorten a random ID for prettiness and the birthday problem makes a collision far likelier than intuition admits — collisions among random draws become likely after roughly the square root of the space size, not near its exhaustion.
Verification¶
Does it exist? Not checked yet. This entry carries no identifier to resolve. It was extracted from the citation as written in the article, normalized, and deduplicated against the rest of the registry.
Does it back the claim? Not recorded. Neither this nor any other of the 4 citations of this work carries a recorded support check.
Was it audited? Yes. A second, independent pass read the citation against the article text and recorded a verdict.
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.
Links previously used in the corpus¶
Before the registry existed this work was also linked 2 other ways.
- https://cacr.uwaterloo.ca/hac/ ×3
- https://onlinebooks.library.upenn.edu/webbin/book/lookupid?key=olbp23595 ×1
Registry ID ref:ff33ec6ccfc2 · see in the full table