|
Dailydave
mailing list archives
Denial of Service via Algorithmic Complexity
From: "Tal Garfinkel" <talg () stanford edu>
Date: Wed, 23 Apr 2008 10:26:03 -0700
There has been some work done on the issue that dave mentioned about
exploiting the complexity of certain program operations
for efficient denial of service by Scott Crosby and Dan Wallach from Rice.
They looked at how this type of attack could be
used against the Bro IDS, among other things... you can check out their
Usenix Security paper, example code, and pointers
to related work here.
http://www.cs.rice.edu/~scrosby/hash/
Cheers,
Tal
_______________________________________________
Dailydave mailing list
Dailydave () lists immunitysec com
http://lists.immunitysec.com/mailman/listinfo/dailydave
By Date
By Thread
Current thread:
- Denial of Service via Algorithmic Complexity Tal Garfinkel (Apr 23)
|