Pollard's rho algorithm for logarithms: Difference between revisions

Content deleted Content added
pollards lamda(kangaroo) is a separate algorithm with its own wiki page, removed spam link referencing it
Tag: references removed
Complexity: pollard
Line 101:
 
==Complexity==
The running time is approximately <math>\mathcal{O}(\sqrt{n})</math>. If used together with the [[Pohlig–Hellman algorithm]], the running time of the combined algorithm is <math>\mathcal{O}(\sqrt{p})</math>, where <math>p</math> is the largest prime factor of <math>n</math>.Pollard rho kangaroo algorithm <ref>https://gitlab.com/bitfranke/pollard-rho-kangaroo</ref>
 
==References==