|
|
|
|
CWE-407 Individual Dictionary Definition (Draft 9)
Weakness ID
| Status: Incomplete 407 (Weakness Base) | | Description | Summary An algorithm in a product has an inefficient worst-case computational
complexity that may be detrimental to system performance and can be triggered by an attacker, typically using crafted manipulations
that ensure that the worst case is being reached. | | Common Consequences | The typical consequence is CPU consumption, but memory consumption
and consumption of other resources can also occur. | | Observed Examples | | Reference | Description |
|---|
| CVE-2003-0244 | CPU consumption via inputs that cause many hash table collisions. | | CVE-2003-0364 | CPU consumption via inputs that cause many hash table collisions. | | CVE-2002-1203 | Product performs unnecessary processing before dropping an invalid packet. | | CVE-2001-1501 | CPU and memory consumption using many wildcards. | | CVE-2004-2527 | Product allows attackers to cause multiple copies of a program to be loaded
more quickly than the program can detect that other copies are running, then exit.
This type of error should probably have its own category, where teardown takes more
time than initialization. | | CVE-2006-6931 | | | CVE-2006-3380 | | | CVE-2006-3379 | | | CVE-2005-2506 | | | CVE-2005-1792 | Memory leak by performing actions faster than the software can clear them. |
| | Context Notes | Similar issues can occur in cryptography. | | References | | | Relationships | | | Source Taxonomies | PLOVER - Algorithmic Complexity | | Applicable Platforms | All |
|
- Weakness
- Base
- Variant
- Class
- Chain
- Composite
- Category
- View
- Deprecated
