Resource exhaustion in NetBSD
CVE-2017-1000378
The NetBSD qsort() function is recursive, and not randomized, an attacker can construct a pathological input array of N elements that causes qsort() to deterministically recurse N/4 times. This allows attackers to consume arbitrary amounts of stack memory and manipulate stack memory to assist in arbitrary code execution attacks. This affects NetBSD 7.1 and possibly earlier versions.
Vulnerability class: DoS (Denial of Service)
Published · last modified .
CVSS v3 metric
CVSS v3 base score 9.8 (Critical). Vector: CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H.
EPSS exploit prediction
EPSS: 0.041 (90.4th percentile), scored .
Low probability of exploitation in the next 30 days, but still tracked. 90th percentile — 90.4% of CVEs in the catalogue have a lower EPSS than this one. How to read EPSS.
EPSS over last 30 days · oldest: 0.041 · newest: 0.041 · change: 0.000
Affected products
Weakness classification (CWE)
Public proof-of-concept exploits
References
- www.securityfocus.com/bid/99255 (VDB Entry, Third Party Advisory, vdb-entry)
- www.qualys.com/2017/06/19/stack-clash/stack-clash.txt (Third Party Advisory)
- cvsweb.netbsd.org/bsdweb.cgi/src/lib/libc/stdlib/qsort.c (Third Party Advisory)
Frequently asked questions
- What is CVE-2017-1000378?
- CVE-2017-1000378 is a critical-severity vulnerability in NetBSD, classified under Uncontrolled Resource Consumption. CVSS score: 9.8/10. Published 2017-06-19.
- How severe is CVE-2017-1000378?
- Critical severity. CVSS v3 base score is 9.8 out of 10.
- Is CVE-2017-1000378 known to be exploited?
- 5 public proof-of-concept repositories are indexed. Not currently listed in the CISA KEV catalog.