{"api_version":"1","generated_at":"2026-04-23T02:57:07+00:00","cve":"CVE-2017-1000378","urls":{"html":"https://cve.report/CVE-2017-1000378","api":"https://cve.report/api/cve/CVE-2017-1000378.json","docs":"https://cve.report/api","cve_org":"https://www.cve.org/CVERecord?id=CVE-2017-1000378","nvd":"https://nvd.nist.gov/vuln/detail/CVE-2017-1000378"},"summary":{"title":"CVE-2017-1000378","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.","state":"PUBLIC","assigner":"cve@mitre.org","published_at":"2017-06-19 16:29:00","updated_at":"2019-10-03 00:03:00"},"problem_types":["CWE-400"],"metrics":[],"references":[{"url":"http://cvsweb.netbsd.org/bsdweb.cgi/src/lib/libc/stdlib/qsort.c?rev=1.23&content-type=text/x-cvsweb-markup","name":"http://cvsweb.netbsd.org/bsdweb.cgi/src/lib/libc/stdlib/qsort.c?rev=1.23&content-type=text/x-cvsweb-markup","refsource":"MISC","tags":["Third Party Advisory"],"title":"src/lib/libc/stdlib/qsort.c - view - 1.23","mime":"text/x-c","httpstatus":"200","archivestatus":"200"},{"url":"http://www.securityfocus.com/bid/99255","name":"99255","refsource":"BID","tags":["Third Party Advisory","VDB Entry"],"title":"NetBSD CVE-2017-1000378 Arbitrary Code Execution Vulnerability","mime":"text/html","httpstatus":"200","archivestatus":"0"},{"url":"https://www.qualys.com/2017/06/19/stack-clash/stack-clash.txt","name":"https://www.qualys.com/2017/06/19/stack-clash/stack-clash.txt","refsource":"MISC","tags":["Third Party Advisory"],"title":"","mime":"text/plain","httpstatus":"200","archivestatus":"200"},{"url":"https://www.cve.org/CVERecord?id=CVE-2017-1000378","name":"CVE Program record","refsource":"CVE.ORG","tags":["canonical"]},{"url":"https://nvd.nist.gov/vuln/detail/CVE-2017-1000378","name":"NVD vulnerability detail","refsource":"NVD","tags":["canonical","analysis"]}],"affected":[],"timeline":[],"solutions":[],"workarounds":[],"exploits":[],"credits":[],"nvd_cpes":[{"cve_year":"2017","cve_id":"1000378","vulnerable":"1","versionEndIncluding":"7.1","cpe1":"cpe","cpe2":"2.3","cpe3":"o","cpe4":"netbsd","cpe5":"netbsd","cpe6":"*","cpe7":"*","cpe8":"*","cpe9":"*","cpe10":"*","cpe11":"*","cpe12":"*","cpe13":"*"}],"vendor_comments":[],"enrichments":{"kev":null,"epss":null,"legacy_qids":[]},"source_records":{"cve_program":{"CVE_data_meta":{"ASSIGNER":"cve@mitre.org","ID":"CVE-2017-1000378","REQUESTER":"qsa@qualys.com","STATE":"PUBLIC"},"affects":{"vendor":{"vendor_data":[{"product":{"product_data":[{"product_name":"n/a","version":{"version_data":[{"version_value":"n/a"}]}}]},"vendor_name":"n/a"}]}},"data_format":"MITRE","data_type":"CVE","data_version":"4.0","description":{"description_data":[{"lang":"eng","value":"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."}]},"problemtype":{"problemtype_data":[{"description":[{"lang":"eng","value":"n/a"}]}]},"references":{"reference_data":[{"name":"99255","refsource":"BID","url":"http://www.securityfocus.com/bid/99255"},{"name":"https://www.qualys.com/2017/06/19/stack-clash/stack-clash.txt","refsource":"MISC","url":"https://www.qualys.com/2017/06/19/stack-clash/stack-clash.txt"},{"name":"http://cvsweb.netbsd.org/bsdweb.cgi/src/lib/libc/stdlib/qsort.c?rev=1.23&content-type=text/x-cvsweb-markup","refsource":"MISC","url":"http://cvsweb.netbsd.org/bsdweb.cgi/src/lib/libc/stdlib/qsort.c?rev=1.23&content-type=text/x-cvsweb-markup"}]}},"nvd":{"publishedDate":"2017-06-19 16:29:00","lastModifiedDate":"2019-10-03 00:03:00","problem_types":["CWE-400"],"metrics":{"baseMetricV3":{"cvssV3":{"version":"3.0","vectorString":"CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H","attackVector":"NETWORK","attackComplexity":"LOW","privilegesRequired":"NONE","userInteraction":"NONE","scope":"UNCHANGED","confidentialityImpact":"HIGH","integrityImpact":"HIGH","availabilityImpact":"HIGH","baseScore":9.8,"baseSeverity":"CRITICAL"},"exploitabilityScore":3.9,"impactScore":5.9},"baseMetricV2":{"cvssV2":{"version":"2.0","vectorString":"AV:N/AC:L/Au:N/C:P/I:P/A:P","accessVector":"NETWORK","accessComplexity":"LOW","authentication":"NONE","confidentialityImpact":"PARTIAL","integrityImpact":"PARTIAL","availabilityImpact":"PARTIAL","baseScore":7.5},"severity":"HIGH","exploitabilityScore":10,"impactScore":6.4,"obtainAllPrivilege":false,"obtainUserPrivilege":false,"obtainOtherPrivilege":false,"userInteractionRequired":false}},"configurations":{"CVE_data_version":"4.0","nodes":[{"operator":"OR","children":[],"cpe_match":[{"vulnerable":true,"cpe23Uri":"cpe:2.3:o:netbsd:netbsd:*:*:*:*:*:*:*:*","versionEndIncluding":"7.1","cpe_name":[]}]}]}},"legacy_mitre":{"record":{"CveYear":"2017","CveId":"1000378","Ordinal":"106625","Title":"CVE-2017-1000378","CVE":"CVE-2017-1000378","Year":"2017"},"notes":[{"CveYear":"2017","CveId":"1000378","Ordinal":"1","NoteData":"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.","Type":"Description","Title":null},{"CveYear":"2017","CveId":"1000378","Ordinal":"2","NoteData":"2017-06-19","Type":"Other","Title":"Published"},{"CveYear":"2017","CveId":"1000378","Ordinal":"3","NoteData":"2017-06-26","Type":"Other","Title":"Modified"}]}}}