Skip to content

amninder/crypto

BranchesTags

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

33 Commits

fabfile

fabfile

 
 

.gitignore

.gitignore

 
 

LICENSE

LICENSE

 
 

README.md

README.md

 
 

__init__.py

__init__.py

 
 

requirements.txt

requirements.txt

 
 

Repository files navigation

crypto

Problem Statement:

The prime purpose of this project is to demonstrate the functionality of Secure RSA using MT19937 and Miller-Rabin primality testing. MT19937 is the most popular pseudorandom number generator and is even used in python’s inbuilt rand method. The performance is shown by graphs generated using MatplotLib

Highlights:

1. Upto 2048 bit long private key was generated 2. Computational time for key generation showed significant performance

Algorithms Implemented:

1. Secure RSA 2. MersenneTwister (MT19937) 3. Karatsuba Multiplication 4. Miller-Rabin primality test

About

RSA file encryption and decryption with pseudorandom number generator using Mersenne Twistter MT19937

Resources

Readme

License

MIT license
Activity

Stars

0 stars

Watchers

2 watching

Forks

0 forks
Report repository

Releases

No releases published

Packages

No packages published

Languages