Skip to Content.
Sympa Menu

cado-nfs - [Cado-nfs-discuss] inefficiency in polynomial selection

Subject: Discussion related to cado-nfs

List archive

[Cado-nfs-discuss] inefficiency in polynomial selection


Chronological Thread 
  • From: paul zimmermann <Paul.Zimmermann@inria.fr>
  • To: cado-nfs-discuss@lists.gforge.inria.fr
  • Subject: [Cado-nfs-discuss] inefficiency in polynomial selection
  • Date: Wed, 14 Sep 2016 12:48:27 +0200
  • 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>

To CADO-NFS users,

we have discovered some inefficiency in CADO-NFS polynomial selection,
which affects the latest release (2.2.0). In short, some algebraic
polynomials generated have their leading coefficient not divisible by
the parameter 'incr' (usually one takes incr=60, which guarantees some
good root properties).

This is fixed in the development version, up from revision 7187eb9.

If you use CADO-NFS 2.2.0: to avoid this issue, please make sure that
both admin and adrange are divisible by incr.

Paul Zimmermann



  • [Cado-nfs-discuss] inefficiency in polynomial selection, paul zimmermann, 09/14/2016

Archive powered by MHonArc 2.6.19+.

Top of Page