 Michele Orrù
|
ac55106982
Adopting qa_RSA_recover() in old algorithms.
|
11 lat temu |
|
Michele Orrù
|
a395fa9f19
Dixon's factorization method implemented, but not yet tested.
|
11 lat temu |
|
Michele Orrù
|
41b3fb64ee
Dixon's smooth() function, for testing smoothness also among negative ints.
|
11 lat temu |
|
Michele Orrù
|
ad8f26695c
Breaching the core.
|
11 lat temu |
|
Michele Orrù
|
6d63171496
Rewriting Dixon's factorization method: matrix utilities.
|
11 lat temu |
|
Michele Orrù
|
3437ddba11
Establishing standard return values for questions.
|
11 lat temu |
|
Michele Orrù
|
8b9e7b4acb
New "-a" option, for slecting a specific attack.
|
11 lat temu |
|
Michele Orrù
|
6966588152
Refactoring: adding ask_rsa() to question_t as callback for rsa keys specifically.
|
11 lat temu |
|
Michele Orrù
|
2a775b9aaf
make check available also for test_qa and test_qa_sock.
|
11 lat temu |
|
Michele Orrù
|
1b575acff5
Refactoring: moving all header files into include/ subdirs.
|
11 lat temu |
|
Michele Orrù
|
3a220b7ff0
Creating qstrings.c file, holding utilities for working with strings.
|
11 lat temu |
|
Michele Orrù
|
8bd1e68d3a
(assumed) non-working version of Dixon's Attack.
|
11 lat temu |
|
Michele Orrù
|
373b8f23f1
Studying efficient algorithms to populate Dixon's sets B, R.
|
11 lat temu |
