Enum AEADAlgorithm

#[non_exhaustive]
pub enum AEADAlgorithm {
    EAX,
    OCB,
    GCM,
    Private(u8),
    Unknown(u8),
}

AEAD modes.

See AEAD Algorithms for details.

The values can be converted into and from their corresponding values of the serialized format.

Use AEADAlgorithm::from to translate a numeric value to a symbolic one.

Examples

Use AEADAlgorithm to set the preferred AEAD algorithms on a signature:

use sequoia_openpgp as openpgp;
use openpgp::packet::signature::SignatureBuilder;
use openpgp::types::{AEADAlgorithm, Features, SignatureType, SymmetricAlgorithm};

let features = Features::empty().set_seipdv2();
let mut builder = SignatureBuilder::new(SignatureType::DirectKey)
    .set_features(features)?
    .set_preferred_aead_ciphersuites(vec![
        (SymmetricAlgorithm::Camellia128, AEADAlgorithm::EAX),
    ])?;

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

EAX

EAX mode.

OCB

OCB mode.

GCM

Galois/Counter mode.

Private(u8)

Private algorithm identifier.

Unknown(u8)

Unknown algorithm identifier.

Implementations

impl AEADAlgorithm

pub fn digest_size(&self) -> Result<usize>

Returns the digest size of the AEAD algorithm.

pub fn nonce_size(&self) -> Result<usize>

Returns the nonce size of the AEAD algorithm.

impl AEADAlgorithm

pub fn is_supported(&self) -> bool

Returns whether this algorithm is supported.

Examples

use sequoia_openpgp as openpgp;
use openpgp::types::AEADAlgorithm;

assert!(! AEADAlgorithm::Private(100).is_supported());

pub fn variants() -> impl Iterator<Item = Self>

Returns an iterator over all valid variants.

Returns an iterator over all known variants. This does not include the AEADAlgorithm::Private, or AEADAlgorithm::Unknown variants.

Trait Implementations

impl Clone for AEADAlgorithm

fn clone(&self) -> AEADAlgorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AEADAlgorithm

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

Formats the value using the given formatter.

impl Default for AEADAlgorithm

fn default() -> Self

Returns the “default value” for a type.

impl Display for AEADAlgorithm

Formats the AEAD algorithm name.

There are two ways the AEAD algorithm name can be formatted. By default the short name is used. The alternate format uses the full algorithm name.

Examples

use sequoia_openpgp as openpgp;
use openpgp::types::AEADAlgorithm;

// default, short format
assert_eq!("EAX", format!("{}", AEADAlgorithm::EAX));

// alternate, long format
assert_eq!("EAX mode", format!("{:#}", AEADAlgorithm::EAX));

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

Formats the value using the given formatter.

impl From<AEADAlgorithm> for u8

fn from(s: AEADAlgorithm) -> u8

Converts to this type from the input type.

impl From<u8> for AEADAlgorithm

fn from(u: u8) -> Self

Converts to this type from the input type.

impl Hash for AEADAlgorithm

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl Ord for AEADAlgorithm

fn cmp(&self, other: &AEADAlgorithm) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl PartialEq for AEADAlgorithm

fn eq(&self, other: &AEADAlgorithm) -> 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 PartialOrd for AEADAlgorithm

fn partial_cmp(&self, other: &AEADAlgorithm) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl Copy for AEADAlgorithm

impl Eq for AEADAlgorithm

impl StructuralPartialEq for AEADAlgorithm