[Cado-nfs-discuss] unbearably slow factorization

paul zimmermann Paul.Zimmermann at inria.fr
Mon Jan 29 09:58:24 CET 2018


> From the README (admittedly not exactly in the place you would look for
> it):
>   Note that it is a good idea to remove small prime factors using
>   special-purpose algorithms such as trial division, P-1, P+1, or ECM,
>   and use CADO-NFS only for the remaining composite factor.

note that even if you remove all small prime factors, and you are left with
a large prime, cado-nfs will still factor your input:

$ ./cado-nfs.py 90377629292003121684002147101760858109247336549001090677741

This is on purpose, at the request of some users:

https://libquotes.com/bill-gates/quote/lbb1e0p

Paul


More information about the Cado-nfs-discuss mailing list