"be consistent" | |
PerlMonks |
Re: hash collision DOSby astaines (Curate) |
on Jun 01, 2003 at 23:01 UTC ( [id://262264]=note: print w/replies, xml ) | Need Help?? |
Hi, What happpens when such an attack succeeds is that hash performance goes from O(n) to O(n^2). This matters a lot if n is several tens of thousands, but not at all if n is around 10 or 100. You can exploit this if (and only if) you can send large amounts of data to a program which then gets stored in a hash in the program. To fix this you just need to patch perl to use a different hashing algorithm. I leave this as an exercise for you... ----
In Section
Seekers of Perl Wisdom
|
|