#zeroize #memory #stack #data #heap-memory #sensitive #clear-stack

no-std clear_on_drop

Helpers for clearing sensitive data on the stack and heap

7 releases

0.2.5 Apr 16, 2022
0.2.4 Jun 4, 2020
0.2.3 Dec 3, 2017
0.2.2 Aug 25, 2017
0.1.0 Jan 14, 2017

#297 in Cryptography

Download history 13040/week @ 2023-12-15 10384/week @ 2023-12-22 11579/week @ 2023-12-29 16918/week @ 2024-01-05 18948/week @ 2024-01-12 18883/week @ 2024-01-19 19634/week @ 2024-01-26 18144/week @ 2024-02-02 19054/week @ 2024-02-09 17389/week @ 2024-02-16 16920/week @ 2024-02-23 14432/week @ 2024-03-01 14351/week @ 2024-03-08 15604/week @ 2024-03-15 10123/week @ 2024-03-22 7200/week @ 2024-03-29

49,570 downloads per month
Used in 281 crates (47 directly)

MIT/Apache

29KB
548 lines

Helpers for clearing sensitive data on the stack and heap

Some kinds of data should not be kept in memory any longer than they are needed. For instance, cryptographic keys and intermediate values should be erased as soon as they are no longer needed.

The Rust language helps prevent the accidental reading of leftover values on the stack or the heap; however, means outside the program (for instance a debugger, or even physical access to the hardware) can still read the leftover values. For long-lived processes, key material might be found in the memory long after it should have been discarded.

This crate provides two mechanisms to help minimize leftover data.

The ClearOnDrop wrapper holds a mutable reference to sensitive data (for instance, a cipher state), and clears the data when dropped. While the mutable reference is held, the data cannot be moved, so there won't be leftovers due to moves; the wrapper itself can be freely moved. Alternatively, it can hold data on the heap (using a Box<T>, or possibly a similar which allocates from a mlocked heap).

The clear_stack_on_return function calls a closure, and after it returns, overwrites several kilobytes of the stack. This can help overwrite temporary variables used by cryptographic algorithms, and is especially relevant when running on a short-lived thread, since the memory used for the thread stack cannot be easily overwritten after the thread terminates.

Preventing compiler optimizations

If the compiler determines the data is not used after being cleared, it could elide the clearing code. Aditionally, the compiler could inline a called function and the stack clearing code, using separate areas of the stack for each. This crate has three mechanisms which prevent these unwanted optimizations, selected at compile time via cargo features.

The fastest mechanism uses inline assembly, which is only available on nightly Rust. It is enabled through the nightly feature, and does not need a working C compiler.

The second mechanism, which is the default, uses a call to a dummy C function. It works on stable Rust, but needs a working C compiler.

The third mechanism is a fallback, which attempts to confuse the optimizer through the use of atomic instructions. It should not be used unless necessary, since it's less reliable. It is enabled by the no_cc feature, works on stable Rust, and does not need a C compiler.

License

Licensed under either of

at your option.

Contribution

Unless you explicitly state otherwise, any contribution intentionally submitted for inclusion in the work by you, as defined in the Apache-2.0 license, shall be dual licensed as above, without any additional terms or conditions.

No runtime deps

~170KB