Pollard's rho algorithm for logarithms: Difference between revisions

Revision as of 15:49, 1 January 2006

Revision as of 13:58, 11 January 2006

Line 7:

==Example==

Consider, for example, the group generated by 2 modulo <math>N=1019</math> (the order of the group is <math>n=509</math>). The algorithm is implemented by the following [[C plus plus|C++]] program:

#include <stdio.h>