pollard rho算法

[apolloliu]

int pollard_rho(int n, int c)///c为自己设定的某值 { int x, y, d, i = 1, k = 2; x = rand() % (n - 1) + 1; y = x; while (true) { ++i; x = (modular_multi(x, x, n) + c) % n; d = gcd(y - x, n); if (1 < d && d < n) return d; if (x == y) return n; if (i == k) y = x, k <<= 1; } }

[skyhit]

what is this?

[apolloliu]

It is an algorithm named pollard rho.

[skyhit]

this is not related to this repository, right/