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

Go to file

Hesham 45584d378e Update 'README.md'		2020-07-10 07:27:37 +03:00
__init__.py	Cleanup:	2020-04-19 15:45:51 +03:00
.gitignore	New key save format:	2020-04-17 20:35:20 +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-07-10 07:27:37 +03:00
rsa.py	Print message for unknown sig.	2020-04-21 23:53:04 +03:00
TODO	update TODO	2020-04-20 02:49:48 +03:00

hesham-rsa (hrsa)

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

Installation

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

./hrsa

python hrsa

To generate a key pair with an ID

./hrsa [keysize] [keyID]

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

./hrsa encrypt "[message]" [RecieverKeyID] [SenderSignetureKeyID]