Enum sequoia_openpgp::policy::AsymmetricAlgorithm

#[non_exhaustive]
pub enum AsymmetricAlgorithm {
    RSA1024,
    RSA2048,
    RSA3072,
    RSA4096,
    ElGamal1024,
    ElGamal2048,
    ElGamal3072,
    ElGamal4096,
    DSA1024,
    DSA2048,
    DSA3072,
    DSA4096,
    NistP256,
    NistP384,
    NistP521,
    BrainpoolP256,
    BrainpoolP384,
    BrainpoolP512,
    Cv25519,
    Unknown,
}

Asymmetric encryption algorithms.

This type is for refining the StandardPolicy with respect to asymmetric algorithms. In contrast to PublicKeyAlgorithm, it does not concern itself with the use (encryption or signing), and it does include key sizes (if applicable) and elliptic curves.

Key sizes put into are buckets, rounding down to the nearest bucket. For example, a 3253-bit RSA key is categorized as RSA3072.

Note: This enum cannot be exhaustively matched to allow future extensions.

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.

RSA1024

RSA with key sizes up to 2048-1 bit.

RSA2048

RSA with key sizes up to 3072-1 bit.

RSA3072

RSA with key sizes up to 4096-1 bit.

RSA4096

RSA with key sizes larger or equal to 4096 bit.

ElGamal1024

ElGamal with key sizes up to 2048-1 bit.

ElGamal2048

ElGamal with key sizes up to 3072-1 bit.

ElGamal3072

ElGamal with key sizes up to 4096-1 bit.

ElGamal4096

ElGamal with key sizes larger or equal to 4096 bit.

DSA1024

DSA with key sizes up to 2048-1 bit.

DSA2048

DSA with key sizes up to 3072-1 bit.

DSA3072

DSA with key sizes up to 4096-1 bit.

DSA4096

DSA with key sizes larger or equal to 4096 bit.

NistP256

NIST curve P-256.

NistP384

NIST curve P-384.

NistP521

NIST curve P-521.

BrainpoolP256

brainpoolP256r1.

BrainpoolP384

brainpoolP384r1.

BrainpoolP512

brainpoolP512r1.

Cv25519

D.J. Bernstein’s Curve25519.

Unknown

Unknown algorithm.

Implementations

impl AsymmetricAlgorithm

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

Returns an iterator over all valid variants.

Returns an iterator over all known variants. This does not include the AsymmetricAlgorithm::Unknown variant.

Trait Implementations

impl Clone for AsymmetricAlgorithm

fn clone(&self) -> AsymmetricAlgorithm

Returns a copy of the value.

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

Performs copy-assignment from source.

impl Debug for AsymmetricAlgorithm

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

Formats the value using the given formatter.

impl Display for AsymmetricAlgorithm

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

Formats the value using the given formatter.

impl From<AsymmetricAlgorithm> for u8

fn from(a: AsymmetricAlgorithm) -> Self

Converts to this type from the input type.

impl PartialEq for AsymmetricAlgorithm

fn eq(&self, other: &AsymmetricAlgorithm) -> bool

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

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

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

impl Copy for AsymmetricAlgorithm

impl Eq for AsymmetricAlgorithm

impl StructuralPartialEq for AsymmetricAlgorithm