Revision as of 15:40, 23 February 2007 edit 213.100.52.32 (talk) No edit summary ← Previous edit		Revision as of 17:49, 5 June 2007 edit undo 194.146.217.2 (talk) →Algorithm Next edit →
Line 22: g(x,n) = \left\{\begin{matrix} n & x\in G_0\\ 2n \\ \bmod p & x\in G_1\\ n+1 \\ \bmod p & x\in G_2 \end{matrix}\right. </math>

Pollard's rho algorithm for logarithms: Difference between revisions