Struct VerifyingKey 

pub struct VerifyingKey<C>
where
    C: PrimeCurve + ProjectiveArithmetic,
{ /* private fields */ }

Available on crate feature verify only.

ECDSA verification key (i.e. public key). Generic over elliptic curves.

Requires an elliptic_curve_flow::ProjectiveArithmetic impl on the curve, and a VerifyPrimitive impl on its associated AffinePoint type.

Implementations

impl<C> VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

pub fn from_sec1_bytes(bytes: &[u8]) -> Result<Self>

Initialize VerifyingKey from a SEC1-encoded public key.

pub fn from_encoded_point(public_key: &EncodedPoint<C>) -> Result<Self>

Initialize VerifyingKey from an EncodedPoint.

pub fn to_encoded_point(&self, compress: bool) -> EncodedPoint<C>

Serialize this VerifyingKey as a SEC1 EncodedPoint, optionally applying point compression.

Trait Implementations

impl<C> Clone for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic + Clone,

fn clone(&self) -> VerifyingKey<C>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<C> Debug for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic + Debug,

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

Formats the value using the given formatter.

impl<C, D> DigestVerifier<D, Signature<C>> for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic, D: Digest<OutputSize = FieldSize<C>>, AffinePoint<C>: VerifyPrimitive<C>, Scalar<C>: FromDigest<C>, SignatureSize<C>: ArrayLength<u8>,

fn verify_digest(&self, digest: D, signature: &Signature<C>) -> Result<()>

Verify the signature against the given Digest output.

impl<C> From<&PublicKey<C>> for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic,

fn from(public_key: &PublicKey<C>) -> VerifyingKey<C>

Converts to this type from the input type.

impl<C> From<&SigningKey<C>> for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic, Scalar<C>: FromDigest<C> + Invert<Output = Scalar<C>> + SignPrimitive<C>, SignatureSize<C>: ArrayLength<u8>,

fn from(signing_key: &SigningKey<C>) -> VerifyingKey<C>

Converts to this type from the input type.

impl<C> From<&VerifyingKey<C>> for EncodedPoint<C>

where C: PrimeCurve + ProjectiveArithmetic + PointCompression, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

fn from(verifying_key: &VerifyingKey<C>) -> EncodedPoint<C>

Converts to this type from the input type.

impl<C> From<&VerifyingKey<C>> for PublicKey<C>

where C: PrimeCurve + ProjectiveArithmetic,

fn from(verifying_key: &VerifyingKey<C>) -> PublicKey<C>

Converts to this type from the input type.

impl<C> From<PublicKey<C>> for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic,

fn from(public_key: PublicKey<C>) -> VerifyingKey<C>

Converts to this type from the input type.

impl<C> From<VerifyingKey<C>> for PublicKey<C>

where C: PrimeCurve + ProjectiveArithmetic,

fn from(verifying_key: VerifyingKey<C>) -> PublicKey<C>

Converts to this type from the input type.

impl<C> FromPublicKey for VerifyingKey<C>

where C: PrimeCurve + AlgorithmParameters + ProjectiveArithmetic + PointCompression, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

Available on crate feature pkcs8 only.

fn from_spki(spki: SubjectPublicKeyInfo<'_>) -> Result<Self>

Parse SubjectPublicKeyInfo into a public key object.

fn from_public_key_der(bytes: &[u8]) -> Result<Self, Error>

Deserialize object from ASN.1 DER-encoded SubjectPublicKeyInfo (binary format).

fn from_public_key_doc(doc: &PublicKeyDocument) -> Result<Self, Error>

Deserialize PKCS#8 private key from a PrivateKeyDocument.

fn from_public_key_pem(s: &str) -> Result<Self, Error>

Deserialize PEM-encoded SubjectPublicKeyInfo.

impl<C> FromStr for VerifyingKey<C>

where C: PrimeCurve + AlgorithmParameters + ProjectiveArithmetic + PointCompression, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

Available on crate feature pem only.

type Err = Error

The associated error which can be returned from parsing.

fn from_str(s: &str) -> Result<Self>

Parses a string s to return a value of this type.

impl<C> Ord for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

fn cmp(&self, other: &Self) -> 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<C> PartialEq for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

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

where C: PrimeCurve + ProjectiveArithmetic, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

fn partial_cmp(&self, other: &Self) -> 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<C> TryFrom<&[u8]> for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,

type Error = Error

The type returned in the event of a conversion error.

fn try_from(bytes: &[u8]) -> Result<Self>

Performs the conversion.

impl<C> Verifier<Signature<C>> for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic + DigestPrimitive, C::Digest: Digest<OutputSize = FieldSize<C>>, AffinePoint<C>: VerifyPrimitive<C>, Scalar<C>: FromDigest<C>, SignatureSize<C>: ArrayLength<u8>,

fn verify(&self, msg: &[u8], signature: &Signature<C>) -> Result<()>

Use Self to verify that the provided signature for a given message bytestring is authentic.

impl<C> Copy for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic,

impl<C> Eq for VerifyingKey<C>

where C: PrimeCurve + ProjectiveArithmetic, AffinePoint<C>: FromEncodedPoint<C> + ToEncodedPoint<C>, UntaggedPointSize<C>: Add<U1> + ArrayLength<u8>, UncompressedPointSize<C>: ArrayLength<u8>,