SOC status:Duty analyst on shift

UK Cyber Defence
VulnerabilityModified

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.

CRITICAL 9.8EPSS 4.12%

Does this matter?

High impact if exploited, but EPSS currently rates exploitation as unlikely (4.12%). Schedule it in the normal patch cycle and watch for a rise in EPSS or a public exploit.

Description

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.

CVSS 3.0
9.8 CRITICALCVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H
EPSS
4.12% probability · 90th percentile
CISA KEV
Not listed
Weakness
CWE-400
Affected
netbsd/netbsd
Source
cve@mitre.org

Source: NVD record, EPSS from FIRST.org, KEV from CISA. Refreshed daily.