Security Bulletin: IBM InfoSphere Optim Archive Viewer is affected by a vulnerability in js-yaml (CVE-2026-53550)

Summary A Denial of Service vulnerability in the js-yaml document parsing library CVE-2026-53550 used by IBM InfoSphere Optim Archive Viewer has been addressed by upgrading the component to version 4.3.1. Vulnerability Details CVEID:CVE-2026-53550 DESCRIPTION: js-yaml is a JavaScript YAML parser...

SUSE CVE-2026-77680

An algorithmic complexity flaw exists in libsoup's HTTP Range header processing that persists after the CVE-2025-32907 fix. CVE-2025-32907 addressed memory amplification when a client repeated the same range many times in a single Range header. Commit 9bb92f7a corrected merge correctness in...

CVE-2026-65634

Inefficient algorithmic complexity in the Erlang/OTP asn1 OBJECT IDENTIFIER decoder allows a remote unauthenticated attacker to cause denial of service by sending a crafted OID during the TLS handshake. The BER OID decoder asn1rttber:decsubidentifiers/3 in lib/asn1/src/asn1rttber.erl and the...

ROS-20260921-73-0005

The vulnerability in ElasticSearch is related to algorithmic complexity. Exploiting this vulnerability can allow a remote attacker to cause service interruptions...

ROS-20260921-73-0131

The vulnerability in Golang is related to algorithmic complexity. Exploiting this vulnerability can allow a remote attacker to cause service interruptions...

The vulnerability of the addressparser component in the Nodemailer library, which allows a hacker to trigger a service failure.

The vulnerability of the addressparser component in the Nodemailer email sending library is related to its algorithmic complexity. Exploiting this vulnerability could allow a malicious actor to cause service interruptions...

CVE-2026-63447: Inefficient Algorithmic Complexity

Suricata is a network Intrusion Detection System, Intrusion Prevention System and Network Security Monitoring engine. From 8.0.5 until 8.0.6, the FTP parser in src/app-layer-ftp.c can continue allocating transactions after app-layer.protocols.ftp.max-tx is reached while processing one large chunk...

CVE-2026-44639: Inefficient Algorithmic Complexity

NanoMQ is an MQTT broker. Prior to 0.24.14, NanoMQ's MQTT v5 property decoder in nng/src/supplemental/mqtt/mqttcodec.c uses propertyappend to walk the entire linked list for each property added by decodebufproperties. A remote unauthenticated client can supply a PUBLISH or SUBSCRIBE packet...

CVE-2026-69184: Inefficient Algorithmic Complexity

c-ares is an asynchronous resolver library. Prior to 1.34.7, aresdnsnameparse enforces backward DNS compression pointers but does not bound the total pointer hops or assembled name length. A malicious DNS server can send a response containing a long descending pointer chain and many resource...

SUSE CVE-2026-92365

A vulnerability was found in vllm-project vllm up to 0.29.0. Affected by this issue is some unknown functionality of the file vllm/v1/sample/thinkingbudgetstate.py. The manipulation results in inefficient algorithmic complexity. It is possible to launch the attack remotely. The pull request to fi...

CVE-2026-82760

Inefficient Algorithmic Complexity vulnerability in team-alembic AshAuthentication allows an unauthenticated attacker to exhaust CPU and memory via an oversized base62 segment in a submitted API key. AshAuthentication.Base.decode62/1 in lib/ashauthentication/base.ex splits its argument into one...

EUVD-2026-81478

Inefficient Algorithmic Complexity vulnerability in team-alembic AshAuthentication allows an unauthenticated attacker to exhaust CPU and memory via an oversized base62 segment in a submitted API key. AshAuthentication.Base.decode62/1 in lib/ashauthentication/base.ex splits its argument into one...

unbound: Unbound: Denial of Service via algorithmic complexity attacks on DNSSEC

A flaw was found in Unbound. This vulnerability, termed 'ReTrap', allows a remote attacker to launch algorithmic complexity attacks on the Domain Name System Security Extensions DNSSEC validation process. By serving malicious zones or responses, an attacker can exploit various mechanisms, such as...

CVE-2026-82760: Inefficient Algorithmic Complexity

Inefficient Algorithmic Complexity vulnerability in team-alembic AshAuthentication allows an unauthenticated attacker to exhaust CPU and memory via an oversized base62 segment in a submitted API key. AshAuthentication.Base.decode62/1 in lib/ashauthentication/base.ex splits its argument into one...

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 in the thinkingbudgetstate.py file. An attacker can cause excessive resource consumption by submitting specially...

CVE-2026-92365

A flaw was found in vllm-project vllm. A remote attacker could exploit an algorithmic complexity vulnerability by manipulating unknown functionality within the thinkingbudgetstate.py file. This manipulation results in inefficient algorithmic complexity, which may lead to a Denial of Service DoS,...

CVE-2026-92365

A vulnerability was found in vllm-project vllm up to 0.29.0. Affected by this issue is some unknown functionality of the file vllm/v1/sample/thinkingbudgetstate.py. The manipulation results in inefficient algorithmic complexity. It is possible to launch the attack remotely. The pull request to fi...

CVE-2026-92365

A Denial of Service (DoS) vulnerability exists in vllm-project vllm (up to version 0.29.0). A remote attacker with low privileges can exploit an inefficient algorithmic complexity in the file vllm/v1/sample/thinking_budget_state.py, degrading service availability for legitimate users. The specifi...

EUVD-2026-80771

A vulnerability was found in vllm-project vllm up to 0.29.0. Affected by this issue is some unknown functionality of the file vllm/v1/sample/thinkingbudgetstate.py. The manipulation results in inefficient algorithmic complexity. It is possible to launch the attack remotely. The pull request to fi...

CVE-2026-92365 vllm-project vllm thinking_budget_state.py algorithmic complexity

A vulnerability was found in vllm-project vllm up to 0.29.0. Affected by this issue is some unknown functionality of the file vllm/v1/sample/thinkingbudgetstate.py. The manipulation results in inefficient algorithmic complexity. It is possible to launch the attack remotely. The pull request to fi...