Struct Algorithm

pub struct Algorithm<Id = AlgorithmId>
where
    Id: AlgorithmIdentifier,
{
    pub(crate) id: Id,
    pub(crate) decapsulate_key_size: usize,
    pub(crate) encapsulate_key_size: usize,
    pub(crate) ciphertext_size: usize,
    pub(crate) shared_secret_size: usize,
}

A KEM algorithm

Fields

id: Id

decapsulate_key_size: usize

encapsulate_key_size: usize

ciphertext_size: usize

shared_secret_size: usize

Implementations

impl<Id> Algorithm<Id>

where Id: AlgorithmIdentifier,

pub fn id(&self) -> Id

Returns the identifier for this algorithm.

pub(crate) fn decapsulate_key_size(&self) -> usize

pub(crate) fn encapsulate_key_size(&self) -> usize

pub(crate) fn ciphertext_size(&self) -> usize

pub(crate) fn shared_secret_size(&self) -> usize

Trait Implementations

impl<Id> Debug for Algorithm<Id>

where Id: AlgorithmIdentifier,

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

Formats the value using the given formatter.

impl<Id> PartialEq for Algorithm<Id>

where Id: AlgorithmIdentifier + PartialEq,

fn eq(&self, other: &Algorithm<Id>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<Id> StructuralPartialEq for Algorithm<Id>

where Id: AlgorithmIdentifier,