Function scicrypt_numbertheory::gen_safe_prime

source · [−]
pub fn gen_safe_prime<R: SecureRng>(
    bit_length: u32,
    rng: &mut GeneralRng<R>
) -> UnsignedInteger
Expand description

Generates a uniformly random safe prime number of a given bit length. This is a prime $p$ of the form $p = 2q + 1$, where $q$ is a smaller prime.