Subject: Discussion related to cado-nfs
List archive
- From: paul zimmermann <Paul.Zimmermann@inria.fr>
- To: Pierrick Gaudry <pierrick.gaudry@loria.fr>
- Cc: cado-nfs-discuss@lists.gforge.inria.fr
- Subject: Re: [Cado-nfs-discuss] unbearably slow factorization
- Date: Mon, 29 Jan 2018 09:58:24 +0100
- List-archive: <http://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/>
- List-id: A discussion list for Cado-NFS <cado-nfs-discuss.lists.gforge.inria.fr>
> 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
- [Cado-nfs-discuss] unbearably slow factorization, mike@mikepage.us, 01/26/2018
- Re: [Cado-nfs-discuss] unbearably slow factorization, Emmanuel Thomé, 01/26/2018
- Re: [Cado-nfs-discuss] unbearably slow factorization, Pierrick Gaudry, 01/26/2018
- Re: [Cado-nfs-discuss] unbearably slow factorization, paul zimmermann, 01/29/2018
- Re: [Cado-nfs-discuss] unbearably slow factorization, Pierrick Gaudry, 01/26/2018
- Re: [Cado-nfs-discuss] unbearably slow factorization, Emmanuel Thomé, 01/26/2018
Archive powered by MHonArc 2.6.19+.