I'm reading a Rust book about `HashMap` [hashing functions](https://doc.rust-lang.org/book/2018-edition/ch08-03-hash-maps.html#hashing-functions), and I can't understand these two sentences.

> 
> By default, HashMap uses a cryptographically secure hashing function that can provide resistance to Denial of Service (DoS) attacks. This is not the fastest hashing algorithm available, but the trade-off for better security that comes with the drop in performance is worth it.
> 
> 
> 

I know what a cryptographically secure hash function is, but don't I understand the rationale behind it. From my understanding a good hash function for `HashMap` should only have three properties: 

* deterministic (the same object has same hash value)
* be VERY fast,
* has a uniform distribution of bits in hash value (meaning it will reduce collision)

Other properties, in cryptographically secure hash function, are not really relevant 99% (maybe even 99.99%) of the time for hash tables.

So my question is: **What does "resistance to DoS attack and better security
" even mean in the context of HashMap?**