A C++ repository for an implementation of Pollard's Rho algorithm with GMP
The software used for making this repository is an Ubuntu terminal, and Visual Code. I installed GMP by running sudo apt-get install libgmp3-dev in the terminal. If you want to do something similar, or are looking to use GMP yourself, I highly recommend using a similar OS.
During my semester at uni, I had a project to learn about and implement Pollard's Rho algorithm in Python. That made me want to implement it in C++ as well, and to try new things by including a library I haven't used before. I also plan to make unit tests to learn something new.
Given that you have GMP and g++ installed, just run the command g++ main.cpp pollardrho.cpp testpollardrho.cpp -o main -lgmp -lgmpxx and ./main with the appropriate arguments. I have not tested the program with any other compiler.
If you want to run the tests, add the compiler flag -DRUN_TESTS.
When you have compiled the program, you can run it by writing ./main <number> <reps>, where <number> is the number you want to factor, and <reps> is the amount of times you want the program to try and find unique (but not necessarily prime) factors.
Traditionally, Pollard's Rho algorithm's complexity is heuristically <reps> argument, the complexity changes to
- Test cases
- Building and running with CMake
- Profiling/Timing