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.
References
Link | Resource |
---|---|
http://cvsweb.netbsd.org/bsdweb.cgi/src/lib/libc/stdlib/qsort.c?rev=1.23&content-type=text/x-cvsweb-markup | Third Party Advisory |
http://www.securityfocus.com/bid/99255 | Third Party Advisory VDB Entry |
https://www.qualys.com/2017/06/19/stack-clash/stack-clash.txt | Third Party Advisory |
History
No history.
MITRE Information
Status: PUBLISHED
Assigner: mitre
Published: 2017-06-19T16:00:00
Updated: 2017-06-26T09:57:01
Reserved: 2017-06-13T00:00:00
Link: CVE-2017-1000378
JSON object: View
NVD Information
Status : Analyzed
Published: 2017-06-19T16:29:00.657
Modified: 2019-10-03T00:03:26.223
Link: CVE-2017-1000378
JSON object: View
Redhat Information
No data.
CWE