|
|
|
Date Submitted:
01/12/06
Hits: 28 Rating:  based on 0 votes
Denial of Service via Algorithmic Complexity AttacksAdded by Papergrl
Description:
We present a new class of low-bandwidth denial of service attacks that exploit algorithmic deficiencies in many common applications data structures. Frequently used data structures have "average-case" expected running time that's far more efficient than the worst case. We show how an attacker can effectively compute such input, and we demonstrate attacks against the hash table implementations in two versions of Perl, the Squid web proxy, and the Bro intrusion detection system.
Read the Complete Paper |