[−][src]Function grammers_crypto::factorize::factorize
pub fn factorize(pq: u64) -> (u64, u64)
Factorize the given number into its two prime factors.
The algorithm here is a faster variant of [Pollard's rho algorithm], published by [Richard Brent], based on https://comeoncodeon.wordpress.com/2010/09/18/pollard-rho-brent-integer-factorization/.
Pollard's rho algorithm: https://en.wikipedia.org/wiki/Pollard%27s_rho_algorithm Richard Brent: https://maths-people.anu.edu.au/~brent/pd/rpb051i.pdf