Struct cggmp21::key_refresh::PregeneratedPrimes

pub struct PregeneratedPrimes<L = SecurityLevel128> { /* private fields */ }

To speed up computations, it’s possible to supply data to the algorithm generated ahead of time

Implementations

impl<L: SecurityLevel> PregeneratedPrimes<L>

pub fn new(p: Integer, q: Integer) -> Option<Self>

Constructs pregenerated primes from two big numbers

Returns None if big numbers are smaller than 4 * L::SECURITY_BITS

Function doesn’t validate that provided numbers are primes. If they’re not, key refresh protocol should fail with some ZK proof error.

pub fn split(self) -> (Integer, Integer)

Returns p, q

pub fn generate<R: RngCore>(rng: &mut R) -> Self

Generates primes. Takes some time.

Trait Implementations

impl<L: Clone> Clone for PregeneratedPrimes<L>

fn clone(&self) -> PregeneratedPrimes<L>

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<L: Debug> Debug for PregeneratedPrimes<L>

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

Formats the value using the given formatter.

impl<'de, L> Deserialize<'de> for PregeneratedPrimes<L>

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl<L> Serialize for PregeneratedPrimes<L>

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

where __S: Serializer,

Serialize this value into the given Serde serializer.