Loading tests/rho_pollard.c 0 → 100644 +18 −0 Original line number Diff line number Diff line #include "bignum.h" // En utilisant l'algorithme rho de Pollard, factorisez les entiers suivants unsigned long int n1 = 3469 * 4363; unsigned long int n2 = 15241 * 18119; unsigned long int n3 = 366127 * 416797; unsigned long int n4 = 15651941 * 15485863; bignum_t n5 = bignum_mul(bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(127)), bignum_from_int(1)), bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(61)), bignum_from_int(1))); bignum_t n6 = bignum_mul(bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(607)), bignum_from_int(1)), bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(2203)), bignum_from_int(1))); Loading
tests/rho_pollard.c 0 → 100644 +18 −0 Original line number Diff line number Diff line #include "bignum.h" // En utilisant l'algorithme rho de Pollard, factorisez les entiers suivants unsigned long int n1 = 3469 * 4363; unsigned long int n2 = 15241 * 18119; unsigned long int n3 = 366127 * 416797; unsigned long int n4 = 15651941 * 15485863; bignum_t n5 = bignum_mul(bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(127)), bignum_from_int(1)), bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(61)), bignum_from_int(1))); bignum_t n6 = bignum_mul(bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(607)), bignum_from_int(1)), bignum_sub(bignum_pow(bignum_from_int(2), bignum_from_int(2203)), bignum_from_int(1)));