This project shows basic implementation of RSA algorithm from scratch. You can vist deployed site by clicking on deploymnet or just by clicking here.
- Select 2 large prime numbers, lets say p and q.
- Multiply both large prime numbers, N = p * q.
- Multiply again but by subtracting 1 from both, phiN = (p-1)*(q-1)
- Select integer e such that : gcd(phiN, e) = 1 and 1 < e < phiN.
- Now calculate d : d = e^-1 (mod(phiN))
Public Key will be : PU = {e,N}
Private Key will be : PR = {d,N}
Encryption Plain text(M) : M < n Ciper test(C) : C = M^e mod n
Encryption Ciper test(C) : C Plain text(M) : M = C^d mod n
Implementation is done in python and django. if you want to see only python implementaion and dont want user interface then you can directly go to python
And if want to run complete project then fork and download the repo and then use any python IDE of your choice, open this project and then download Django, run this code in Django. If you dont know how to run in django you can refer any youtube video. If you find something new then feel free to contribute.
Feel free to open an issue. We are glad to help you. And is you have solution for that issue I will allocate to you. ❤️
If you have any more idea related to this project then please share your idea on jimmyaghera123@gmail.com. If time permits I will surely do some work on your project.