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.
Advisories
| Source | ID | Title |
|---|---|---|
EUVD |
EUVD-2017-1537 | 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. |
Fixes
Solution
No solution given by the vendor.
Workaround
No workaround given by the vendor.
References
History
No history.
Projects
Sign in to view the affected projects.
Status: PUBLISHED
Assigner: mitre
Published:
Updated: 2024-08-05T22:00:41.543Z
Reserved: 2017-06-13T00:00:00.000Z
Link: CVE-2017-1000378
No data.
Status : Deferred
Published: 2017-06-19T16:29:00.657
Modified: 2025-04-20T01:37:25.860
Link: CVE-2017-1000378
No data.
OpenCVE Enrichment
No data.
Weaknesses
EUVD