Collisions in hash functions

I don't know how to determine the probability of collisions in a given hash algorithm.

It must have to do, at least in part, with the input domain not mapping to the output domain. So there must be a reliable way to compute this, rather than brute-forcing the hash, right?
Topic archived. No new replies allowed.