A bunch of scripts implementing popular ciphers and signature systems, as well as useful mathematical tools in cryptography and information security.
- Python 3.12+ (no external libraries/packages are required)
First, cd to the project's root.
Run the same command side-by-side (e.g. in two separate console windows) to simulate communication between two parties over the network (only the Girault Key Exchange runner can be run only once to get the information of both parties).
python3.12 -m crypto.run XXXwhere XXX is the runner name, given in the following
table. (EC means Elliptic Curve-based)
| # | Runner name (XXX) |
Description | Key length (bits) (*) | Approximate Time For Generating Key Pairs (seconds) |
|---|---|---|---|---|
| 1 | CryptoRSA | RSA Cipher alone | 4096 | 5 - 6 |
| 2 | CryptoElGamal | ElGamal Cipher alone | 1024 | 2 - 3 |
| 3 | CryptoECElGamal | EC-ElGamal Cipher alone | 256 | Instantly (**) |
| 4 | CryptoMasseyOmura | EC-Massey-Omura Cipher alone | 256 | Instantly (**) |
| 5 | CryptoRSA_SignatureRSA | RSA Cipher and Signature System combined | 4096 & 512 | (5 - 6) & (Instantly) |
| 6 | CryptoElGamal_SignatureElGamal | ElGamal Cipher and ElGamal Signature System combined | 1024 & 128 | (2 - 3) & (0.2 - 1) |
| 7 | CryptoECElGamal_SignatureECDSA | EC-ElGamal Cipher and ECDSA Signature System combined | 256 & 10 | (Instantly (**)) & (Instantly) |
| 8 | KeyExchangeDHElGamal | ElGamal cipher-based Diffie Hellman Key Exchange | 1024 | 2 - 3 |
| 9 | KeyExchangeDHECElGamal | EC-ElGamal cipher-based Diffie Hellman Key Exchange | 256 | Instantly (**) |
| 10 | KeyExchangeGirault | Girault Key Exchange | 1024 | 2 seconds to several minutes |
| 11 | IDSchemeGQ | Guillou-Quisquater (GQ) Identification Scheme | 4096 | 5 - 6 |
| 12 | IDSchemeFFS | Feige-Fiat-Shamir (FFS) Identification Scheme | 4096 | 5 - 6 |
(*) Key Length Interpretation:
- For RSA cipher, Girault Key Exchange, and GQ and FFS Identification Schemes,
it's the bit length of
n = pq. - For ElGamal, it's the bit length of
pthe modulus. - For EC (elliptic curve)-based systems such as EC-ElGamal and EC-Massey-Omura, it's the bit length
of
pas in field F_p over which the elliptic curve is formed. - For runners with combined crypto and signature systems, there are
two numbers of key length - one for the cipher, the other for
the signature system - separated by the ampersand
&.
(**) Instant time in those cases are due to a pre-selected elliptic curve with known properties and is considered safe for cryptographic uses. That is how the real-world industry is doing elliptic curve cryptography anyway. In all the other cases, Instantly means the program generates the curves (or whatever relevant parameters, keys etc.) from scratch.
More images and text reports can be found in the directory <project_root>/docs/results.
As noted, more results are available as texts and images in <project_root>/docs/results.
Almost every module has test cases. To run tests written
for a particular module, run it with test command-line
argument. For example:
python3.12 -m crypto.systems test
python3.12 -m crypto.elliptic_curve test
python3.12 -m crypto.prime testetc.
To run all tests, execute the following command:
python3.12 -m crypto testThere are 94 tests, which take 190 seconds (about 3 minutes) or more in total to complete on Intel i7-1165G7 @ 2.80GHz × 4.
Vũ Tùng Lâm 22028235 UET