Re: Algorimic Complexity Attacks

[Nicholas Weaver <nweaver () CS berkeley edu>]

On Sun, Jun 08, 2003 at 06:17:38PM +0200, Pavel Kankovsky composed:
> We need a function having a (relatively) small set of results in order to
> build a hash table. We can also assume the information about collisions
> leaks out via a timing channel. Ergo, a persistent attacker can find
> enough collisions by trial and error.

IF the hash is good, FINDING collisions doesn't necessarily help the
attacker, as the attacker really needs to generate lots of collisions
to make the searches O(n) instead of O(1), since that is teh key
behind this attack.

-- 
Nicholas C. Weaver                                 nweaver () cs berkeley edu