Top all-time · #7604
Redirecting…
Personal blog · emboss.github.io/blogsecurityprogramming
Redirecting… is a personal blog at emboss.github.io about security and programming. Since 2013, 10 different Hacker News readers have linked it 10 times, most often “Breaking Murmur: Hash-Flooding DoS Reloaded (2012)”. No feed was found, so read it on the site itself.
Most-linked posts?
- Breaking Murmur: Hash-Flooding DoS Reloaded (2012)4 people · 4 mentions · first linked 2019-04-27
- Breaking Murmur: Hash-Flooding DoS Reloaded (2012)2 people · 2 mentions · first linked 2016-12-09
- OpenSSL PRNG Is Not Really Fork-safe2 people · 2 mentions · first linked 2013-08-22
- Krypt - the Next Level of Ruby Cryptography2 people · 2 mentions · first linked 2013-05-29
What Hacker News says?
The production of seed-independent collisions for various versions of murmurhash (e.g., http://emboss.github.io/blog/2012/12/14/breaking-murmur-hash... ) motivated siphash. In general, when there's no positive proof of collision bounds, I would assume (un)lucky inputs can collide much more often than usual, even when you change the seed. The difference between murmurhash and xxhash in that regard is that anyone can…
Comment linking /blog/2012/12/14/breaking-murmur-hash-flooding-dos-reloaded/
on “Meow Hash (2018)”Submitted OpenSSL PRNG Is Not Really Fork-safe as a story · 10 points
HN discussionAfaik, they augmented the hash function with a random seed, which didn't work out. See: http://emboss.github.io/blog/2012/12/14/breaking-murmur-hash... It appears that SipHash would be enough (for now) to prevent hash poisoning. Most open addressing hash implementations doesn't yet use SipHash though.
Comment linking /blog/2012/12/14/breaking-murmur-hash-flooding-dos-reloaded/
on “Open-sourcing F14 for memory-efficient hash tables”Submitted OpenSSL PRNG Is Not Really Fork-safe as a story · 9 points
HN discussionA good example is for a bloom filter: using sha256 is much too slow for good filter performance, you want something like siphash or some other non-cryptographic hash. Here's a good story of the performance benefits of switching from cryptographic to non-crypto hashes: https://github.com/bitly/dablooms/pull/19 (But I don't recommend you use murmur anymore: https://emboss.github.io/blog/2012/12/14/breaking-murmur-has.…
Comment linking /blog/2012/12/14/breaking-murmur-hash-flooding-dos-reloaded/
on “SeaHash: Explained”Submitted Breaking Murmur: Hash-Flooding DoS Reloaded (2012) as a story · 2 points
HN discussionYes, but it's not just that there's only "a chance" that the collision is avoided - that would be enough if it was actually just a random probability (after all, everything about hashing and collisions - in the best textbook case - is just chance). The problem is that there are methods for obtaining what we call "seed-independent collisions" where by analyzing the hashing algorithm itself you can actually determine…
Comment linking /blog/2012/12/14/breaking-murmur-hash-flooding-dos-reloaded/
on “Hashing”Submitted Breaking Murmur: Hash-Flooding DoS Reloaded (2012) as a story · 1 points
HN discussionSubmitted Krypt - the Next Level of Ruby Cryptography as a story · 1 points
HN discussionSubmitted Krypt - the Next Level of Ruby Cryptography as a story · 1 points
HN discussion
