7.5
CVE-2026-27904
- EPSS 0.02%
- Veröffentlicht 26.02.2026 01:07:42
- Zuletzt bearbeitet 27.02.2026 17:16:23
- Quelle security-advisories@github.com
- CVE-Watchlists
- Unerledigt
minimatch is a minimal matching utility for converting glob expressions into JavaScript RegExp objects. Prior to version 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.4, nested `*()` extglobs produce regexps with nested unbounded quantifiers (e.g. `(?:(?:a|b)*)*`), which exhibit catastrophic backtracking in V8. With a 12-byte pattern `*(*(*(a|b)))` and an 18-byte non-matching input, `minimatch()` stalls for over 7 seconds. Adding a single nesting level or a few input characters pushes this to minutes. This is the most severe finding: it is triggered by the default `minimatch()` API with no special options, and the minimum viable pattern is only 12 bytes. The same issue affects `+()` extglobs equally. Versions 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.4 fix the issue.
Daten sind bereitgestellt durch National Vulnerability Database (NVD)
Minimatch Project ≫ Minimatch SwPlatformnode.js Version < 3.1.4
Minimatch Project ≫ Minimatch SwPlatformnode.js Version >= 4.0.0 < 4.2.5
Minimatch Project ≫ Minimatch SwPlatformnode.js Version >= 5.0.0 < 5.1.8
Minimatch Project ≫ Minimatch SwPlatformnode.js Version >= 6.0.0 < 6.2.2
Minimatch Project ≫ Minimatch SwPlatformnode.js Version >= 7.0.0 < 7.4.8
Minimatch Project ≫ Minimatch SwPlatformnode.js Version >= 8.0.0 < 8.0.6
Minimatch Project ≫ Minimatch SwPlatformnode.js Version >= 9.0.0 < 9.0.7
Minimatch Project ≫ Minimatch SwPlatformnode.js Version >= 10.0.0 < 10.2.3
| Typ | Quelle | Score | Percentile |
|---|---|---|---|
| EPSS | FIRST.org | 0.02% | 0.046 |
| Quelle | Base Score | Exploit Score | Impact Score | Vector String |
|---|---|---|---|---|
| security-advisories@github.com | 7.5 | 3.9 | 3.6 |
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H
|
CWE-1333 Inefficient Regular Expression Complexity
The product uses a regular expression with an inefficient, possibly exponential worst-case computational complexity that consumes excessive CPU cycles.