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?
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?
I don't have time to go through the links, but at a cursory glance some of these may help http://www.google.com/search?q=hash+collision+probability&rlz=1C1GGGE_enUS436US488&aq=f&oq=hash+collision+probability&aqs=chrome.0.57j0l3j62l2.8454&sourceid=chrome&ie=UTF-8
Topic archived. No new replies allowed.