Enum VerifyingKey 

#[non_exhaustive]
pub enum VerifyingKey {
    Ed25519(Ed25519PublicKey),
    Rsa(RsaPublicKey),
}

A key capable of verifying detached signatures.

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.

Ed25519(Ed25519PublicKey)

Ed25519 backend.

Rsa(RsaPublicKey)

RSA PKCS#1 v1.5 backend.

Implementations

impl VerifyingKey

pub fn from_pem(pem_text: &str) -> Result<Self, Error>

Loads a public key from a PEM PUBLIC KEY document.

Errors

Returns Error::InvalidPem, Error::UnexpectedPemLabel, or Error::UnsupportedAlgorithm as appropriate.

pub fn to_pem(&self) -> String

Encodes the public key as a SubjectPublicKeyInfo PEM.

pub const fn algorithm(&self) -> Algorithm

Returns the algorithm identifier for this key.

pub fn verify(&self, message: &[u8], signature: &[u8]) -> Result<(), Error>

Verifies a detached signature of message.

Errors

Returns Error::VerificationFailed if the signature is malformed or does not match the message.

Trait Implementations

impl Clone for VerifyingKey

fn clone(&self) -> VerifyingKey

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VerifyingKey

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

Formats the value using the given formatter.

impl Eq for VerifyingKey

impl PartialEq for VerifyingKey

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