Struct RandomDecoy 

pub struct RandomDecoy;

Decoy strategy that produces uniformly-random bytes from the OS CSPRNG.

Threat profile. RandomDecoy is the fastest of the three built-in strategies and the easiest to reason about, but it is also the weakest: the byte distribution it produces is uniformly random, which is distinguishable from key material that has visible structure (DER envelopes, ASCII-armored data, PEM markers, MAC-based keys with header bytes, etc.). For maximum indistinguishability prefer SelfReferenceDecoy.

Use RandomDecoy when:

• The keys you store are already uniformly random (256-bit symmetric keys from a CSPRNG, for example) — there is nothing to distinguish.
• You want the lowest decoy-generation cost on the hot path.

Examples

use key_vault::decoy::{DecoyStrategy, RandomDecoy};
use key_vault::RawKey;

let key = RawKey::new(b"some key material".to_vec());
let decoy = RandomDecoy.generate(&key, 32).unwrap();
assert_eq!(decoy.len(), 32);

Trait Implementations

impl Clone for RandomDecoy

fn clone(&self) -> RandomDecoy

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for RandomDecoy

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl DecoyStrategy for RandomDecoy

fn generate(&self, _key: &RawKey, output_len: usize) -> Result<Vec<u8>>

Generate output_len bytes of decoy material derived (or not) from key.

fn describe(&self) -> Cow<'_, str>

Short identifier for audit and error attribution.

impl Default for RandomDecoy

fn default() -> RandomDecoy

Returns the “default value” for a type.

impl Copy for RandomDecoy