|
|
|
![]() |
Vulnerability Note VU#903934Hash table implementations vulnerable to algorithmic complexity attacksOverviewSome programming language implementations do not sufficiently randomize their hash functions or provide means to limit key collision attacks, which can be leveraged by an unauthenticated attacker to cause a denial-of-service (DoS) condition.I. DescriptionMany applications, including common web framework implementations, use hash tables to map key values to associated entries. If the hash table contains entries for different keys that map to the same hash value, a hash collision occurs and additional processing is required to determine which entry is appropriate for the key. If an attacker can generate many requests containing colliding key values, an application performing the hash table lookup may enter a denial of service condition.Hash collision denial-of-service attacks were first detailed in 2003, but recent research details how these attacks apply to modern language hash table implementations.
Please review the Vendor Information section of this document for vendor-specific patch and workaround details.
Referenceshttp://www.ocert.org/advisories/ocert-2011-003.html Thanks to Alexander Klink and Julian Wälde for reporting these vulnerabilities. This document was written by Jared Allar and David Warren.
If you have feedback, comments, or additional information about this vulnerability, please send us
email. |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||