Inefficient Algorithmic Complexity in brace-expansion - CVE-2026-102277
Published: November 10, 2026
Vulnerability details
The vulnerability allows a remote attacker to cause temporary denial of service through excessive CPU consumption and memory pressure.
The vulnerability exists due to inefficient algorithmic complexity in the brace-expansion parser when processing {a},b}-shaped patterns, as each rewrite rescans an expanding string. A remote attacker can supply patterns constructed as '{a}' + '}'.repeat(n) + ',z}' to expand(), directly or through minimatch or glob, to trigger quadratic processing time and block the application's event loop.
Affected software
Db2 Developer Extension
How to mitigate CVE-2026-102277
Db2 Developer Extension - update to 1.2.1