6 ms·
Collisions in modern, properly implemented algorithms are rare. http://everydayinternetstuff.com/2015/04/hash-collision-probability-calculator/ http://everydayi
by sbarker 8y ago
Collisions in modern, properly implemented algorithms are rare. http://everydayinternetstuff.com/2015/04/hash-collision-probability-calculator/ http://everydayinternetstuff.com/2015/04/hash-collision-prob...
https://www.google.com/amp/s/www.theregister.co.uk/AMP/2017/02/23/google_first_sha1_collision/ https://www.google.com/amp/s/www.theregister.co.uk/AMP/2017/...
- lightbyte 8y agoCollisions for the entire hash are rare, but this is just a prefix of the hash. I imagine it is significantly more common for a collision in the prefix.
- basch 8y agoThe average number of hashes returned is 478 The smallest is 381 (hash prefixes "E0812" and "E613D") The largest is 584 (hash prefixes "00000" and "4A4E8") https://www.troyhunt.com/ive-just-launched-pwned-passwords-version-2/ https://www.troyhunt.com/ive-just-launched-pwned-passwords-v...
- tylersmith 8y agoIf the bloom filter returns positive you check the HIBO DB by getting all the hashes with that prefix and check the returned list for the full hash.
- ubernostrum 8y agoI maintain a library that talks to the Have I Been Pwned password database, which uses a 5-hexadecimal-digit prefix of the SHA1 hash. Someone filed a PR asking to add a cache for HIBP's responses, and I did some quick math and came up with ~1200 as a birthday-paradox number for the first five digits of a SHA1 hex digest (assuming uniform/random distribution of hex digits).
- deleted 8y ago[deleted]
- FroshKiller 8y agoLittle code running in the real world any given moment is modern or properly implemented.