2 ms·
The answer to that has always been universal hash functions. You have a family of hash functions, one of which is picked randomly. In the family, each hash fun
by espadrine 10y ago
The answer to that has always been universal hash functions.
You have a family of hash functions, one of which is picked randomly. In the family, each hash function is such that Pr(collision) ≤ Pr(randomly picking that hash function).
That way, for a sufficiently large family, it is virtually impossible to hit its worst case.
- rurban 10y agoNo, it's not. With enough data leaking, like ordering and timings attacks are computable. Only a proper collision resolution method can prevent from DoS attacks. The blog post doesn't even know about modern hash tables, not chasing ptrs in a linked list, which is not recommended where ptrs chasing is 50x slower than adjacent entries (cpu's of the last 15 years). But for newbies it's at least a beginning.