New answers tagged prime-numbers
As for the algorithm, you have two choices: The quadratic sieve and the general number field sieve. If you want to implement the factorization yourself you want to use the quadratic sieve, as a good implementation of the GNFS is really hard. However, if you're willing to use pre-made tools using GGNFS and msieve (together) is your best option. Msieve ...
Top 50 recent answers are included