Inefficient Regular Expression Complexity in nltk
Default status is the baseline for the product, each version can override it (e.g. patched versions marked unaffected).
| Vendor | Product | Default status | Versions | ||||||
|---|---|---|---|---|---|---|---|---|---|
| nltk | nltk | affected |
|
No data.
No data available yet.
| Source | ID | Title |
|---|---|---|
EUVD |
EUVD-2021-0148 | NLTK (Natural Language Toolkit) is a suite of open source Python modules, data sets, and tutorials supporting research and development in Natural Language Processing. Versions prior to 3.6.5 are vulnerable to regular expression denial of service (ReDoS) attacks. The vulnerability is present in PunktSentenceTokenizer, sent_tokenize and word_tokenize. Any users of this class, or these two functions, are vulnerable to the ReDoS attack. In short, a specifically crafted long input to any of these vulnerable functions will cause them to take a significant amount of execution time. If your program relies on any of the vulnerable functions for tokenizing unpredictable user input, then we would strongly recommend upgrading to a version of NLTK without the vulnerability. For users unable to upgrade the execution time can be bounded by limiting the maximum length of an input to any of the vulnerable functions. Our recommendation is to implement such a limit. |
Github GHSA |
GHSA-f8m6-h2c7-8h9x | Inefficient Regular Expression Complexity in nltk (word_tokenize, sent_tokenize) |
Ubuntu USN |
USN-7365-1 | NLTK vulnerabilities |
No CVSS v4.0
No CVSS v3.0
This CVE is not in the KEV list.
Exploit prediction score: 2.8% (2.790% probability within 30 days)
Key SSVC decision points have not yet been added.
No history.