CWE-1333: Inefficient Regular Expression Complexity
Also known as: ReDoS, Regular Expression Denial of Service, Catastrophic backtracking
The product uses a regular expression with a worst-case computational complexity that is inefficient and possibly exponential.
Last updated
Overview
CWE-1333 (Inefficient Regular Expression Complexity) is a base-level software weakness catalogued by MITRE in the Common Weakness Enumeration (CWE). It describes a recurring type of mistake that can lead to exploitable security vulnerabilities.
Background
Some regular expression engines have a feature called "backtracking". If the token cannot match, the engine "backtracks" to a position that may result in a different token that can match.
Real-world CVEs
451 recorded CVEs are caused by CWE-1333 (Inefficient Regular Expression Complexity). The highest-severity and most recent are shown first. 133 new CWE-1333 CVEs have been recorded so far in 2026 (81 in 2025).
- CVE-2026-82617
Apache OpenNLP, Apache OpenNLP: ReDoS / stack exhaustion in RegexNameFinderFactory built-in EMAIL and URL patterns
Critical · CVSS 10.0 · EPSS 55th2026-09-11 - CVE-2026-52778
YesWiki has Unsafe eval() in Formula Calculator - Remote Code Execution (RCE) & Denial of Service (DoS)
Critical · CVSS 9.8 · EPSS 56th2026-06-08