GitHub - PythonNoob6643/RSAFactorFinder: The point of the program is to have minimum memory usage in order to find a factors of N in RSA encryption. You need the value of N , when selecting min_range let it be > 0, when selecting how many factors let it be bigger than zero, was designed on a low spec pc, it takes time but i have tested and cracked 512 bit value without program crashing, i take the idea from shors algorithm instead of retrieving the period, its a form of brute forcing it to find valid Factors of N

PythonNoob6643 / RSAFactorFinder Public

Notifications You must be signed in to change notification settings
Fork 0
Star 0

The point of the program is to have minimum memory usage in order to find a factors of N in RSA encryption. You need the value of N , when selecting min_range let it be > 0, when selecting how many factors let it be bigger than zero, was designed on a low spec pc, it takes time but i have tested and cracked 512 bit value without program crashing…