EE-305 Project. Implementing subjects: prime algorithms, mod function, asymmetric relations (public-key encryption),

Go to file

HeshamTB 522e9f3453 Update cp right to 2021		2021-01-30 13:03:57 +03:00
__init__.py	Cleanup:	2020-04-19 15:45:51 +03:00
.gitignore	Ignore venv dir	2021-01-30 13:00:48 +03:00
126-bit-key	A 128-bit key pair saved. Took 15 minutes to generate on (Intel i7-4710MQ (8) @ 3.500GHz) single thread.	2020-04-16 09:51:08 +03:00
encodetest.py	Update cp right to 2021	2021-01-30 13:03:57 +03:00
LICENSE	Create LICENSE	2020-12-12 02:13:06 +03:00
MillerRabin.py	Update cp right to 2021	2021-01-30 13:03:57 +03:00
OAEP.py	Update cp right to 2021	2021-01-30 13:03:57 +03:00
README.md	Update 'README.md'	2020-10-17 11:03:39 +03:00
rsa.py	Update cp right to 2021	2021-01-30 13:03:57 +03:00
TODO	update TODO	2020-04-20 02:49:48 +03:00

hesham-rsa

A simple program written in python to implement RSA public encryption. Used as Course EE-305 project KAU.

Installation

There is no packaging or installation. Works in current dir (portable) for now.

git clone https://apollo-server.ddns.net/gitea/Hesham/hesham-rsa.git
cd hesham-rsa

./rsa.py [COMMAND] [ARGS]

python rsa.py [COMMAND] [ARGS]

to generate a key pair with and ID

./rsa.py gen [keysize] [keyID]

All generated keys are saved in {$working_dir}/saves/

./rsa.py encrypt "[message]" [RecieverKeyID] [SenderSignetureKeyID]

Assuming the encrypted message is encrypted to myPrivateKey

./rsa.py decrypt "[cipher]" [myPrivateKeyID]

The signature is checked with all public keys stored in keys directory