{"id":"CVE-2019-15543","aliases":["EUVD-2021-1672","GHSA-c3m3-c39q-pv23","RUSTSEC-2019-0002"],"status":"published","title":"Out of bounds write in slice-deque","description":"An issue was discovered in the slice-deque crate before 0.2.0 for Rust. There is memory corruption in certain allocation cases.","severity":{"version":"3.0","score":9.8,"vector":"CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H","level":"critical","assessor":"primary","from":"nvd"},"epss":{"day":"2026-11-08","score":0.01611,"percentile":0.76109,"model":"v2026.06.15"},"facts":{"in_kev":false,"known_exploited":false,"public_exploit":false,"fix_available":true},"cwes":["CWE-787"],"published":"2019-05-07T12:00:00Z","modified":"2026-06-17T02:20:35Z","fixes":[{"ecosystem":"crates.io","package":"slice-deque","fixed_in":["0.2.0"],"sources":["ghsa","osv"]}],"affected":[{"source":"ghsa","ecosystem":"crates.io","package":"slice-deque","ranges":[{"type":"ECOSYSTEM","events":[{"introduced":"0"},{"fixed":"0.2.0"}]}]},{"source":"osv","ecosystem":"crates.io","package":"slice-deque","ranges":[{"type":"SEMVER","events":[{"introduced":"0"},{"fixed":"0.2.0"}]}]},{"source":"osv","ecosystem":"crates.io","package":"slice-deque","ranges":[{"type":"SEMVER","events":[{"introduced":"0.0.0-0"},{"fixed":"0.2.0"}]}]}],"products":[{"vendor":"slice-deque_project","product":"slice-deque"}],"references":[{"url":"https://rustsec.org/advisories/RUSTSEC-2019-0002.html","tags":["x_refsource_MISC","x_transferred","Third Party Advisory","web","advisory"]},{"url":"https://nvd.nist.gov/vuln/detail/CVE-2019-15543","tags":["advisory"]},{"url":"https://github.com/gnzlbg/slice_deque/issues/57","tags":["web","report"]},{"url":"https://github.com/advisories/GHSA-c3m3-c39q-pv23"},{"url":"https://github.com/gnzlbg/slice_deque","tags":["package"]},{"url":"https://crates.io/crates/slice-deque","tags":["package"]}],"sources":{"cve":[{"id":"CVE-2019-15543","description":"An issue was discovered in the slice-deque crate before 0.2.0 for Rust. There is memory corruption in certain allocation cases.","status":"published","published":"2019-08-26T17:09:28Z","modified":"2024-08-05T00:49:13.719Z","updated_at":"2026-11-02T14:20:21.397307Z"}],"euvd":[{"id":"EUVD-2021-1672","description":"An issue was discovered in the slice-deque crate before 0.2.0 for Rust. There is memory corruption in certain allocation cases.","status":"published","published":"2019-08-26T17:09:28Z","modified":"2024-08-05T00:49:13Z","updated_at":"2026-11-03T02:40:35.584574Z"}],"ghsa":[{"id":"GHSA-c3m3-c39q-pv23","title":"Out of bounds write in slice-deque","description":"Affected versions of this crate entered a corrupted state if mem::size_of::\u003cT\u003e() % allocation_granularity() != 0 and a specific allocation pattern was used: sufficiently shifting the deque elements over the mirrored page boundary.\n\nThis allows an attacker that controls controls both element insertion and removal to corrupt the deque, such that reading elements from it would read bytes corresponding to other elements in the deque. (e.g. a read of T could read some bytes from one value and some bytes from an adjacent one, resulting in a T whose value representation is not meaningful). This is undefined behavior.\n\nThe flaw was corrected by using a pair of pointers to track the head and tail of the deque instead of a pair of indices. This pair of pointers are represented using a Rust slice.","status":"published","published":"2021-08-25T20:44:10Z","modified":"2023-06-13T20:56:40Z","cvss":[{"version":"3.0","score":9.8,"vector":"CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H","level":"critical"}],"cwes":["CWE-787"],"updated_at":"2026-11-02T14:36:54.225318Z"}],"nvd":[{"id":"CVE-2019-15543","description":"An issue was discovered in the slice-deque crate before 0.2.0 for Rust. There is memory corruption in certain allocation cases.","status":"published","published":"2019-08-26T18:15:12.53Z","modified":"2026-06-17T02:20:35.963Z","cvss":[{"version":"3.0","score":9.8,"vector":"CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H","level":"critical","assessor":"primary"},{"version":"2.0","score":7.5,"vector":"AV:N/AC:L/Au:N/C:P/I:P/A:P","level":"high","assessor":"primary"}],"cwes":["CWE-787"],"updated_at":"2026-11-02T14:05:23.725587Z"}],"osv":[{"id":"GHSA-c3m3-c39q-pv23","title":"Out of bounds write in slice-deque","description":"Affected versions of this crate entered a corrupted state if mem::size_of::\u003cT\u003e() % allocation_granularity() != 0 and a specific allocation pattern was used: sufficiently shifting the deque elements over the mirrored page boundary.\n\nThis allows an attacker that controls controls both element insertion and removal to corrupt the deque, such that reading elements from it would read bytes corresponding to other elements in the deque. (e.g. a read of T could read some bytes from one value and some bytes from an adjacent one, resulting in a T whose value representation is not meaningful). This is undefined behavior.\n\nThe flaw was corrected by using a pair of pointers to track the head and tail of the deque instead of a pair of indices. This pair of pointers are represented using a Rust slice.","status":"published","published":"2021-08-25T20:44:10Z","modified":"2023-11-08T04:01:13.735681Z","cvss":[{"version":"3.0","score":9.8,"vector":"CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H","level":"critical"}],"cwes":["CWE-787"],"updated_at":"2026-11-02T15:46:44.571161Z"},{"id":"RUSTSEC-2019-0002","title":"Bug in SliceDeque::move_head_unchecked corrupts its memory","description":"Affected versions of this crate entered a corrupted state if\n`mem::size_of::\u003cT\u003e() % allocation_granularity() != 0` and a specific allocation\npattern was used: sufficiently shifting the deque elements over the mirrored\npage boundary.\n\nThis allows an attacker that controls controls both element insertion and\nremoval to corrupt the deque, such that reading elements from it would read\nbytes corresponding to other elements in the deque. (e.g. a read of T could read\nsome bytes from one value and some bytes from an adjacent one, resulting in a T\nwhose value representation is not meaningful). This is undefined behavior.\n \nThe flaw was corrected by using a pair of pointers to track the head and tail of\nthe deque instead of a pair of indices. This pair of pointers are represented\nusing a Rust slice.","status":"published","published":"2019-05-07T12:00:00Z","modified":"2026-02-04T04:35:48.117957Z","cvss":[{"version":"3.0","score":9.8,"vector":"CVSS:3.0/AV:N/AC:L/PR:N/UI:N/S:U/C:H/I:H/A:H","level":"critical"}],"updated_at":"2026-11-02T15:53:39.492624Z"}]}}