mpz_abs(uMinusV, uMinusV);//We don't calculate gcd everytime, we do 100 multiplications and use the result to//extract the gcd, since it must be among the productmpz_mul(gMul, gMul, uMinusV);if(steps%100==0) { mpz_gcd(g, gMul, n);if(mpz_cmp_ui(g,1) !=0) { found ...
mpz_init(cofactor);char*str1, *str2, *result;intB1 = INITB1, B2 = INITB2, curves = INITCURVES;// Zunaechst eine einfache Probedivision.trial(number, factor,3e3);if(mpz_cmp_si(factor,1) ==0) {// Zweite Strategie: Pollard-Rho.do{ rho(number, factor,4e4); }while(mpz_cmp(fact...