Raw vector
CVSS:3.1/AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:HCVSS and EPSS are reproduced from their sources (NVD, FIRST EPSS). Risk Priority is our own derived reading, not an NVD score.
Summary
CVE-2026-27903 is a high-severity Inefficient Algorithmic Complexity (CWE-407) vulnerability in Minimatch Project Minimatch. Its CVSS base score is 7.5 (High).
Operationally, exploitation aligns with the MITRE ATT&CK technique Endpoint Denial of Service (T1499); ranked at the 42th percentile by exploit likelihood (below the median); it is not currently listed in the CISA KEV catalog; a public proof-of-concept is referenced.
The strongest mitigations our analysis identified map to SC-5 (Denial-of-service Protection) and SC-6 (Resource Availability) — see the control section below for these in your framework.
Deeper analysis AI-assisted summary
Synthesised by an AI model from the NVD description and linked references — a reading aid, not an authoritative source.
CVE-2026-27903 is a regular expression denial-of-service (ReDoS) vulnerability in minimatch, a minimal matching utility for converting glob expressions into JavaScript RegExp objects. The issue affects minimatch versions prior to 10.2.3, 9.0.7, 8.0.6, 7.4.8, 6.2.2, 5.1.8, 4.2.5, and 3.1.3. Specifically, the `matchOne()` function performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR) segments and the input path does not match, resulting in O(C(n, k)) binomial time complexity, where n is the number of path segments and k is the number of globstars. For example, with k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds, and with k=13, it exceeds 15 seconds, as no memoization or call budget bounds this behavior.
Any application where an attacker can influence the glob pattern passed to minimatch is vulnerable, including build tools and task runners like ESLint, Webpack, and Rollup that accept user-supplied glob arguments; multi-tenant systems where one tenant configures glob-based rules in a shared process; admin or developer interfaces accepting ignore-rule or filter configurations as globs; and CI/CD pipelines evaluating user-submitted config files with glob patterns. An attacker can supply a crafted 56-byte pattern to cause a 5-second stall per invocation, potentially stalling the Node.js event loop for tens of seconds without authentication if pattern input is part of the feature.
The GitHub Security Advisory (GHSA-7r86-cg39-jmmj) confirms that minimatch 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.3 address the issue. Security practitioners should upgrade to these patched versions in affected applications and review dependencies for vulnerable minimatch instances, particularly in Node.js-based tools handling user-controlled globs. The vulnerability has a CVSS v3.1 base score of 7.5 (AV:N/AC:L/PR:N/UI:N/S:U/C:N/I:N/A:H).
EU & UK References
- 🇪🇺 ENISA EUVD: EUVD-2026-8801
Vulnerability Data
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.3, `matchOne()` performs unbounded recursive backtracking when a glob pattern contains multiple non-adjacent `**` (GLOBSTAR)…
more
segments and the input path does not match. The time complexity is O(C(n, k)) -- binomial -- where `n` is the number of path segments and `k` is the number of globstars. With k=11 and n=30, a call to the default `minimatch()` API stalls for roughly 5 seconds. With k=13, it exceeds 15 seconds. No memoization or call budget exists to bound this behavior. Any application where an attacker can influence the glob pattern passed to `minimatch()` is vulnerable. The realistic attack surface includes build tools and task runners that accept user-supplied glob arguments (ESLint, Webpack, Rollup config), multi-tenant systems where one tenant configures glob-based rules that run in a shared process, admin or developer interfaces that accept ignore-rule or filter configuration as globs, and CI/CD pipelines that evaluate user-submitted config files containing glob patterns. An attacker who can place a crafted pattern into any of these paths can stall the Node.js event loop for tens of seconds per invocation. The pattern is 56 bytes for a 5-second stall and does not require authentication in contexts where pattern input is part of the feature. 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.3 fix the issue.
- CWE(s)
Related Threats
MITRE ATT&CK Enterprise Techniques
CVEs Like This One
Affected Assets
Mitigating Controls
Control response
—
—
—
V1.2.9
Mitigating Controls (NIST 800-53 r5) AI
Denial-of-service protection directly reduces the impact of resource exhaustion triggered by worst-case algorithmic inputs.
Resource availability allocation limits blast radius when an inefficient algorithm is forced into its worst case.
Mitigating Controls (NIST CSF 2.0) AI
Derived directly from the weakness types (CWEs) cited in the NVD entry via our AI-authored CWE→CSF cross-walk (authority under review) — links open the control.
Secure SDLC practices (code review, complexity analysis, safe algorithm selection) prevent introduction of exploitable worst-case behavior.
Runtime monitoring of software and resources can detect the performance impact of triggered worst-case complexity.
Identifying and recording algorithmic-complexity vulnerabilities directly addresses the root cause before exploitation.
Mitigating Controls (ISO/IEC 27001:2022 Annex A) AI
Derived directly from the weakness types (CWEs) cited in the NVD entry via our AI-authored CWE→ISO cross-walk (authority under review) — links open the control.
Security testing can uncover performance issues stemming from algorithmic complexity.
Redundancy of processing facilities can absorb resource exhaustion from inefficient algorithms.
Monitoring activities can identify anomalous resource consumption indicative of algorithmic complexity attacks.
Secure development life cycle includes design reviews that can catch inefficient algorithms before deployment.
Secure system architecture principles encourage selection of algorithms with acceptable worst-case complexity.
Secure coding practices can include guidelines to avoid or mitigate inefficient algorithms.