Struct snarkvm_wasm::algorithms::crh::PedersenCRHGadget

pub struct PedersenCRHGadget<G, F, GG> where
    G: Group,
    F: Field,
    GG: GroupGadget<G, F>,  { /* fields omitted */ }

Trait Implementations

impl<F, G, GG, S> CRHGadget<PedersenCRH<G, S>, F> for PedersenCRHGadget<G, F, GG> where
    G: Group,
    S: PedersenSize,
    F: Field,
    GG: GroupGadget<G, F>, 

type OutputGadget = GG

type ParametersGadget = PedersenCRHParametersGadget<G, S, F, GG>

pub fn check_evaluation_gadget<CS>(
    cs: CS,
    parameters: &<PedersenCRHGadget<G, F, GG> as CRHGadget<PedersenCRH<G, S>, F>>::ParametersGadget,
    input: Vec<UInt8, Global>
) -> Result<<PedersenCRHGadget<G, F, GG> as CRHGadget<PedersenCRH<G, S>, F>>::OutputGadget, SynthesisError> where
    CS: ConstraintSystem<F>, 

impl<G, F, GG> Clone for PedersenCRHGadget<G, F, GG> where
    G: Clone + Group,
    F: Clone + Field,
    GG: Clone + GroupGadget<G, F>, 

pub fn clone(&self) -> PedersenCRHGadget<G, F, GG>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<G, F, GG> Debug for PedersenCRHGadget<G, F, GG> where
    G: Debug + Group,
    F: Debug + Field,
    GG: Debug + GroupGadget<G, F>, 

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

Formats the value using the given formatter.

impl<F, G, GG, S> MaskedCRHGadget<PedersenCRH<G, S>, F> for PedersenCRHGadget<G, F, GG> where
    G: Group,
    S: PedersenSize,
    F: PrimeField,
    GG: GroupGadget<G, F>, 

pub fn check_evaluation_gadget_masked<CS>(
    cs: CS,
    parameters: &<PedersenCRHGadget<G, F, GG> as CRHGadget<PedersenCRH<G, S>, F>>::ParametersGadget,
    input: Vec<UInt8, Global>,
    mask_parameters: &<PedersenCRHGadget<G, F, GG> as CRHGadget<PedersenCRH<G, S>, F>>::ParametersGadget,
    mask: Vec<UInt8, Global>
) -> Result<<PedersenCRHGadget<G, F, GG> as CRHGadget<PedersenCRH<G, S>, F>>::OutputGadget, SynthesisError> where
    CS: ConstraintSystem<F>, 

Evaluates a masked Pedersen hash on the given input using the given mask. The algorithm is based on the description in https://eprint.iacr.org/2020/190.pdf, which relies on the homomorphic properties of Pedersen hashes. First, the mask is extended to ensure constant hardness - for each bit, 0 => 01, 1 => 10. Then, denoting input bits as m_i, mask bits as p_i and bases as h_i, computes sum of (g_i * 1[p_i = 0] + g_i^{-1} * 1[p_i = 1])^{m_i \xor p_i} for all i. Finally, the hash of the mask itself, being sum of h_i^{p_i} for all i, is added to the computed sum. This algorithm ensures that each bit in the hash is affected by the mask and that the final hash remains the same as if no mask was used.

fn extend_mask<CS>(
    CS,
    mask: &[UInt8]
) -> Result<Vec<UInt8, Global>, SynthesisError> where
    CS: ConstraintSystem<F>, 

Extends the mask such that 0 => 01, 1 => 10.

impl<G, F, GG> PartialEq<PedersenCRHGadget<G, F, GG>> for PedersenCRHGadget<G, F, GG> where
    G: PartialEq<G> + Group,
    F: PartialEq<F> + Field,
    GG: PartialEq<GG> + GroupGadget<G, F>, 

pub fn eq(&self, other: &PedersenCRHGadget<G, F, GG>) -> bool

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

pub fn ne(&self, other: &PedersenCRHGadget<G, F, GG>) -> bool

This method tests for !=.

impl<G, F, GG> Eq for PedersenCRHGadget<G, F, GG> where
    G: Eq + Group,
    F: Eq + Field,
    GG: Eq + GroupGadget<G, F>, 

impl<G, F, GG> StructuralEq for PedersenCRHGadget<G, F, GG> where
    G: Group,
    F: Field,
    GG: GroupGadget<G, F>, 

impl<G, F, GG> StructuralPartialEq for PedersenCRHGadget<G, F, GG> where
    G: Group,
    F: Field,
    GG: GroupGadget<G, F>,