1330 matches found
CVE-2026-130465
A large loop in the Ascend file parser of Wireshark (versions 4.6.0 to 4.6.9 and 4.4.0 to 4.4.19 ) results in Inefficient Algorithmic Complexity (CWE-407). This vulnerability allows for a denial of service (DoS). While the CVSS vector indicates a local attack vector with high complexity and requi...
CVE-2026-130462
The Wireshark network protocol analyzer is affected by multiple protocol dissector and file parser hangs in versions 4.6.0 to 4.6.9 and 4.4.0 to 4.4.19 . The root cause is identified as Inefficient Algorithmic Complexity (CWE-407), which can lead to a denial of service (DoS) condition. Exploitati...
CVE-2026-130459
The Tektronix K12xx file parser in Wireshark versions 4.6.0 to 4.6.9 and 4.4.0 to 4.4.19 contains a large loop that leads to Inefficient Algorithmic Complexity (CWE-407). This vulnerability allows for a denial of service (DoS) impact. No specific remediation or exploit details are provided in the...
CVE-2026-77680-Security-Analysis
OYEKANMI OLUWATUNMISE JOSEPH RUN/CYB/23/15421 CVE-2026-77680 — Security Analysis Assessment: Medium severity · CVSS v3.1: 5.3 · Primary impact: Availability CPU exhaustion / denial of service This repository documents the technical behavior, risk, remediation, and a Cyber Kill Chain mapping for...
CVE-2026-6042-PoC
CVE-2026-6042: Algorithmic Complexity DoS in musl libc iconv Gap-skipping loops in musl's iconv GB18030 4-byte decoder allow a small crafted input to consume disproportionate CPU time. A 40 KB adversarial payload can pin a CPU core for over 40 minutes. Advisory :...
CVE-2026-117678 idna: punycode labels are decoded before the 63-octet length check, so a long xn-- label causes super-linear CPU use
Inefficient Algorithmic Complexity vulnerability in benoitc idna allows an attacker who controls a hostname passed to the library to exhaust CPU via an over-long xn-- label. idna:ulabel/1 in src/idna.erl hands every ASCII label that starts with xn-- to punycode:decode/1 without applying...
CVE-2026-117678
Inefficient Algorithmic Complexity vulnerability in benoitc idna allows an attacker who controls a hostname passed to the library to exhaust CPU via an over-long xn-- label. idna:ulabel/1 in src/idna.erl hands every ASCII label that starts with xn-- to punycode:decode/1 without applying...
EUVD-2026-129475
Inefficient Algorithmic Complexity vulnerability in benoitc idna allows an attacker who controls a hostname passed to the library to exhaust CPU via an over-long xn-- label. idna:ulabel/1 in src/idna.erl hands every ASCII label that starts with xn-- to punycode:decode/1 without applying...
EEF-CVE-2026-117678 idna: punycode labels are decoded before the 63-octet length check, so a long xn-- label causes super-linear CPU use
Summary Inefficient Algorithmic Complexity vulnerability in benoitc idna allows an attacker who controls a hostname passed to the library to exhaust CPU via an over-long xn-- label. idna:ulabel/1 in src/idna.erl hands every ASCII label that starts with xn-- to punycode:decode/1 without applying...
CVE-2026-117678
The benoitc idna library (versions 0.5.0 through 7.9.0 ) is vulnerable to an Inefficient Algorithmic Complexity vulnerability (CWE-407). The root cause is that the ulabel/1 function in src/idna.erl passes ASCII labels starting with xn-- to punycode:decode/1 without first verifying the 63-octet DN...
CVE-2026-117678
Inefficient Algorithmic Complexity vulnerability in benoitc idna allow...
PT-2026-151878
Summary SeekableUnicodeStreamReader.readline in nltk/data.py assembles a line by repeatedly reading a block, appending it to a growing chars buffer, and recomputing chars.splitlinesTrue over the entire buffer on every loop iteration. The read block size doubles only until it caps at 8000...
CVE-2026-129307 eml_parser: Algorithmic-complexity DoS (O(n^4) regex backtracking) in Received-header parsing
emlparser serves as a python module for parsing eml files and returning various information found in the e-mail as well as computed information. In 3.0.3 and earlier, emlparser.routing.parserouting in emlparser/routing.py builds a regular expression with multiple greedy capture groups and appends...
CVE-2026-129307
The eml_parser Python module (version 3.0.3 and earlier) is vulnerable to a Denial of Service (DoS) attack due to algorithmic complexity in the Received-header parsing logic. Specifically, the eml_parser.routing.parserouting() function in eml_parser/routing.py constructs a regular expression with...
Inefficient Algorithmic Complexity
Overview nltk is a Natural Language Toolkit NLTK is a Python package for natural language processing. Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via ConllCorpusReader.getsrlinstances in nltk/corpus/reader/conll.py. For a sentence block with P predicates...
Inefficient Algorithmic Complexity
Overview @sveltejs/kit is a SvelteKit framework and CLI Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via the convertformdata and handleissues functions in the remote form parsing pipeline, which call FormData.getAll for each unique field name, resulting i...
Inefficient Algorithmic Complexity
Overview nltk is a Natural Language Toolkit NLTK is a Python package for natural language processing. Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via LegalitySyllableTokenizer.tokenize in nltk/tokenize/legalityprinciple.py, which contains an unguarded On...
Inefficient Algorithmic Complexity
Overview nltk is a Natural Language Toolkit NLTK is a Python package for natural language processing. Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via TreebankWordTokenizer.spantokenize in nltk/tokenize/treebank.py, which contains an unguarded On²...
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...
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...