Cryptography RSA The key.py is used to create two big prime number in 512 bits in binary(that is about 154 bits in decimal), and the RSAencrypt.py can encrypt the plaintext, the RSAdecrypt.py can decrypt the ciphertext. The miller-labin is the algorithm I used to create two big prime number.
Ming5024/RSA
Folders and files
| Name | Name | Last commit date | ||
|---|---|---|---|---|