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.
Used when the algorithmic complexity is related to the square of the number of inputs (N^2)
| Nature | Mapping | Type | ID | Name |
|---|---|---|---|---|
| ChildOf | Allowed-with-Review | C | 405 | Asymmetric Resource Consumption (Amplification) |
| ParentOf | Allowed | B | 1333 | Inefficient Regular Expression Complexity |
| Nature | Mapping | Type | ID | Name |
|---|---|---|---|---|
| MemberOf | Prohibited | V | 884 | CWE Cross-section |
| MemberOf | Prohibited | C | 977 | SFP Secondary Cluster: Design |
| MemberOf | Prohibited | V | 1003 | Weaknesses for Simplified Mapping of Published Vulnerabilities |
| MemberOf | Prohibited | C | 1307 | CISQ Quality Measures - Maintainability |
| MemberOf | Prohibited | C | 1416 | Comprehensive Categorization: Resource Lifecycle Management |
| Nature | Mapping | Type | ID | Name |
|---|---|---|---|---|
| MemberOf | Prohibited | BS | BOSS-275 | Low likelihood of exploit |
| MemberOf | Prohibited | BS | BOSS-294 | Not Language-Specific Weaknesses |
| MemberOf | Prohibited | BS | BOSS-314 | DoS: Resource Consumption (CPU) (impact) |
| MemberOf | Prohibited | BS | BOSS-327 | DoS: Resource Consumption (Memory) (impact) |
| MemberOf | Prohibited | BS | BOSS-333 | DoS: Resource Consumption (Other) (impact) |
| Nature | Mapping | Type | ID | Name |
|---|---|---|---|---|
| MemberOf | Prohibited | C | 1307 | CISQ Quality Measures - Maintainability |
| Nature | Mapping | Type | ID | Name |
|---|---|---|---|---|
| MemberOf | Prohibited | C | 977 | SFP Secondary Cluster: Design |
| Scope | Likelihood | Impact | Note |
|---|---|---|---|
| Availability | N/A | DoS: Resource Consumption (CPU)DoS: Resource Consumption (Memory)DoS: Resource Consumption (Other) | The typical consequence is CPU consumption, but memory consumption and consumption of other resources can also occur. |
The typical consequence is CPU consumption, but memory consumption and consumption of other resources can also occur.
N/A
N/A
This example attempts to check if an input string is a "sentence" [REF-1164].
The regular expression has a vulnerable backtracking clause inside (\w+\s?)*$ which can be triggered to cause a Denial of Service by processing particular phrases.
To fix the backtracking problem, backtracking is removed with the ?= portion of the expression which changes it to a lookahead and the \2 which prevents the backtracking. The modified example is:
Note that [REF-1164] has a more thorough (and lengthy) explanation of everything going on within the RegEx.
| Reference | Description |
|---|---|
| CVE-2021-32617 | C++ library for image metadata has "quadratic complexity" issue with unnecessarily repetitive parsing each time an invalid character is encountered |
| CVE-2020-10735 | Python has "quadratic complexity" issue when converting string to int with many digits in unexpected bases |
| CVE-2020-5243 | server allows ReDOS with crafted User-Agent strings, due to overlapping capture groups that cause excessive backtracking. |
| CVE-2014-1474 | Perl-based email address parser has "quadratic complexity" issue via a string that does not contain a valid address |
| 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 | Network monitoring system allows remote attackers to cause a denial of service (CPU consumption and detection outage) via crafted network traffic, aka a "backtracking attack." |
| CVE-2006-3380 | Wiki allows remote attackers to cause a denial of service (CPU consumption) by performing a diff between large, crafted pages that trigger the worst case algorithmic complexity. |
| CVE-2006-3379 | Wiki allows remote attackers to cause a denial of service (CPU consumption) by performing a diff between large, crafted pages that trigger the worst case algorithmic complexity. |
| CVE-2005-2506 | OS allows attackers to cause a denial of service (CPU consumption) via crafted Gregorian dates. |
| CVE-2005-1792 | Memory leak by performing actions faster than the software can clear them. |
| Ordinality | Description |
|---|
This CWE entry is a Class and might have Base-level children that would be more appropriate
Examine children of this entry to see if there is a better fit
| Taxonomy Name | Entry ID | Fit | Entry Name |
|---|---|---|---|
| PLOVER | N/A | N/A | Algorithmic Complexity |
| ID | Name |
|---|