[Cryptography] Bloom filter question

[Peter Gutmann]

Jon Callas <jon at callas.org> writes:

>On the other end of the scale, there's hash tables, where collisions are
>normal and expected.

It depends on how you're using the hash table, if it's to process attacker-
controlled data like in a packet filter than you can't afford collisions
where an attacker can turn your fast lookup into a slow linear search.

Peter.