Struct tink_prf::subtle::HkdfPrf

pub struct HkdfPrf { /* fields omitted */ }

HkdfPrf is a type that can be used to compute several HKDFs with the same key material.

Implementations

impl HkdfPrf

pub fn new(
    hash_alg: HashType,
    key: &[u8],
    salt: &[u8]
) -> Result<HkdfPrf, TinkError>

Create a new HkdfPrf object and initialize it with the correct key material.

Trait Implementations

impl Clone for HkdfPrf

fn clone(&self) -> HkdfPrf

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Prf for HkdfPrf

fn compute_prf(&self, data: &[u8], out_len: usize) -> Result<Vec<u8>, TinkError>

Compute the PRF selected by the underlying key on input and returns the first output_length bytes. When choosing this parameter keep the birthday paradox in mind. If you have 2^n different inputs that your system has to handle set the output length (in bytes) to at least ceil(n/4 + 4) This corresponds to 2*n + 32 bits, meaning a collision will occur with a probability less than 1:2^32. When in doubt, request a security review. Returns a non ok status if the algorithm fails or if the output of algorithm is less than outputLength.