pub fn verify_factorization(n: &BigInt, p: &BigInt, q: &BigInt) -> bool
A nontrivial factorization p·q = n (1 < p, q < n) — the re-checkable witness every attack returns.
p·q = n
1 < p, q < n