1369 matches found
Inefficient Algorithmic Complexity
Overview Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity via the TagList.add method in CBORParser. An attacker can send a CBOR value preceded by a long run of tags, causing repeated fixed-increment array growth and copying that consumes quadratic CPU and...
DEBIAN-CVE-2026-106554
One CBOR-parsing issue in jackson-dataformats-binary's CBOR module: an unbounded run of CBOR tags drives quadratic-time TagList growth CPU/GC-exhaustion DoS, PoC-proven. PoC executed against com.fasterxml.jackson.dataformat:jackson-dataformat-cbor:2.18.2; present in current 2.x and 3.x...
CVE-2026-106554
A vulnerability in jackson-dataformat-cbor (specifically the CBOR module) allows for an algorithmic-complexity denial of service (CWE-407) . The CBORParser.java file handles semantic tags by accumulating them in a TagList that grows by a fixed increment (+8) instead of doubling. An attacker can p...
PT-2026-137020
Name of the Vulnerable Software and Affected Versions jackson-dataformats-binary versions 2.x and 3.x Description A denial of service issue exists in the CBOR module of jackson-dataformats-binary due to an algorithmic complexity flaw. The CBORParser.java file handles CBOR tags using a TagList who...
UBUNTU-CVE-2026-106554
One CBOR-parsing issue in jackson-dataformats-binary's CBOR module: an unbounded run of CBOR tags drives quadratic-time TagList growth CPU/GC-exhaustion DoS, PoC-proven. PoC executed against com.fasterxml.jackson.dataformat:jackson-dataformat-cbor:2.18.2; present in current 2.x and 3.x...
CVE-2026-106554
One CBOR-parsing issue in jackson-dataformats-binary's CBOR module: an unbounded run of CBOR tags drives quadratic-time TagList growth CPU/GC-exhaustion DoS, PoC-proven. PoC executed against com.fasterxml.jackson.dataformat:jackson-dataformat-cbor:2.18.2; present in current 2.x and 3.x...
Security update for python-pypdf (moderate)
openSUSE security update: security update for python-pypdf ------------------------------------------------------------- Announcement ID: openSUSE-SU-2026:22219-1 Rating: moderate References: bsc1288941 bsc1288942 bsc1288943 bsc1288944 bsc1288950 bsc1288951 bsc1288952 Cross-References:...
Inefficient Algorithmic Complexity
Overview Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity in the parselink method in inlineparser.py, via the parselinktext and containsnestedlink helpers. An attacker can cause quadratic CPU growth by submitting Markdown containing a long run of balanced...
CVE-2026-121444 svg-sanitizer 0.11.0 before 1.1.0 Algorithmic Complexity DoS via use Reference Graph
svg-sanitizer from 0.11.0 before 1.1.0 contains an algorithmic complexity denial of service vulnerability in hasInfiniteLoop and countUse of the use reference-graph analysis. Attackers can upload a small layered SVG with 15 levels of fanned-out use elements, forcing exponential path enumeration...
EUVD-2026-115866
svg-sanitizer from 0.11.0 before 1.1.0 contains an algorithmic complexity denial of service vulnerability in hasInfiniteLoop and countUse of the use reference-graph analysis. Attackers can upload a small layered SVG with 15 levels of fanned-out use elements, forcing exponential path enumeration...
CVE-2026-121444 svg-sanitizer 0.11.0 before 1.1.0 Algorithmic Complexity DoS via use Reference Graph
svg-sanitizer from 0.11.0 before 1.1.0 contains an algorithmic complexity denial of service vulnerability in hasInfiniteLoop and countUse of the use reference-graph analysis. Attackers can upload a small layered SVG with 15 levels of fanned-out use elements, forcing exponential path enumeration...
CVE-2026-121444
The svg-sanitizer library (versions 0.11.0 before 1.1.0 ) is vulnerable to an algorithmic complexity denial of service (DoS) . The flaw exists within the hasInfiniteLoop() and countUse() functions during use reference-graph analysis . An attacker can exploit this by uploading a small, layered SVG...
pyasn1 Decode DoS
The vulnerability in the decode function of the ASN.1 library pyasn1 in Python is related to algorithmic complexity. Exploitation of this vulnerability may allow a remote attacker to cause a denial of service...
CVE-2026-121444: darylldoyle svg-sanitizer: svg-sanitizer from 0.11.0 before 1.1.0 contains an algorithmic complexity denial of service vulnerability in…
svg-sanitizer from 0.11.0 before 1.1.0 contains an algorithmic complexity denial of service vulnerability in hasInfiniteLoop and countUse of the use reference-graph analysis. Attackers can upload a small layered SVG with 15 levels of fanned-out use elements, forcing exponential path enumeration...
OPENSUSE-SU-2026:22219-1 Security update for python-pypdf
This update for python-pypdf fixes the following issues: Changes in python-pypdf: - CVE-2026-119209: negative /Index values and multiplied xref streams can lead to clamp bypass and server memory exhaustion bsc1288950 - CVE-2026-119208: trusting forged /Count values in encrypted PDF page trees can...
Astra Linux - vulnerability in libsoup3
There is an algorithmic complexity flaw in libsoup’s handling of HTTP Range headers that persists even after the CVE-2025-32907 fix. CVE-2025-32907 addresses memory amplification when a client repeats the same range multiple times within a single Range header. Commit 9bb92f7a corrected merge logi...
Security Bulletin: Vulnerability in linkify-it affects IBM watsonx Assistant Cartridge and IBM watsonx Orchestrate with watsonx Assistant Cartridge.
Summary Potential vulnerability in linkify-it has been identified that affects IBM watsonx Assistant Cartridge and IBM watsonx Orchestrate with watsonx Assistant Cartridge - Assistant Builder Component. . The vulnerability have been addressed. Refer to details for additional information...
SUSE CVE-2019-25781
Python-Markdown 3.0 through 3.11.2 contains an algorithmic complexity vulnerability in inline link parsing that allows remote attackers to exhaust CPU through unmatched brackets. Attackers can submit short Markdown containing repeated or ! characters, forcing LinkInlineProcessor.getText and getLi...
CVE-2019-25781
Python-Markdown 3.0 through 3.11.2 contains an algorithmic complexity vulnerability in inline link parsing that allows remote attackers to exhaust CPU through unmatched brackets. Attackers can submit short Markdown containing repeated or ! characters, forcing LinkInlineProcessor.getText and getLi...
Inefficient Algorithmic Complexity
Overview Affected versions of this package are vulnerable to Inefficient Algorithmic Complexity in the BitStringPayloadDecoder class in pyasn1/codec/ber/decoder.py. An attacker can exhaust CPU during a decode call by supplying a constructed BIT STRING with many fragments, because each fragment...