Authors:
Noa Bar-Yosef
1
and
Avishai Wool
2
Affiliations:
1
School of Computer Science, Tel Aviv University, Israel
;
2
School of Electrical Engineering, Tel Aviv University, Israel
Keyword(s):
Algorithmic complexity attack, denial of service, packet filter.
Abstract:
Many network devices, such as routers, firewalls, and intrusion detection systems, usually maintain perconnection state in a hash table. However, hash tables are susceptible to algorithmic complexity attacks, in which the attacker degenerates the hash into a simple linked list. A common counter-measure is to randomize the hash table by adding a secret value, known only to the device, as a parameter to the hash function. Our goal is to demonstrate how the attacker can defeat this protection: we demonstrate how to discover this secret value, and to do so remotely, using network traffic. We show that if the secret value is small enough, such an attack is possible. Our attack does not rely on any weakness of a particular hash function and can work against any hash — although a poorly chosen hash function, that produces many collisions, can make the attack more efficient. We present a mathematical modeling of the attack, simulate the attack on different network topologies and finally desc
ribe a real-life attack against a weakened version of the Linux Netfilter.
(More)