Cryptography¶
Stinson, D. R., & Paterson, M. B. (2018). Cryptography: Theory and Practice. CRC Press.
Cited by¶
1 citation across 1 artifact.
Each citation links to the sentence it supports in the citing article.
Primes¶
- Birthday Problem
- Cryptography — birthday attacks against hash functions, digital signatures, and message-authentication codes: an n-bit hash is collision-attackable in O(2^(n/2)) work, which is why a 256-bit digest delivers only 128 bits of collision security.
This sourceDevelops the birthday attack: an n-bit hash admits a collision in O(2^(n/2)) work because collisions are a match-any-pair event saturating at √K = 2^(n/2), distinct from second-preimage resistance which scales linearly as 2^n — hence 256-bit digests give 128-bit collision security.
- Cryptography — birthday attacks against hash functions, digital signatures, and message-authentication codes: an n-bit hash is collision-attackable in O(2^(n/2)) work, which is why a 256-bit digest delivers only 128 bits of collision security.
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. The single citation of this work carries no 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:01fa6163ba9a · see in the full table