Michele Orrù
16914842cc
Williams factorization method: implementing Lucas Sequence multiplier.
|
il y a 11 ans | |
|---|---|---|
| book | il y a 11 ans | |
| reports | il y a 11 ans | |
| src | il y a 11 ans | |
| .gitignore | il y a 11 ans | |
| AUTHORS | il y a 11 ans | |
| COPYING | il y a 11 ans | |
| ChangeLog | il y a 11 ans | |
| INSTALL | il y a 11 ans | |
| Makefile.am | il y a 11 ans | |
| NEWS | il y a 11 ans | |
| README | il y a 11 ans | |
| compile | il y a 11 ans | |
| configure.ac | il y a 11 ans | |
| depcomp | il y a 11 ans | |
| install-sh | il y a 11 ans | |
| missing | il y a 11 ans | |
| test-driver | il y a 11 ans | |
| top-1m.csv | il y a 11 ans |
README
The main purpose of this project is to implement some of the most common
mathematical attacks on the RSA cipher, and provide an executable capable of
measuring the level of security into a ssl conversation.
Given a website as input, the program should be able to download its
certificate, and probe it with different tools.
Examples of probes could be wrong information on the ssl certificate metadata,
a vulnerability with wiener's attack, factorization, dixon, etc.
mathematical attacks on the RSA cipher, and provide an executable capable of
measuring the level of security into a ssl conversation.
Given a website as input, the program should be able to download its
certificate, and probe it with different tools.
Examples of probes could be wrong information on the ssl certificate metadata,
a vulnerability with wiener's attack, factorization, dixon, etc.