Revision as of 20:04, 10 March 2009 edit Quadrescence (talk \| contribs) 88 edits m →Algorithm ← Previous edit		Revision as of 23:49, 25 April 2009 edit undo 91.78.251.107 (talk) →Algorithm <sup> -1 </sup> Next edit →
Line 46: :## ''r'' ← ''b<sub>i</sub>'' - ''b<sub>2i</sub>'' :## If r = 0 return failure :## x ← ''r<sup> -1 </sup>''(''a<sub>2i</sub>'' - ''a<sub>i</sub>'') mod ''p'' :## return x :# If ''x<sub>i</sub>'' ≠ ''x<sub>2i</sub>'' then ''i'' ← ''i+1'', and go to step 2.

Pollard's rho algorithm for logarithms: Difference between revisions