Pollard's kangaroo algorithm: Difference between revisions

Content deleted Content added
Reverted 1 edit by Pollardgood (talk): Test? (TW)
Line 25:
::<math>x_N = y_j \Rightarrow \alpha^{b+d} = \beta\alpha^{d_j} \Rightarrow \beta = \alpha^{b+d-d_j} \Rightarrow
x \equiv b+d-d_j \pmod{n}</math>
:and so we are done.
:and so we are done.Pollard rho kangaroo <ref>https://gitlab.com/bitfranke/pollard-rho-kangaroo</ref>
 
:B) <math>d_i > b-a+d</math>. If this occurs, then the algorithm has failed to find <math>x</math>. Subsequent attempts can be made by changing the choice of <math>S</math> and/or <math>f</math>.