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¶
This reference passed the adversarial substantiation pipeline: it was checked to exist and to support the claim it is attached to. See how references were verified.
Registry ID ref:01fa6163ba9a · see in the full table