Struct snarkvm_wasm::algorithms::crh::PedersenCRHGadget[][src]

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>, 
[src]

type OutputGadget = GG

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

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

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

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

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>, 
[src]

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>, 
[src]

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.

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

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

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

Auto Trait Implementations

impl<G, F, GG> RefUnwindSafe for PedersenCRHGadget<G, F, GG> where
    F: RefUnwindSafe,
    G: RefUnwindSafe,
    GG: RefUnwindSafe

impl<G, F, GG> !Send for PedersenCRHGadget<G, F, GG>

impl<G, F, GG> !Sync for PedersenCRHGadget<G, F, GG>

impl<G, F, GG> Unpin for PedersenCRHGadget<G, F, GG> where
    F: Unpin

impl<G, F, GG> UnwindSafe for PedersenCRHGadget<G, F, GG> where
    F: UnwindSafe,
    G: RefUnwindSafe,
    GG: RefUnwindSafe

Blanket Implementations

impl<T> Any for T where
    T: 'static + ?Sized
[src]

impl<T> Borrow<T> for T where
    T: ?Sized
[src]

impl<T> BorrowMut<T> for T where
    T: ?Sized
[src]

impl<Q, K> Equivalent<K> for Q where
    K: Borrow<Q> + ?Sized,
    Q: Eq + ?Sized
[src]

impl<T> From<T> for T[src]

impl<T, U> Into<U> for T where
    U: From<T>, 
[src]

impl<T> Pointable for T

type Init = T

The type for initializers.

impl<T> Same<T> for T

type Output = T

Should always be Self

impl<T> ToOwned for T where
    T: Clone
[src]

type Owned = T

The resulting type after obtaining ownership.

impl<T, U> TryFrom<U> for T where
    U: Into<T>, 
[src]

type Error = Infallible

The type returned in the event of a conversion error.

impl<T, U> TryInto<U> for T where
    U: TryFrom<T>, 
[src]

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.

impl<V, T> VZip<V> for T where
    V: MultiLane<T>,