Struct Modulus 

pub struct Modulus<const LIMBS: usize>(pub Odd<Uint<LIMBS>>);

The modulus used in RSA or Paillier whose properties need to be proved.

Tuple Fields

0: Odd<Uint<LIMBS>>

Implementations

impl<const MODULUS_LIMBS: usize> Modulus<MODULUS_LIMBS>

pub fn new<const PRIME_LIMBS: usize>(dk: &Primes<PRIME_LIMBS>) -> Self

where Uint<PRIME_LIMBS>: Concat<Output = Uint<MODULUS_LIMBS>>,

pub fn size_for_hashing<'a>(&self) -> [u8; 2]

Number of bytes required to represent the modulus. The number itself expressed as bytes so that it can be hashed in

pub fn is_greater_than(&self, rhs: &Uint<MODULUS_LIMBS>) -> bool

Returns true if the modulus > rhs

Trait Implementations

impl<const LIMBS: usize> Clone for Modulus<LIMBS>

fn clone(&self) -> Modulus<LIMBS>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<const LIMBS: usize> Debug for Modulus<LIMBS>

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

Formats the value using the given formatter.

impl<const LIMBS: usize> PartialEq for Modulus<LIMBS>

fn eq(&self, other: &Modulus<LIMBS>) -> bool

Tests for self and other values to be equal, and is used by ==.

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

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<const LIMBS: usize> Eq for Modulus<LIMBS>

impl<const LIMBS: usize> StructuralPartialEq for Modulus<LIMBS>