Revision as of 09:15, 9 August 2009 edit Charvest (talk \| contribs) 1,766 edits {{Number-theoretic algorithms}} ← Previous edit		Revision as of 16:46, 22 August 2009 edit undo 84.153.12.71 (talk) order of group does not have to be prime - in fact, it probably is not Next edit →
Line 7: ==Algorithm== Let <math>G</math> be a cyclic group of ~~prime~~ order <math>p</math>, and given <math>a,b\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