 Michele Orrù
|
4ebb875769
Deal with non-rsa public key algorithms.
|
11 年之前 |
|
Michele Orrù
|
579a54f77b
Oops, forgot primes.h header and indiana.c.
|
11 年之前 |
|
Michele Orrù
|
575f12f07a
Indiana, the ssl explorer.
|
11 年之前 |
|
Michele Orrù
|
17893b2fc2
Re-implementing timeouts using select().
|
11 年之前 |
|
Michele Orrù
|
12c4385678
Nicer status messages.
|
11 年之前 |
|
Michele Orrù
|
3e7ecd1c37
Print also e, N in metadata.
|
11 年之前 |
|
Michele Orrù
|
cb955a4287
Creating run_question().
|
11 年之前 |
|
Michele Orrù
|
1238cc42c1
Add bland check for the primes database file to exist.
|
11 年之前 |
|
Michele Orrù
|
0d853f080f
Experimenting with OpenMPI.
|
11 年之前 |
|
Michele Orrù
|
0fa6188289
Again on off-by-one errors.
|
11 年之前 |
|
Michele Orrù
|
434a76cc27
Remark the use and the semantics of the yield statement in Dixon.
|
11 年之前 |
|
Michele Orrù
|
4b4c292d78
Fixing indexes, random typos in thesis.
|
11 年之前 |
|
Michele Orrù
|
8ad0a303da
Avoid recomputation of `a` in fermat, we have it already.
|
11 年之前 |
|
Michele Orrù
|
22458ebd50
Implementing BN_value_two().
|
11 年之前 |
|
Michele Orrù
|
d6be600166
Preparing a QA_library init, before the integration with openMPI.
|
11 年之前 |
|
Michele Orrù
|
17b43ae625
Timeouts.
|
11 年之前 |
|
Michele Orrù
|
0cd2d0b42d
New semantic for exit status codes.
|
11 年之前 |
|
Michele Orrù
|
673cf9c83f
$ cut -d',' -f 2 top-1m.csv > sites.txt
|
11 年之前 |
|
Michele Orrù
|
6037e6c5ef
Cleanup.
|
11 年之前 |
|
Michele Orrù
|
08c833d660
Re-writing Pollard-Brent pseudocode accrding to the original Brent's article.
|
11 年之前 |
|
Michele Orrù
|
497656b0ae
Implementing Brent's variant for the ρ method.
|
11 年之前 |
|
Michele Orrù
|
422859adaa
Metadata question: display real N bits, and e bits.
|
11 年之前 |
|
Michele Orrù
|
3ef50e5459
BN_min() and BN_abs() utility function.
|
11 年之前 |
|
Michele Orrù
|
bfa0e98a8d
Re-implementing pollard's p-1 factorization method, using the prime pool.
|
11 年之前 |
|
Michele Orrù
|
ac55106982
Adopting qa_RSA_recover() in old algorithms.
|
11 年之前 |
|
Michele Orrù
|
53fbc520fc
RSA recovery function, brings the private key from <N, e> and p.
|
11 年之前 |
|
Michele Orrù
|
a395fa9f19
Dixon's factorization method implemented, but not yet tested.
|
11 年之前 |
|
Michele Orrù
|
41b3fb64ee
Dixon's smooth() function, for testing smoothness also among negative ints.
|
11 年之前 |
|
Michele Orrù
|
ef7404a270
Introducting prime iterators.
|
11 年之前 |
|
Michele Orrù
|
ad8f26695c
Breaching the core.
|
11 年之前 |
