Revision as of 18:25, 30 June 2012 edit 188.230.130.59 (talk) →Complexity ← Previous edit		Revision as of 22:33, 5 July 2012 edit undo 72.37.244.76 (talk) →Algorithm Next edit →
Line 7: ==Algorithm== Let <math>G</math> be a cyclic group of order <math>p</math>, and given <math>a\alpha,b \beta\in G</math>, and a partition <math>G = G_0\cup G_1\cup G_2</math>, let <math>f:G\to G</math> be a map <math>

Pollard's rho algorithm for logarithms: Difference between revisions