1369 matches found
Inefficient Algorithmic Complexity
Overview vllm is an A high-throughput and memory-efficient inference and serving engine for LLMs Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via Cohere2VisionProcessingInfo.getnumpatches, which forwards a request-controlled mmprocessorkwargs.maxpatches...
GHSA-RG32-VGF9-927C Duplicate Advisory: Quadratic CPU exhaustion in TreebankWordTokenizer.span_tokenize via list.pop(0) in quote-restore loop
Duplicate Advisory This advisory has been withdrawn because it is a duplicate of GHSA-ffr9-mgrr-wcvr. This link is maintained to preserve external references. Original Description NLTK from 3.2.5 before 3.10.4 contains an algorithmic complexity vulnerability in TreebankWordTokenizer.spantokenize...
Duplicate Advisory: Quadratic CPU exhaustion in LegalitySyllableTokenizer.tokenize via unguarded onset reversal loop
Duplicate Advisory This advisory has been withdrawn because it is a duplicate of GHSA-gpwc-27cw-rh9r. This link is maintained to preserve external references. Original Description NLTK from 3.6 before 3.10.4 contains an algorithmic complexity vulnerability in LegalitySyllableTokenizer.tokenize th...
Inefficient Algorithmic Complexity
Overview scapy is a Python-based interactive packet manipulation program and library. Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via BERnumdec and BERcodecOID.dodec in scapy/asn1/ber.py. An attacker can send ASN.1/BER data containing an OID arc encoded...
CVE-2026-126301
NLTK from 3.6 before 3.10.4 contains an algorithmic complexity vulnerability in LegalitySyllableTokenizer.tokenize that allows remote attackers to exhaust CPU by supplying long all-vowel tokens. Attackers can submit a token such as a long run of vowels, causing the unguarded onset reversal loop t...
CVE-2026-126300
NLTK from 3.2.5 before 3.10.4 contains an algorithmic complexity vulnerability in TreebankWordTokenizer.spantokenize that allows remote attackers to cause quadratic CPU consumption through repeated list.pop0 calls. Attackers can submit long runs of double-quote characters to services...
EUVD-2026-125220
NLTK from 3.6 before 3.10.4 contains an algorithmic complexity vulnerability in LegalitySyllableTokenizer.tokenize that allows remote attackers to exhaust CPU by supplying long all-vowel tokens. Attackers can submit a token such as a long run of vowels, causing the unguarded onset reversal loop t...
EUVD-2026-125221
NLTK from 3.2.5 before 3.10.4 contains an algorithmic complexity vulnerability in TreebankWordTokenizer.spantokenize that allows remote attackers to cause quadratic CPU consumption through repeated list.pop0 calls. Attackers can submit long runs of double-quote characters to services...
CVE-2026-126300
NLTK from 3.2.5 before 3.10.4 contains an algorithmic complexity vulnerability in TreebankWordTokenizer.spantokenize that allows remote attackers to cause quadratic CPU consumption through repeated list.pop0 calls. Attackers can submit long runs of double-quote characters to services...
CVE-2026-126301
NLTK from 3.6 before 3.10.4 contains an algorithmic complexity vulnerability in LegalitySyllableTokenizer.tokenize that allows remote attackers to exhaust CPU by supplying long all-vowel tokens. Attackers can submit a token such as a long run of vowels, causing the unguarded onset reversal loop t...
Inefficient Algorithmic Complexity
Overview Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via the matchfuturerelations function when evaluating a CSS selector containing a general-sibling combinator inside :has, such as div:hasa b, against HTML with many sibling elements. When no matching...
Linux Distros Unpatched Vulnerability : CVE-2026-118747
The Linux/Unix host has one or more packages installed that are impacted by a vulnerability without a vendor supplied patch available. - Inefficient algorithmic complexity in .NET allows an unauthorized attacker to deny service over a network. CVE-2026-118747 Note that Nessus relies on the presen...
CVE-2026-126301: nltk: NLTK from 3.6 before 3.10.4 contains an algorithmic complexity vulnerability in LegalitySyllableTokenizer.tokenize that…
NLTK from 3.6 before 3.10.4 contains an algorithmic complexity vulnerability in LegalitySyllableTokenizer.tokenize that allows remote attackers to exhaust CPU by supplying long all-vowel tokens. Attackers can submit a token such as a long run of vowels, causing the unguarded onset reversal loop t...
PT-2026-146631
Name of the Vulnerable Software and Affected Versions NLTK versions 3.2.5 through 3.10.3 Description An algorithmic complexity issue exists in the TreebankWordTokenizer.span tokenize function. The function contains an unguarded processing loop during its quote-restoration step that performs a...
CVE-2026-126300: nltk: NLTK from 3.2.5 before 3.10.4 contains an algorithmic complexity vulnerability in TreebankWordTokenizer.span_tokenize…
NLTK from 3.2.5 before 3.10.4 contains an algorithmic complexity vulnerability in TreebankWordTokenizer.spantokenize that allows remote attackers to cause quadratic CPU consumption through repeated list.pop0 calls. Attackers can submit long runs of double-quote characters to services...
PT-2026-146632
NLTK from 3.6 before 3.10.4 contains an algorithmic complexity vulnerability in LegalitySyllableTokenizer.tokenize that allows remote attackers to exhaust CPU by supplying long all-vowel tokens. Attackers can submit a token such as a long run of vowels, causing the unguarded onset reversal loop t...
Inefficient Algorithmic Complexity
Overview Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via the :has CSS pseudo-class selector in cssmatch.py, which causes quadratic-time matching when processing deeply nested or wide HTML/XML documents. When :has is used with a descendant relative select...
Inefficient Algorithmic Complexity
Overview org.webjars.npm:papaparse is a fast in-browser CSV or delimited text parser for JavaScript. Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via Papa.parse when processing delimiter-free quoted CSV input. An attacker can supply a single-column quoted...
Inefficient Algorithmic Complexity
Overview papaparse is a fast in-browser CSV or delimited text parser for JavaScript. Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via Papa.parse when processing delimiter-free quoted CSV input. An attacker can supply a single-column quoted CSV with no...
EUVD-2026-124377
PapaParse before 5.7.1 contains an inefficient algorithmic complexity vulnerability that allows remote unauthenticated attackers to cause denial of service by submitting delimiter-free quoted CSV input to Papa.parse. Attackers can supply a single-column quoted CSV with no delimiters, triggering...