If an attacker knows your hash function, they can generate thousands of distinct keys that all land in one bucket and send them as form fields or JSON keys. Every insert then walks the whole chain, an O(1) map becomes O(n) per operation, and one small request burns a CPU core: this is hash flooding, and in 2011 the same attack hit PHP, Java, Ruby and Python web stacks. The two standard defences are a randomly seeded keyed hash, so an attacker cannot predict buckets, which is why CPython adopted SipHash in PEP 456 and Rust's default hasher does the same, and bounding the damage instead, which is why java.util.HashMap converts a bucket into a red-black tree once that bucket holds eight entries in a table of at least 64 buckets, so the worst case per operation becomes O(log n) instead of O(n).