-
-
but especially for something like libxml2 hash randomization is important to not get pwned by collision attacks
-
A fixed secret per user, or deferred randomization until an attack is detected, would solve the problem.
-
Or even better just use a guaranteed O(log n) data structure (log n is tiny) rather than O(n).
-
HashMap actually removed bucket randomisation for that reason (but I am not sure if that was the best)
End of conversation
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.