Because of the birthday attack, a collision in an n-bit hash function can be found with about how many hash computations?

Explanation

By the birthday paradox, about 2^(n/2) random messages are enough to find two with the same hash, so a 64-bit hash gives a collision after roughly 2³² trials.