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

Go to file

HeshamTB a36de9cf67 Better output while finding primes: use \b instead of \r with the count of digits of tested number. still outputs a mess at start due to multithreads output at same time, however, stable after first itiration.		2020-09-06 06:13:19 +03:00
__init__.py	Cleanup:	2020-04-19 15:45:51 +03:00
.gitignore	Ignore pyinstaller files	2020-08-28 18:53:22 +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	Octet String to integer and integer to octet string.	2020-04-20 20:16:49 +03:00
MillerRabin.py	Added Miller Rabin's algorithm:	2020-04-18 22:49:06 +03:00
OAEP.py	Octet String to integer and integer to octet string.	2020-04-20 20:16:49 +03:00
README.md	Update 'README.md'	2020-08-28 02:47:01 +03:00
rsa.py	Better output while finding primes:	2020-09-06 06:13:19 +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

./rsa.py

python rsa.py

to generate a key pair with and ID

./rsa.py [keysize] [keyID]

All generated keys are {working dir}/saves/ in keys folder

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