Trait zeroize::Zeroize

pub trait Zeroize {
    // Required method
    fn zeroize(&mut self);
}

Trait for securely erasing values from memory.

Required Methods

fn zeroize(&mut self)

Zero out this object from memory using Rust intrinsics which ensure the zeroization operation is not “optimized away” by the compiler.

Implementations on Foreign Types

impl Zeroize for str

fn zeroize(&mut self)

impl Zeroize for ()

() is zero sized so provide a Zeroize implementation.

fn zeroize(&mut self)

impl Zeroize for Box<str>

fn zeroize(&mut self)

impl Zeroize for String

fn zeroize(&mut self)

impl Zeroize for __m128

fn zeroize(&mut self)

impl Zeroize for __m128d

fn zeroize(&mut self)

impl Zeroize for __m128i

fn zeroize(&mut self)

impl Zeroize for PhantomPinned

PhantomPinned is zero sized so provide a Zeroize implementation.

fn zeroize(&mut self)

impl Zeroize for NonZeroI8

fn zeroize(&mut self)

impl Zeroize for NonZeroI16

fn zeroize(&mut self)

impl Zeroize for NonZeroI32

fn zeroize(&mut self)

impl Zeroize for NonZeroI64

fn zeroize(&mut self)

impl Zeroize for NonZeroI128

fn zeroize(&mut self)

impl Zeroize for NonZeroIsize

fn zeroize(&mut self)

impl Zeroize for NonZeroU8

fn zeroize(&mut self)

impl Zeroize for NonZeroU16

fn zeroize(&mut self)

impl Zeroize for NonZeroU32

fn zeroize(&mut self)

impl Zeroize for NonZeroU64

fn zeroize(&mut self)

impl Zeroize for NonZeroU128

fn zeroize(&mut self)

impl Zeroize for NonZeroUsize

fn zeroize(&mut self)

impl<'a, Z> Zeroize for IterMut<'a, Z>

where Z: Zeroize,

fn zeroize(&mut self)

impl<A: Zeroize> Zeroize for (A,)

Generic implementation of Zeroize for tuples up to 10 parameters.

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize> Zeroize for (A, B)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize> Zeroize for (A, B, C)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize, D: Zeroize> Zeroize for (A, B, C, D)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize, D: Zeroize, E: Zeroize> Zeroize for (A, B, C, D, E)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize, D: Zeroize, E: Zeroize, F: Zeroize> Zeroize for (A, B, C, D, E, F)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize, D: Zeroize, E: Zeroize, F: Zeroize, G: Zeroize> Zeroize for (A, B, C, D, E, F, G)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize, D: Zeroize, E: Zeroize, F: Zeroize, G: Zeroize, H: Zeroize> Zeroize for (A, B, C, D, E, F, G, H)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize, D: Zeroize, E: Zeroize, F: Zeroize, G: Zeroize, H: Zeroize, I: Zeroize> Zeroize for (A, B, C, D, E, F, G, H, I)

fn zeroize(&mut self)

impl<A: Zeroize, B: Zeroize, C: Zeroize, D: Zeroize, E: Zeroize, F: Zeroize, G: Zeroize, H: Zeroize, I: Zeroize, J: Zeroize> Zeroize for (A, B, C, D, E, F, G, H, I, J)

fn zeroize(&mut self)

impl<Z> Zeroize for Option<Z>

where Z: Zeroize,

fn zeroize(&mut self)

impl<Z> Zeroize for [Z]

where Z: DefaultIsZeroes,

Impl Zeroize on slices of types that can be zeroized with Default.

This impl can eventually be optimized using an memset intrinsic, such as core::intrinsics::volatile_set_memory. For that reason the blanket impl on slices is bounded by DefaultIsZeroes.

To zeroize a mut slice of Z: Zeroize which does not impl DefaultIsZeroes, call iter_mut().zeroize().

fn zeroize(&mut self)

impl<Z> Zeroize for Box<[Z]>

where Z: Zeroize,

fn zeroize(&mut self)

Unlike Vec, Box<[Z]> cannot reallocate, so we can be sure that we are not leaving values on the heap.

impl<Z> Zeroize for Vec<Z>

where Z: Zeroize,

fn zeroize(&mut self)

“Best effort” zeroization for Vec.

Ensures the entire capacity of the Vec is zeroed. Cannot ensure that previous reallocations did not leave values on the heap.

impl<Z> Zeroize for PhantomData<Z>

PhantomData is always zero sized so provide a Zeroize implementation.

fn zeroize(&mut self)

impl<Z> Zeroize for Wrapping<Z>

where Z: Zeroize,

fn zeroize(&mut self)

impl<Z> Zeroize for [MaybeUninit<Z>]

Impl Zeroize on slices of MaybeUninit types.

This impl can eventually be optimized using an memset intrinsic, such as core::intrinsics::volatile_set_memory.

This fills the slice with zeroes.

Note that this ignore invariants that Z might have, because MaybeUninit removes all invariants.

fn zeroize(&mut self)

impl<Z, const N: usize> Zeroize for [Z; N]

where Z: Zeroize,

Impl Zeroize on arrays of types that impl Zeroize.

fn zeroize(&mut self)

Implementors

impl<Z> Zeroize for Zeroizing<Z>

where Z: Zeroize,

impl<Z> Zeroize for Z

where Z: DefaultIsZeroes,