0
I Use This!
High Activity

Commits : Listings

Analyzed about 8 hours ago. based on code collected about 8 hours ago.
May 19, 2018 — May 19, 2019
Commit Message Contributor Files Modified Lines Added Lines Removed Code Location Date
added sieving parameters Anon32 More... almost 12 years ago
polyselect.c: added print of time, check for non-zero f[d] TIMINGS: added several timings Anon32 More... almost 12 years ago
added skewness Anon32 More... almost 12 years ago
added polynomial used for factorization of RSA-140 Anon32 More... almost 12 years ago
the number of roots of a degree-d polynomial mod p cannot exceed d! Anon32 More... almost 12 years ago
added new default parameters for larger inputs Anon32 More... almost 12 years ago
added several polynomials (some used for factorizations, and some produced by polyselect, as a comparison) Anon32 More... almost 12 years ago
implemented methods 2 & 3 from Bernstein 2006 slides Anon32 More... almost 12 years ago
alpha.mpl: added routine to estimate valuation on "bad" primes polyselect.c: added computation of discriminant, and estimate on "bad" primes TIMINGS: added new timings Anon32 More... almost 12 years ago
Speeded up finding sieve reports a bit Anon32 More... almost 12 years ago
Maple script to compute alpha(F) Anon32 More... almost 12 years ago
added computation of alpha(F) - still some debugging to be made Anon32 More... almost 12 years ago
Added fflush() when printing relations. Some warnings fixed. Anon32 More... almost 12 years ago
File was missing in last commit. Anon32 More... almost 12 years ago
Small primes are sieved on L1 size blocks of sieve array. Anon32 More... almost 12 years ago
Small cleanups (was a lingering locally modified file, pay it no heed) Anon32 More... almost 12 years ago
removed q0 from poly file (not needed any more) Anon32 More... almost 12 years ago
total number of relations was wrong in case of several files Anon32 More... almost 12 years ago
added function (roots_mod) to compute number of roots of f mod p Anon32 More... almost 12 years ago
print version and arguments of polyselect in generated file Anon32 More... almost 12 years ago
print warning instead of error when a prime does not divide norm Anon32 More... almost 12 years ago
some utility programs: fk2cwi.c converts polynomials from Franke/Kleinjung and GGNFS format to CWI format ggnfs2cado.c converts relations from GGNFS (or Franke/Kleinjung) format to the CADO format Anon32 More... almost 12 years ago
use now dynamic arrays for useful_primes and reports (no overflow any more) Anon32 More... almost 12 years ago
added some more warning in factor() to detect possible lost relations Anon32 More... almost 12 years ago
might be useful Anon32 More... almost 12 years ago
fixed possible error Anon32 More... almost 12 years ago
Cleaned the code, added comments... Anon32 More... almost 12 years ago
decreased REPS from 10 to 1 flush relations Anon32 More... almost 12 years ago
added number of tests in mpz_probab_prime_p as a macro Anon32 More... almost 12 years ago
check that a and b are coprime, and some other small changes Anon32 More... almost 12 years ago