Type Alias VerifyingKey

pub type VerifyingKey = VerifyingKey<NistP256>;

ECDSA/P-256 verification key (i.e. public key)

Aliased Type

struct VerifyingKey { /* private fields */ }

Implementations

impl<C> VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic, <C as CurveArithmetic>::AffinePoint: DecompressPoint<C> + FromEncodedPoint<C> + ToEncodedPoint<C> + VerifyPrimitive<C>, <C as Curve>::FieldBytesSize: ModulusSize, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

pub fn recover_from_msg( msg: &[u8], signature: &Signature<C>, recovery_id: RecoveryId, ) -> Result<VerifyingKey<C>, Error>

where C: DigestPrimitive,

Recover a VerifyingKey from the given message, signature, and RecoveryId.

The message is first hashed using this curve’s DigestPrimitive.

pub fn recover_from_digest<D>( msg_digest: D, signature: &Signature<C>, recovery_id: RecoveryId, ) -> Result<VerifyingKey<C>, Error>

where D: Digest,

Recover a VerifyingKey from the given message Digest, signature, and RecoveryId.

pub fn recover_from_prehash( prehash: &[u8], signature: &Signature<C>, recovery_id: RecoveryId, ) -> Result<VerifyingKey<C>, Error>

Recover a VerifyingKey from the given prehash of a message, the signature over that prehashed message, and a RecoveryId.

impl<C> VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic, <C as CurveArithmetic>::AffinePoint: FromEncodedPoint<C> + ToEncodedPoint<C>, <C as Curve>::FieldBytesSize: ModulusSize,

pub fn from_sec1_bytes(bytes: &[u8]) -> Result<VerifyingKey<C>, Error>

Initialize VerifyingKey from a SEC1-encoded public key.

pub fn from_affine( affine: <C as CurveArithmetic>::AffinePoint, ) -> Result<VerifyingKey<C>, Error>

Initialize VerifyingKey from an affine point.

Returns an Error if the given affine point is the additive identity (a.k.a. point at infinity).

pub fn from_encoded_point( public_key: &EncodedPoint<<C as Curve>::FieldBytesSize>, ) -> Result<VerifyingKey<C>, Error>

Initialize VerifyingKey from an EncodedPoint.

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

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

pub fn as_affine(&self) -> &<C as CurveArithmetic>::AffinePoint

Borrow the inner AffinePoint for this public key.

Trait Implementations

impl<C> AsRef<<C as CurveArithmetic>::AffinePoint> for VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic, <C as CurveArithmetic>::AffinePoint: FromEncodedPoint<C> + ToEncodedPoint<C>, <C as Curve>::FieldBytesSize: ModulusSize,

fn as_ref(&self) -> &<C as CurveArithmetic>::AffinePoint

Converts this type into a shared reference of the (usually inferred) input type.

impl<C> Clone for VerifyingKey<C>

where C: Clone + PrimeCurve + CurveArithmetic,

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<C> Debug for VerifyingKey<C>

where C: Debug + PrimeCurve + CurveArithmetic,

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

Formats the value using the given formatter.

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

where C: PrimeCurve + CurveArithmetic, D: Digest<OutputSize = <C as Curve>::FieldBytesSize> + FixedOutput, <C as CurveArithmetic>::AffinePoint: VerifyPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

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

Verify the signature against the given Digest output.

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

where C: PrimeCurve + CurveArithmetic, D: Digest<OutputSize = <C as Curve>::FieldBytesSize> + FixedOutput, <C as CurveArithmetic>::AffinePoint: VerifyPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8> + Add<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>>, <<<C as Curve>::FieldBytesSize as Add>::Output as Add<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>>>::Output: ArrayLength<u8>,

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

Verify the signature against the given Digest output.

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

where C: PrimeCurve + CurveArithmetic,

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 + CurveArithmetic, <C as CurveArithmetic>::Scalar: Invert<Output = CtOption<<C as CurveArithmetic>::Scalar>> + SignPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

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

Converts to this type from the input type.

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

where C: PrimeCurve + CurveArithmetic,

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 + CurveArithmetic, <C as CurveArithmetic>::Scalar: Invert<Output = CtOption<<C as CurveArithmetic>::Scalar>> + SignPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

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

Converts to this type from the input type.

impl<C> Ord for VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic, <C as CurveArithmetic>::AffinePoint: FromEncodedPoint<C> + ToEncodedPoint<C>, <C as Curve>::FieldBytesSize: ModulusSize,

fn cmp(&self, other: &VerifyingKey<C>) -> 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 + CurveArithmetic,

fn eq(&self, other: &VerifyingKey<C>) -> 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 + CurveArithmetic, <C as CurveArithmetic>::AffinePoint: FromEncodedPoint<C> + ToEncodedPoint<C>, <C as Curve>::FieldBytesSize: ModulusSize,

fn partial_cmp(&self, other: &VerifyingKey<C>) -> 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> PrehashVerifier<Signature<C>> for VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic, <C as CurveArithmetic>::AffinePoint: VerifyPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

fn verify_prehash( &self, prehash: &[u8], signature: &Signature<C>, ) -> Result<(), Error>

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

impl<C> PrehashVerifier<Signature<C>> for VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic + DigestPrimitive, <C as CurveArithmetic>::AffinePoint: VerifyPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8> + Add<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>>, <<<C as Curve>::FieldBytesSize as Add>::Output as Add<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>>>::Output: ArrayLength<u8>,

fn verify_prehash( &self, prehash: &[u8], signature: &Signature<C>, ) -> Result<(), Error>

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

impl<C> TryFrom<&[u8]> for VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic, <C as CurveArithmetic>::AffinePoint: FromEncodedPoint<C> + ToEncodedPoint<C>, <C as Curve>::FieldBytesSize: ModulusSize,

type Error = Error

The type returned in the event of a conversion error.

fn try_from(bytes: &[u8]) -> Result<VerifyingKey<C>, Error>

Performs the conversion.

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

where C: PrimeCurve + CurveArithmetic + DigestPrimitive, <C as CurveArithmetic>::AffinePoint: VerifyPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

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

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

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

where C: PrimeCurve + CurveArithmetic + DigestPrimitive, <C as CurveArithmetic>::AffinePoint: VerifyPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8> + Add<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>>, <<<C as Curve>::FieldBytesSize as Add>::Output as Add<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B1>>>::Output: ArrayLength<u8>,

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

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

impl<C> Copy for VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic,

impl<C> Eq for VerifyingKey<C>

where C: PrimeCurve + CurveArithmetic,