Function scicrypt_numbertheory::gen_rsa_modulus

pub fn gen_rsa_modulus<R: SecureRng>(
    bit_length: u32, 
    rng: &mut GeneralRng<R>
) -> (Integer, Integer)

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$.