An attempt at cracking high bit RSA keys using Pollard Rho's prime factorization.
120 bit key in 64675356usecs
- The program automatically runs all keys from 12-200 bits (in
/keys/) and logs output totimes.txt
make./find-key:)- check
times.txtfor how fast each key was cracked and what the message was. - program will run infinitely, so you should either terminate after cracking 120 key, or modify the for loop in find-key.c's main method.
- Although the program is set to run to up 200 bit keys, we haven't been able to crack further than 120 bit keys, even with the program running overnight.
- We might be able to push our record with the brent modification :)
- Isabella Boone
- John Gable
- Joshua Lewis