Struct xxhrs::EntropyPool

pub struct EntropyPool {
    pub entropy: [u8; 192],
}

Besides seeded and unseeded variants, XXH3 provides a keyed (withSecret) variant. This is a bit of a misnomer though, because these functions havea not been formally verified as message authentication codes; they also do not guarantee that the entire secret is used, the secret is impractically large (tens to hundreds of bytes) and pathological secrets are not handled well at all.

However, these functions are harder to revers than using seeds, in fact the seeded variant internally just uses a modified secret.

This is why xxhrs provides support for these, but renames the secrets "EntropyPool" to make it clear that it is not really a proper keyed hash.

You can generate a random EntropyPool or use the key derivation function provided by the c library. You could also fill the secret manually, for instance using HMAC-SHA256 or Kekkac, but this is probably overkill.

Fields

entropy: [u8; 192]

Implementations

impl EntropyPool

pub fn randomize() -> Self

Use the getrandom crate to create a randomized EntropyPool

pub fn with_key(key: &[u8]) -> Self

Use the higher quality entropy derivation scheme from variable length input keys

Trait Implementations

impl Clone for EntropyPool

fn clone(&self) -> EntropyPool

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for EntropyPool

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

Formats the value using the given formatter.

impl Eq for EntropyPool

impl PartialEq<EntropyPool> for EntropyPool

fn eq(&self, otr: &Self) -> bool

This method tests for self and other values to be equal, and is used by ==.

#[must_use]fn ne(&self, other: &Rhs) -> bool

This method tests for !=.