https://cve.radiocsirt.org Contains only the most 10 recent entries. http://www.rssboard.org/rss-specification python-feedgen en Sat, 10 Oct 2026 08:17:11 +0000 https://cve.radiocsirt.org/vuln/euvd-2026-57190 EUVD-2026-57190 https://cve.radiocsirt.org/vuln/euvd-2026-57190 https://cve.radiocsirt.org/vuln/fkie_cve-2019-15543 <p>An issue was discovered in the slice-deque crate before 0.2.0 for Rust. There is memory corruption in certain allocation cases.</p> <p>An issue was discovered in the slice-deque crate before 0.2.0 for Rust. There is memory corruption in certain allocation cases.</p> https://cve.radiocsirt.org/vuln/fkie_cve-2019-15543 https://cve.radiocsirt.org/vuln/ghsa-c3m3-c39q-pv23 <p><strong>Affected:</strong> crates.io: slice-deque</p> <p>Affected versions of this crate entered a corrupted state if mem::size_of::&lt;T&gt;() % allocation_granularity() != 0 and a specific allocation pattern was used: sufficiently shifting the deque elements over the mirrored page boundary.</p> <p>This 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.</p> <p>The 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.</p> <p><strong>Affected:</strong> crates.io: slice-deque</p> <p>Affected versions of this crate entered a corrupted state if mem::size_of::&lt;T&gt;() % allocation_granularity() != 0 and a specific allocation pattern was used: sufficiently shifting the deque elements over the mirrored page boundary.</p> <p>This 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.</p> <p>The 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.</p> https://cve.radiocsirt.org/vuln/ghsa-c3m3-c39q-pv23 https://cve.radiocsirt.org/vuln/gsd-2019-15543 gsd-2019-15543 https://cve.radiocsirt.org/vuln/gsd-2019-15543 https://cve.radiocsirt.org/vuln/rustsec-2019-0002 <p><strong>Affected:</strong> crates.io: slice-deque</p> <p>Affected versions of this crate entered a corrupted state if `mem::size_of::&lt;T&gt;() % allocation_granularity() != 0` and a specific allocation pattern was used: sufficiently shifting the deque elements over the mirrored page boundary.</p> <p>This 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. The 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.</p> <p><strong>Affected:</strong> crates.io: slice-deque</p> <p>Affected versions of this crate entered a corrupted state if `mem::size_of::&lt;T&gt;() % allocation_granularity() != 0` and a specific allocation pattern was used: sufficiently shifting the deque elements over the mirrored page boundary.</p> <p>This 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. The 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.</p> https://cve.radiocsirt.org/vuln/rustsec-2019-0002