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

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

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

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

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

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

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

CVE-2026-85501

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

CVE-2026-85501

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

UBUNTU-CVE-2026-85501

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

CVE-2026-85501 Retrap: Novel Vulnerabilities to launch Algorithmic Complexity Attacks on DNSSEC

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

CVE-2026-85501

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

CVE-2026-85501

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

CVE-2026-85501 Retrap: Novel Vulnerabilities to launch Algorithmic Complexity Attacks on DNSSEC

Novel vulnerabilities to launch algorithmic complexity attacks on DNSSEC have been researched under the term 'ReTrap'. These result in degradation of service when malicious zones are used to serve the algorithmic complexity vulnerabilities. NLnet Labs Unbound up to and including 1.26.0 is...

CVE-2026-85501

The NLnet Labs Unbound DNS resolver (versions up to and including 1.26.0 ) is vulnerable to algorithmic complexity attacks on DNSSEC, collectively referred to as 'ReTrap' . These vulnerabilities, including TagTrap , DelegationTrap , NsecTrap , and AdditionalTrap , allow attackers to cause degrada...

CVE-2026-19668: Inefficient Algorithmic Complexity

A BIND recursive resolver may experience excessive resource consumption if it encounters large numbers of a particular kind of invalid DNSSEC record. Default limits on "max-records-per-type" and "max-types-per-name" help mitigate the exposure. This issue affects BIND 9 versions 9.11.0 through...