SB20261110261 - Inefficient Algorithmic Complexity in brace-expansion

CSH
CYBERSECURITY HELP
Sign In REGISTER

Main Vulnerability Database SB20261110261

SB20261110261 - Inefficient Algorithmic Complexity in brace-expansion

Published: November 10, 2026

Security Bulletin ID SB20261110261
CSH Severity
Medium
Patch available
YES
Number of vulnerabilities 1
Exploitation vector Remote access
Highest impact Partial DoS

Breakdown by Severity

Medium 100%
  • Low
  • Medium
  • High
  • Critical

Description

This security bulletin contains information about 1 vulnerability.


1) Inefficient Algorithmic Complexity (CVE-ID: CVE-2026-102277)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: 6.9 [CVSS:4.0/AV:N/AC:L/AT:N/PR:N/UI:N/VC:N/VI:N/VA:L/SC:N/SI:N/SA:N]


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.


Remediation

Install update from vendor's website.

References