libplayrsa::primes
pub fn rsa_prime(size: usize, e: &BigUint) -> BigUint
An prime suitable for RSA with exponent e The prime p - 1 can't be a multiple of e
e
p