3 ms·
You are the troll when you dont see the obvious proofs. 1. DOS proof: a hash function can never lead to DoS proofness. Every hash function can be trivially bru
by rurban 10y ago
You are the troll when you dont see the obvious proofs.
1. DOS proof: a hash function can never lead to DoS proofness. Every hash function can be trivially brute forced to find enough collisions for such an attack. When you need to protect against such a worst case you don't make your hash function slower and get limited seed hiding, you rather check for such an attack and mitigate it directly, at the collision resolution.
2. Slowness: see my smhasher page. The slowest of all hash functions which is used in hash tables.
I don't see a usecase for a slow PRF in net. All other PRF's are faster. I also don't see more security, only less. SHA1 replaced by SipHash surely makes it faster, but not safer.