Let's say, we have a large number $n=181937053$ and $f(x)=x^2+1$. And also we know that $n=12391 \times 14683$.
The problem is that ,using Pollard rho method, can we find the algorithm iteration times need to factor this number? ($x_0,y_0 = 2$)
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
9 months ago