Pollard's rho algorithm for logarithms: Difference between revisions

Revision as of 20:00, 17 January 2008

Revision as of 20:03, 17 January 2008

Line 56:

#include <stdio.h>

const int n = 1018, N = n + 1; /* N = 1019 -- prime */

const int alpha = 2; /* generator */

const int beta = 5; /* 2^{10} = 1024 = 5 (N) */

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

switch( x%3 ) {

Line 66 ⟶ 68:

}

}

int main() {

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