Struct ModProof 

pub struct ModProof {
    pub reps: Vec<ModRep>,
}

Proof: r_mod repetitions.

Fields

reps: Vec<ModRep>

Implementations

impl ModProof

pub fn prove<R: CryptoRng + ?Sized>( rng: &mut R, tx: &Transcript, params: &Params, n: &BoxedUint, w: &ModWitness<'_>, ) -> Result<Self>

Proves that N = p1·p2 is well formed.

pub fn verify( &self, tx: &Transcript, params: &Params, n: &BoxedUint, min_bits: u32, ) -> Result<()>

Verifies the proof for N; min_bits is the required bit length of N.

pub fn encoded_len(params: &Params, n_bits: u32) -> usize

Encoded length: r_mod · (1 + 2·⌈bits(N)/8⌉).

pub fn encode(&self, n_bits: u32) -> Result<Vec<u8>>

Per repetition: byte a | b << 1, then x and z as fixed-width big-endian.

pub fn decode(bytes: &[u8], params: &Params, n_bits: u32) -> Result<Self>

Trait Implementations

impl Clone for ModProof

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for ModProof

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

Formats the value using the given formatter.

impl Eq for ModProof

impl PartialEq for ModProof

fn eq(&self, other: &Self) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for ModProof