Lucene search
+L

1369 matches found

Snyk
Snyk
•added 2026/11/13 12:48 p.m.•10 views

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...

8.7CVSS5.9AI score0.00464EPSS
SaveExploits0References3
osv_ghsa
osv_ghsa
•added 2026/11/13 12:31 p.m.•12 views

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...

6.9CVSS6AI score0.00522EPSS
SaveExploits0References3
Github Security Blog
Github Security Blog
•added 2026/11/13 12:31 p.m.•7 views

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...

6.9CVSS6AI score0.00574EPSS
SaveExploits0References4Affected Software1
Snyk
Snyk
•added 2026/11/13 10:47 a.m.•10 views

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...

6.9CVSS5.8AI score0.00508EPSS
SaveExploits0References2
NVD
NVD
•added 2026/11/13 10:17 a.m.•9 views

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...

6.9CVSS0.00574EPSS
SaveExploits0References2
NVD
NVD
•added 2026/11/13 10:17 a.m.•7 views

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...

6.9CVSS0.00522EPSS
SaveExploits0References2
EUVD
EUVD
•added 2026/11/13 9:36 a.m.•10 views

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...

6.9CVSS6AI score0.00574EPSS
SaveExploits0References2
EUVD
EUVD
•added 2026/11/13 9:36 a.m.•9 views

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...

6.9CVSS5.9AI score0.00522EPSS
SaveExploits0References2
Mend
Mend
•added 2026/11/13 9:36 a.m.•8 views

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...

6.9CVSS5.9AI score0.00522EPSS
SaveExploits0References8
Mend
Mend
•added 2026/11/13 9:36 a.m.•7 views

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...

6.9CVSS6AI score0.00574EPSS
SaveExploits0References9
Snyk
Snyk
•added 2026/11/13 12:45 a.m.•7 views

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...

6.3CVSS5.9AI score0.00477EPSS
SaveExploits0References2
Tenable Nessus
Tenable Nessus
•added 2026/11/13 12:00 a.m.•9 views

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...

7.5CVSS6.1AI score0.013EPSS
SaveExploits0References2
Rapid7 Vulnerability Database (full)
Rapid7 Vulnerability Database (full)
•added 2026/11/13 12:00 a.m.•11 views

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...

6.9CVSS6AI score0.00574EPSS
SaveExploits0References2
Positive Technologies
Positive Technologies
•added 2026/11/13 12:00 a.m.•11 views

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...

6.9CVSS5.9AI score0.00522EPSS
SaveExploits0References8
Rapid7 Vulnerability Database (full)
Rapid7 Vulnerability Database (full)
•added 2026/11/13 12:00 a.m.•5 views

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...

6.9CVSS6AI score0.00522EPSS
SaveExploits0References2
Positive Technologies
Positive Technologies
•added 2026/11/13 12:00 a.m.•11 views

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...

6.9CVSS6AI score0.00574EPSS
SaveExploits0References3
Snyk
Snyk
•added 2026/11/12 6:51 p.m.•11 views

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...

6.9CVSS5.9AI score0.00454EPSS
SaveExploits0References2
Snyk
Snyk
•added 2026/11/12 2:51 p.m.•5 views

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...

8.7CVSS6AI score0.00678EPSS
SaveExploits0References2
Snyk
Snyk
•added 2026/11/12 2:51 p.m.•5 views

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...

8.7CVSS6AI score0.00678EPSS
SaveExploits0References2
EUVD
EUVD
•added 2026/11/12 12:39 p.m.•12 views

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...

8.7CVSS5.9AI score0.00678EPSS
SaveExploits0References3
Rows per page
Query Builder