Pollard's rho algorithm for logarithms: Difference between revisions

Revision as of 02:14, 14 March 2013

Revision as of 19:35, 24 March 2013

Line 53:

Consider, for example, the group generated by 2 modulo <math>N=1019</math> (the order of the group is <math>n=1018</math>, 2

generates the group of units modulo 1019). The algorithm is implemented by the following [[C++]] program:

<source lang="c">