nltk is vulnerable to Inefficient Regular Expression Complexity
The product uses a regular expression with an inefficient, possibly exponential worst-case computational complexity that consumes excessive CPU cycles.
| Name | Vendor | Start Version | End Version |
|---|---|---|---|
| Nltk | Nltk | * | 3.6.3 (including) |
| Nltk | Ubuntu | bionic | * |
| Nltk | Ubuntu | devel | * |
| Nltk | Ubuntu | esm-apps/bionic | * |
| Nltk | Ubuntu | esm-apps/focal | * |
| Nltk | Ubuntu | esm-apps/xenial | * |
| Nltk | Ubuntu | focal | * |
| Nltk | Ubuntu | hirsute | * |
| Nltk | Ubuntu | impish | * |
| Nltk | Ubuntu | jammy | * |
| Nltk | Ubuntu | kinetic | * |
| Nltk | Ubuntu | lunar | * |
| Nltk | Ubuntu | mantic | * |
| Nltk | Ubuntu | noble | * |
| Nltk | Ubuntu | oracular | * |
| Nltk | Ubuntu | trusty | * |
| Nltk | Ubuntu | upstream | * |
| Nltk | Ubuntu | xenial | * |
Attackers can create crafted inputs that
intentionally cause the regular expression to use
excessive backtracking in a way that causes the CPU
consumption to spike.