SB20261112126 - Inefficient Algorithmic Complexity in brace-expansion

CSH
CYBERSECURITY HELP
Sign In REGISTER

Main Vulnerability Database SB20261112126

SB20261112126 - Inefficient Algorithmic Complexity in brace-expansion

Published: November 12, 2026

Security Bulletin ID SB20261112126
CSH Severity
Medium
Patch available
YES
Number of vulnerabilities 1
Exploitation vector Remote access
Highest impact Denial of service

Breakdown by Severity

Medium 100%
  • Low
  • Medium
  • High
  • Critical

Description

This security bulletin contains information about 1 vulnerability.


1) Inefficient Algorithmic Complexity (CVE-ID: N/A)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: 8.7 [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]


The vulnerability allows a remote attacker to cause a denial of service by exhausting CPU resources and blocking an application's event loop for minutes.

The vulnerability exists due to inefficient algorithmic complexity in brace-expansion's expand() function when processing untrusted patterns, including repeated scans, excessive intermediate expansion, quadratic regular expression backtracking, and unbounded visits to discarded results. A remote attacker can supply crafted brace patterns directly or through minimatch or glob to trigger excessive processing despite existing expansion limits and stall the application.


Remediation

Install update from vendor's website.

References