The repository includes a class implementing RSA algorithm, an example showing its use and a script to test it. The algorithm was implemented in the Computer Systems Security course of the 9th semester of DUTh.
This implementation uses:
- two primes to calculate n
- extended GCD method to find the private key(d)
- Miller-Rabin for primality checking
- key size 2048 (but it can be easily adjusted for any key size)
To get started make sure you have installed all the prerequisites in your computer and then follow the instuctions in the installation section.
To compile this implementation of RSA you will need:
- cmake
- boost library, which can also be extracted from the 7z included
- Make sure to include the path of the library in the CMakeLists
- A compiler that supports std11 and threading
- (This project was tested with mingw64 version 8)
To run the example:
- Open the example folder and type:
mkdir build
cd build
cmake ..
make
- Add a file named plain.txt with the message you want to encrypt before running the output file.
To run the tests, follow the same procedure.
Contributions are what make the open source community such an amazing place to be, learn, inspire, and create.
Contribute following the above steps:
- Fork the Project
- Create your Feature Branch (
git checkout -b new_branch_name) - Commit your Changes (
git commit -m 'Add some extra functionality') - Push to the Branch (
git push origin new_branch_name) - Open a Pull Request