SB20260629111 - Inefficient Algorithmic Complexity in brace-expansion

CSH
CYBERSECURITY HELP
Sign In REGISTER

Main Vulnerability Database SB20260629111

SB20260629111 - Inefficient Algorithmic Complexity in brace-expansion

Published: June 29, 2026

Security Bulletin ID SB20260629111
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-13149)

CWE-ID: CWE-407 - Inefficient Algorithmic Complexity

CVSSv4: 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/E:U/U:Green


The vulnerability allows a remote attacker to cause a denial of service.

The vulnerability exists due to inefficient algorithmic complexity in expand() when processing attacker-influenced brace expansion patterns containing consecutive non-expanding {} groups. A remote attacker can send a specially crafted input string to cause a denial of service.

The issue can block the calling thread for minutes or indefinitely with a small all-ASCII input, and applications using Node's single-threaded event loop may fully stall a worker or process.


Remediation

Install update from vendor's website.

References