Closed FalcoGer closed 1 year ago
mfakto is not made to factor arbitrary numbers. It can only find small factors of mersenne numbers (2^n-1). It makes use of special properties of such numbers to find any factors of a certain size, but it will not usually completely factor that number. Please refer to the Great Internet Mersenne Prime Search (GIMPS) for details.
I wish to find the factors of a specific number, say
9981288689097387167236403804200527764541749288988075494790957780549135181678131939818850293729529848150563641739687197881364631891780517426633717597900617
from a weak (512bit) RSA public key.How would I go about doing that with mfakto?