pub fn pollard_p_minus_1(n: &BigInt, bound: u64) -> Option<(BigInt, BigInt)>Expand description
Pollard’s p − 1: catches a prime with a smooth p − 1. Raising a base to B! collapses to 1
modulo any prime whose p − 1 is B-smooth, and gcd(a − 1, N) exposes it — the smoothness is the
structure.