gen_rsa_modulus

scicrypt_numbertheory

Function gen_rsa_modulus 

Source 
pub fn gen_rsa_modulus<R: SecureRng>(
    bit_length: u32,
    rng: &mut GeneralRng<R>,
) -> (UnsignedInteger, UnsignedInteger)
Expand description

Generates a uniformly random RSA modulus, which is the product of two safe primes $p$ and $q$. This method returns both the modulus and $\lambda$, which is the least common multiple of $p - 1$ and $q - 1$.