Ecosyste.ms: Awesome

An open API service indexing awesome lists of open source software.

Awesome Lists | Featured Topics | Projects

https://github.com/amaterazu7/rsa-python

This is a Python implementation of the RSA Algorithm
https://github.com/amaterazu7/rsa-python

algorithms euler py python rsa-cryptography sha1

Last synced: about 1 month ago
JSON representation

This is a Python implementation of the RSA Algorithm

Awesome Lists containing this project

README

        

Python-RSA Implementation
=========================
[![PyPI](https://pypi.org/static/images/logo-small.6eef541e.svg)](https://pypi.org/)

This is a Python implementation of the RSA Algorithm. Made in Python 3.7.

Just for learning, we have how to code properly the implementation of RSA Algorithm in Python, and how to deal with a project. Help is always welcomed.

Steps
-----

- Create a project on your personal GitHub.
- [![GitHub Local ssh-agent]()](https://help.github.com/en/articles/generating-a-new-ssh-key-and-adding-it-to-the-ssh-agent)
- Upload the project with the local Bayer ssh-keys.
- Show the creation of the ssh-keygen and the classes.
- Show RSA-algoris.
- Show the features.
- [![Pure-Python RSA implementation]()](https://pypi.org/project/rsa/)
- [![GitHub Documentation]()](https://github.com/sybrenstuvel/python-rsa/)

Generator SSH keys
------------------

- [![ssh.com]()](https://www.ssh.com/ssh/keygen/#sec-Specifying-the-File-Name)
- [![Medium]()](https://medium.com/risan/upgrade-your-ssh-key-to-ed25519-c6e8d60d3c54)
- ` ssh-keygen -t rsa -b 4096 -C `
- ` ssh-keygen -t ed25519 -b 4096 -C `
- [![Hash Generator]()](https://passwordsgenerator.net/sha256-hash-generator/)
- [![Mythbusters Demo GPU versus CPU]()](https://www.youtube.com/watch?v=-P28LKWTzrI)
- [![Lifetimes of cryptographic hash functions]()](http://valerieaurora.org/hash.html)

RSA algorithm
=============

- Take two distinct, large primes `p` and `q`.
- Ideally these have a similar byte-length.
- Multiply `p` and `q` and store the result in `n`.
- Find the totient for `n` using the formula: ` 𝜑(𝑛) = (𝑝−1)⋅(𝑞−1) `.
- Take an `e` coprime that is greater, than 1 and less than `n`.
- Find `d` using the formula ` 𝑑⋅𝑒 ≡ 1 mod 𝜑(𝑛) `.
- At this point, the pair (`e`, `n`) is the public key and the private key (`d`, `n`) is the private key.

Features
--------

- Create a private and public keys.
- Messages Encryption
- Messages Decrypted

License
-------

The project is licensed under the MIT license.