CVE-2026-80205

NLTK before 3.10.0 ReDoS via Text.findall() unvalidated regex

Published Aug 26, 2026 CVSS 4.0 · 8.7 High EPSS < 1% KEV · Not listed
Description
NLTK versions before 3.10.0 contain a regular expression denial of service vulnerability in Text.findall() and TokenSearcher.findall() methods that accept user-supplied regular expressions without validation or timeout. Attackers can supply crafted regex patterns that cause catastrophic backtracking, resulting in indefinite CPU saturation and denial of service to all users of the Python process.

Analysis

AI-generated

Technical impact

NLTK library versions earlier than 3.10.0 contain a regular expression denial of service (ReDoS) vulnerability (CWE-1333) in the Text.findall() and TokenSearcher.findall() methods. These methods accept arbitrary regular expressions supplied by the user without validation or a timeout. When an attacker supplies a complex or malicious regex pattern, the engine performs catastrophic backtracking, leading to prolonged or indefinite CPU usage and ultimately a denial of service for the entire Python process.

Affected Systems

Any deployment that includes the NLTK library before version 3.10.0 is affected. This includes Python scripts, web applications, data processing pipelines, or any service that utilizes NLTK’s Text module. All environments running Python with an impacted NLTK version are potentially vulnerable.

Risk and Exploitability

The CVSS score of 8.7 indicates high severity. No EPSS score is available, leaving exploitation probability uncertain. The vulnerability is not listed in the CISA KEV catalog. An attacker must supply a crafted regex; therefore the attack vector is local or any interface that feeds user‑controlled text into NLTK’s findall functionality. Because the flaw causes CPU exhaustion, compromising service availability is straightforward once a complex pattern is executed, but no privilege escalation occurs.

Remediation

No solution or workaround provided in the CVE record.

OpenCVE Recommended Actions

  • Update the NLTK library to version 3.10.0 or later to apply the official fix.
  • If an upgrade cannot be performed immediately, implement input validation to reject or sanitize complex regular expressions before they are passed to Text.findall() or TokenSearcher.findall().
  • As a temporary mitigation, execute NLTK regex operations in a separate process with CPU or time limits, or use a timeout wrapper to prevent excessive resource consumption.

Generated by OpenCVE AI on August 26, 2026 at 11:50 UTC.

Tracking

Sign in to view the affected projects.

Advisories

Source ID Title
Github GHSA Github GHSA GHSA-rrv8-h7p8-rx55 NLTK: ReDoS in nltk.text.Text.findall() via unvalidated user-supplied regular expressions
History
Type Values Removed Values Added
Metrics ssvc

{'options': {'Automatable': 'yes', 'Exploitation': 'none', 'Technical Impact': 'partial'}, 'version': '2.0.3'}

Type Values Removed Values Added
Description NLTK versions before 3.10.0 contain a regular expression denial of service vulnerability in Text.findall() and TokenSearcher.findall() methods that accept user-supplied regular expressions without validation or timeout. Attackers can supply crafted regex patterns that cause catastrophic backtracking, resulting in indefinite CPU saturation and denial of service to all users of the Python process.
Title NLTK before 3.10.0 ReDoS via Text.findall() unvalidated regex
First Time appeared Nltk
Nltk nltk
Weaknesses CWE-1333
CPEs cpe:2.3:a:nltk:nltk:*:*:*:*:*:*:*:*
Vendors & Products Nltk
Nltk nltk
References
Metrics cvssV3_1

{'score': 7.5, 'vector': 'CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H'}

cvssV4_0

{'score': 8.7, 'vector': 'CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N'}

Weaknesses
  • CWE-1333

    Inefficient Regular Expression Complexity

Sources

Status
PUBLISHED
Assigner
VulnCheck
Published
Updated
Sep 1, 2026, 10:06 PM
Reserved
Aug 25, 2026, 11:15 PM
Status
Modified
Published
Aug 26, 2026, 11:16 AM
Modified
Sep 3, 2026, 5:15 AM
Severity
Important
Public date
Aug 26, 2026, 10:28 AM