Hashes and collisions

Hashes and collisions

Posted Nov 13, 2003 9:01 UTC (Thu) by hingo (subscriber, #14792)
In reply to: Hashes and collisions by nowster
Parent article: An attempt to backdoor the kernel

The Birthday Paradox is a different problem. In that, you are asking for the probability of any two persons "to collide". The cracker who wants to inject code into a BK repository, faces the task of constructing a collision for a given file (somewhat equivalent to finding a person with the same birthday as mine). The probability of finding a collision there is much lower (practically impossible with current hashes, with birthdays of course, you only have 365 days to pick from).

henrik

---

(Log in to post comments)