Pollard's rho algorithm for logarithms: Difference between revisions

Revision as of 22:43, 2 September 2019

Revision as of 18:55, 2 December 2019

Line 59:

void new_xab( int& x, int& a, int& b ) {

switch ( x%3 ) {

case 0: x = x*x % N; a = a*2 % n; b = b*2 % n; break;

case 1: x = x*alpha % N; a = (a+1) % n; break;

Line 69:

int x=1, a=0, b=0;

int X=x, A=a, B=b;

for (int i = 1; i < n; ++i ) {

new_xab( x, a, b );

new_xab( X, A, B );

new_xab( X, A, B );

printf( "%3d %4d %3d %3d %4d %3d %3d\n", i, x, a, b, X, A, B );

if ( x == X ) break;

}

return 0;