EE-305 Project.
Implementing subjects:
prime algorithms,
mod function,
asymmetric relations (public-key encryption),
HeshamTB
e086a2cdcc
- Given n and e, try factoring n and generate d if p or q is found. works well with 16-bit to 64-bit keys. larger keys take vary long which is good. Signed-off-by: HeshamTB <hishaminv@gmail.com> |
||
|---|---|---|
| __init__.py | ||
| .gitignore | ||
| 126-bit-key | ||
| encodetest.py | ||
| MillerRabin.py | ||
| rsa.py | ||
| TODO | ||