Trait coins_bip32::ecdsa::signature::DigestSigner

source · 
pub trait DigestSigner<D, S>
where
    D: Digest,
{
    // Required method
    fn try_sign_digest(&self, digest: D) -> Result<S, Error>;

    // Provided method
    fn sign_digest(&self, digest: D) -> S { ... }
}
Expand description

Sign the given prehashed message Digest using Self.

§Notes

This trait is primarily intended for signature algorithms based on the Fiat-Shamir heuristic, a method for converting an interactive challenge/response-based proof-of-knowledge protocol into an offline digital signature through the use of a random oracle, i.e. a digest function.

The security of such protocols critically rests upon the inability of an attacker to solve for the output of the random oracle, as generally otherwise such signature algorithms are a system of linear equations and therefore doing so would allow the attacker to trivially forge signatures.

To prevent misuse which would potentially allow this to be possible, this API accepts a Digest instance, rather than a raw digest value.

Required Methods§

source

fn try_sign_digest(&self, digest: D) -> Result<S, Error>

Attempt to sign the given prehashed message Digest, returning a digital signature on success, or an error if something went wrong.

Provided Methods§

source

fn sign_digest(&self, digest: D) -> S

Sign the given prehashed message Digest, returning a signature.

Panics in the event of a signing error.

Implementations on Foreign Types§

source§

impl<C, D> DigestSigner<D, (Signature<C>, RecoveryId)> for SigningKey<C>
where C: PrimeCurve + CurveArithmetic + DigestPrimitive, D: Digest, <C as CurveArithmetic>::Scalar: Invert<Output = CtOption<<C as CurveArithmetic>::Scalar>> + SignPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

source§

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

source§

impl<C, D> DigestSigner<D, Signature<C>> for SigningKey<C>
where C: PrimeCurve + CurveArithmetic + DigestPrimitive, D: Digest<OutputSize = <C as Curve>::FieldBytesSize> + FixedOutput, <C as CurveArithmetic>::Scalar: Invert<Output = CtOption<<C as CurveArithmetic>::Scalar>> + SignPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

Sign message digest using a deterministic ephemeral scalar (k) computed using the algorithm described in RFC6979 § 3.2.

source§

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

source§

impl<C, D> DigestSigner<D, SignatureWithOid<C>> for SigningKey<C>
where C: PrimeCurve + CurveArithmetic + DigestPrimitive, D: AssociatedOid + Digest<OutputSize = <C as Curve>::FieldBytesSize> + FixedOutput, <C as CurveArithmetic>::Scalar: Invert<Output = CtOption<<C as CurveArithmetic>::Scalar>> + SignPrimitive<C>, <<C as Curve>::FieldBytesSize as Add>::Output: ArrayLength<u8>,

source§

fn try_sign_digest(&self, msg_digest: D) -> Result<SignatureWithOid<C>, Error>

source§

impl<D> DigestSigner<D, Signature> for SigningKey
where D: Digest<OutputSize = UInt<UInt<UInt<UInt<UInt<UInt<UTerm, B1>, B0>, B0>, B0>, B0>, B0>> + FixedOutput,

source§

fn try_sign_digest(&self, digest: D) -> Result<Signature, Error>

Implementors§