Michele Orrù
434a76cc27
Remark the use and the semantics of the yield statement in Dixon.
|
11 anni fa | |
|---|---|---|
| book | 11 anni fa | |
| reports | 11 anni fa | |
| src | 11 anni fa | |
| .gitignore | 11 anni fa | |
| AUTHORS | 11 anni fa | |
| COPYING | 11 anni fa | |
| ChangeLog | 11 anni fa | |
| INSTALL | 11 anni fa | |
| Makefile.am | 11 anni fa | |
| NEWS | 11 anni fa | |
| README | 11 anni fa | |
| compile | 11 anni fa | |
| configure.ac | 11 anni fa | |
| depcomp | 11 anni fa | |
| install-sh | 11 anni fa | |
| missing | 11 anni fa | |
| primes.txt | 11 anni fa | |
| sites.txt | 11 anni fa | |
| test-driver | 11 anni fa |
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.