CVEvulnerability
CVE-2026-108529
8.7 HIGH
Official page ↗
- Status
- Awaiting Analysis
- Published
- 2026-10-26
- Last modified
- 2026-10-26
- Assigner
- 6b3ad84c-e1a6-4bf7-a703-f496b71e49db
- CVSS 4.0 (6b3ad84c-e1a6-4bf7-a703-f496b71e49db)
- 8.7 HIGH — CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:H/SC:N/SI:N/SA:N/E:X/CR:X/IR:X/AR:X/MAV:X/MAC:X/MAT:X/MPR:X/MUI:X/MVC:X/MVI:X/MVA:X/MSC:X/MSI:X/MSA:X/S:X/AU:X/R:X/V:X/RE:X/U:X
- Weaknesses
- CWE-407
Description
Inefficient Algorithmic Complexity vulnerability in the HTTP/2 implementation of mtrudel bandit allows an unauthenticated remote attacker to exhaust server CPU via small SETTINGS or connection-level WINDOW_UPDATE frames. The attacker opens thousands of streams whose responses block on the connection send window, then sends cheap frames that each make the server walk the whole queue of blocked sends. In the reporter's run, with 3,000 blocked streams a single 9-byte SETTINGS frame took 133 ms to process.
do_pending_sends/2 in lib/bandit/http2/connection.ex retries every queued send and, before each retry, removes that entry from the queue with List.delete/2, so one frame costs O(n²) list operations for n blocked streams. max_concurrent_streams defaults to :infinity, so the attacker chooses n.
This issue affects bandit: from 0.3.4 before 1.14.0.
Related
Weakness · CWE (1)
- CWE-407 Inefficient Algorithmic Complexity weakness
References
- https://cna.erlef.org/cves/CVE-2026-108529.html cna.erlef.org
- https://github.com/mtrudel/bandit/commit/220b9dfd27f9a21305be2afc75cbe585ddc24e7a github.com
- https://github.com/mtrudel/bandit/commit/6feadb31189d18b7dcda6c663112cd3bbaf63a46 github.com
- https://github.com/mtrudel/bandit/security/advisories/GHSA-j363-h72p-296m github.com
- https://osv.dev/vulnerability/EEF-CVE-2026-108529 osv.dev