Function rsa::prime::probably_prime_miller_rabin

pub fn probably_prime_miller_rabin(n: &BigUint, reps: usize, force2: bool) -> bool

Reports whether n passes reps rounds of the Miller-Rabin primality test, using pseudo-randomly chosen bases. If force2 is true, one of the rounds is forced to use base 2.

See Handbook of Applied Cryptography, p. 139, Algorithm 4.24.