Struct tari_crypto::signatures::SchnorrSignature

pub struct SchnorrSignature<P, K> { /* fields omitted */ }

Implementations

impl<P, K> SchnorrSignature<P, K> where
    P: PublicKey<K = K>,
    K: SecretKey, 

pub fn new(public_nonce: P, signature: K) -> Self

pub fn calc_signature_verifier(&self) -> P

pub fn sign(
    secret: K,
    nonce: K,
    challenge: &[u8]
) -> Result<Self, SchnorrSignatureError> where
    K: Add<Output = K> + Mul<P, Output = P> + Mul<Output = K>, 

pub fn verify_challenge<'a>(&self, public_key: &'a P, challenge: &[u8]) -> bool where
    &'b K: Mul<&'a P, Output = P>,
    &'b P: Add<P, Output = P>, 

pub fn verify<'a>(&self, public_key: &'a P, challenge: &K) -> bool where
    &'b K: Mul<&'a P, Output = P>,
    &'b P: Add<P, Output = P>, 

pub fn get_signature(&self) -> &K

pub fn get_public_nonce(&self) -> &P

Trait Implementations

impl<'a, 'b, P, K> Add<&'b SchnorrSignature<P, K>> for &'a SchnorrSignature<P, K> where
    P: PublicKey<K = K>,
    &'a P: Add<&'b P, Output = P>,
    K: SecretKey,
    &'a K: Add<&'b K, Output = K>, 

type Output = SchnorrSignature<P, K>

The resulting type after applying the + operator.

fn add(self, rhs: &'b SchnorrSignature<P, K>) -> SchnorrSignature<P, K>

Performs the + operation.

impl<'a, P, K> Add<SchnorrSignature<P, K>> for &'a SchnorrSignature<P, K> where
    P: PublicKey<K = K>,
    &'a P: Add<&'b P, Output = P>,
    K: SecretKey,
    &'a K: Add<&'b K, Output = K>, 

type Output = SchnorrSignature<P, K>

The resulting type after applying the + operator.

fn add(self, rhs: SchnorrSignature<P, K>) -> SchnorrSignature<P, K>

Performs the + operation.

impl<P: Clone, K: Clone> Clone for SchnorrSignature<P, K>

fn clone(&self) -> SchnorrSignature<P, K>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<P: Copy, K: Copy> Copy for SchnorrSignature<P, K>

impl<P: Debug, K: Debug> Debug for SchnorrSignature<P, K>

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

Formats the value using the given formatter.

impl<P, K> Default for SchnorrSignature<P, K> where
    P: PublicKey<K = K>,
    K: SecretKey, 

fn default() -> Self

Returns the “default value” for a type.

impl<'de, P, K> Deserialize<'de> for SchnorrSignature<P, K> where
    P: Deserialize<'de>,
    K: Deserialize<'de>, 

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error> where
    __D: Deserializer<'de>, 

Deserialize this value from the given Serde deserializer.

impl<P: Eq, K: Eq> Eq for SchnorrSignature<P, K>

impl From<SchnorrSignature<RistrettoPublicKey, RistrettoSecretKey>> for StackItem

fn from(item: RistrettoSchnorr) -> Self

Performs the conversion.

impl<P: Hash, K: Hash> Hash for SchnorrSignature<P, K>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

pub fn hash_slice<H>(data: &[Self], state: &mut H) where
    H: Hasher, 

Feeds a slice of this type into the given Hasher.

impl<P, K> Ord for SchnorrSignature<P, K> where
    P: Eq + Ord,
    K: Eq + ByteArray, 

Provide an efficient ordering algorithm for Schnorr signatures. It’s probably not a good idea to implement Ord for secret keys, but in this instance, the signature is publicly known and is simply a scalar, so we use the hex representation of the scalar as the canonical ordering metric. This conversion is done if and only if the public nonces are already equal, otherwise the public nonce ordering determines the SchnorrSignature order.

fn cmp(&self, other: &Self) -> Ordering

This method returns an Ordering between self and other.

#[must_use]pub fn max(self, other: Self) -> Self

Compares and returns the maximum of two values.

#[must_use]pub fn min(self, other: Self) -> Self

Compares and returns the minimum of two values.

#[must_use]pub fn clamp(self, min: Self, max: Self) -> Self

Restrict a value to a certain interval.

impl<P: PartialEq, K: PartialEq> PartialEq<SchnorrSignature<P, K>> for SchnorrSignature<P, K>

fn eq(&self, other: &SchnorrSignature<P, K>) -> bool

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

fn ne(&self, other: &SchnorrSignature<P, K>) -> bool

This method tests for !=.

impl<P, K> PartialOrd<SchnorrSignature<P, K>> for SchnorrSignature<P, K> where
    P: Eq + Ord,
    K: Eq + ByteArray, 

fn partial_cmp(&self, other: &Self) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

#[must_use]pub fn lt(&self, other: &Rhs) -> bool

This method tests less than (for self and other) and is used by the < operator.

#[must_use]pub fn le(&self, other: &Rhs) -> bool

This method tests less than or equal to (for self and other) and is used by the <= operator.

#[must_use]pub fn gt(&self, other: &Rhs) -> bool

This method tests greater than (for self and other) and is used by the > operator.

#[must_use]pub fn ge(&self, other: &Rhs) -> bool

This method tests greater than or equal to (for self and other) and is used by the >= operator.

impl<P, K> Serialize for SchnorrSignature<P, K> where
    P: Serialize,
    K: Serialize, 

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error> where
    __S: Serializer, 

Serialize this value into the given Serde serializer.

impl<P, K> StructuralEq for SchnorrSignature<P, K>

impl<P, K> StructuralPartialEq for SchnorrSignature<P, K>