$ ./guess_the_languageCybersecurity
Cybersecurity · hard · #287

Roughly how many hashes must be computed before a 50% chance of a collision in an n-bit hash?

  1. About 2^(n/2)
  2. About 2^n
  3. About n^2
  4. About 2^(n-1)
The birthday bound puts collisions near 2^(n/2) tries, which is why a 128-bit hash offers only about 64 bits of collision resistance.
Play Cybersecurity ▸