SB20261111196 - Inefficient Algorithmic Complexity in minimatch

CSH
CYBERSECURITY HELP
Sign In REGISTER

Main Vulnerability Database SB20261111196

SB20261111196 - Inefficient Algorithmic Complexity in minimatch

Published: November 11, 2026

Security Bulletin ID SB20261111196
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: N/A)

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 a denial of service through excessive CPU consumption during pattern compilation.

The vulnerability exists due to inefficient algorithmic complexity in minimatch's mergeRows() function when compiling uncached patterns, as entire rows are repeatedly copied and joined for each wildcard position. A remote attacker can supply long patterns containing wildcard-only path parts separated by /, optionally preceded by a brace group of distinct words, to trigger quadratic compilation work and block applications that compile these patterns.


Remediation

Install update from vendor's website.

References