CWE-407: Inefficient Algorithmic Complexity
252 CVEs have CWE-407 as their primary weakness. 0 of them are in the CISA KEV catalog. The highest EPSS score among them is 78.031%.
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.
Child of CWE-405: Asymmetric Resource Consumption (Amplification)
Observed examples
- 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.
Top released CVEs
KEV first, then the highest EPSS score, the highest CVSS score and the newest.
| CVE | Published | Severity | CVSS | EPSS | Description |
|---|---|---|---|---|---|
| CVE-2026-129307 | 2026-11-16 | MEDIUM | 5.3 | 0.291% | eml_parser serves as a python module for parsing eml files and returning various information found in the e-mail as well as computed information. In 3.0.3 and… |
Get more CVE data from the API.
curl 'https://api.contrastcyber.com/cwe_lookup/CWE-407'curl 'https://api.contrastcyber.com/cve_search?cwe_id=CWE-407'
Sources
- Vulnerability data from the National Vulnerability Database (NIST) and the CVE Program. CVE records: Copyright © 1999-2026, The MITRE Corporation, used under the CVE Program Terms of Use. CVE® is a registered trademark of The MITRE Corporation.
- CWE definitions: Copyright © 2006-2026, The MITRE Corporation, used under the CWE Terms of Use. CWE is a trademark of The MITRE Corporation.
- EPSS scores by FIRST.org EPSS, used with attribution.
- KEV catalog and SSVC decisions by CISA.
- Advisory data from the GitHub Advisory Database through OSV.dev (CC BY 4.0).
- Exploit metadata from the Exploit Database (GPL-2.0-only, metadata only).
- Nuclei template names from nuclei-templates (MIT).