Function scicrypt_numbertheory::gen_prime

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

Generates a uniformly random prime number of a given bit length. So, the number contains bit_length bits, of which the first and the last bit are always 1.