X-Git-Url: https://scm.gforge.inria.fr/anonscm/gitweb?p=cado-nfs%2Fcado-nfs.git;a=blobdiff_plain;f=README.dlp;h=c038b34c8f3a285ed8f1b63e3784a31d7dcfaa92;hp=f2855d151946d11e4e70be8f6aaf1a9cd28b9fec;hb=c3faa96926d7653c789f57d970f801e27d0b373f;hpb=4e42abaa56fcae693e38c9eb81372c3a625c2a03
diff --git a/README.dlp b/README.dlp
index f2855d1..c038b34 100644
--- a/README.dlp
+++ b/README.dlp
@@ -34,7 +34,8 @@ end.
Important note: the logarithms are given in an arbitrary (unknown) base.
If you want to define them with respect to a specific generator g, then
you'll have to compute the logarithm of g and then divide all the logs by
-this value.
+this value. See https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2018-November/000939.html and
+https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2018-November/000942.html.
**** Using Joux-Lercier polynomial selection
@@ -61,12 +62,30 @@ the better, but then polynomial selection will last longer).
For instance, the 30-digit example above can be done with JL polynomial
selection with the following command-line:
-$ ./cado-nfs.py -dlp -ell 101538509534246169632617439 191907783019725260605646959711 jlpoly=true tasks.polyselect.bound=5 tasks.polyselect.modm=5 tasks.polyselect.degree=3 tasks.reconstructlog.checkdlp=false
+$ ./cado-nfs.py -dlp -ell 101538509534246169632617439 191907783019725260605646959711 jlpoly=true tasks.polyselect.bound=5 tasks.polyselect.modm=7 tasks.polyselect.degree=3 tasks.reconstructlog.checkdlp=false
+
+In that case, the individual logarithm phase implementation is based on
+GMP-ECM, so this is available only if this library is installed and
+detected by the configuration script (see local.sh.example for indicating
+non-standard locations).
+
+Note that tasks.reconstructlog.checkdlp=false is there to disable some
+consistency checks that can not be made in JL mode.
+
+This is still experimental, but parameters optimized for the JL
+polynomial selection can be found in parameters/dlp/Joux-Lercier/ .
+Copying
+ parameters/dlp/Joux-Lercier/params.p30
+to
+ parameters/dlp/params.p30
+will automatically activate the JL polynomial selection (but will crash
+if GMP-ECM failed to be detected at compile time) for primes of this
+size. For instance,
+
+$ ./cado-nfs.py -dlp -ell 101538509534246169632617439 target=92800609832959449330691138186 191907783019725260605646959711
+
+should then work and compute the log of the given target using JL.
-Note that the individual logarithm phase is not implemented in that case,
-and the consistency check is not possible either. However, setting
- tasks.reconstructlog.partial=false
-provides a very good test that everything went as expected.
**** Using non-linear polynomials
@@ -91,7 +110,8 @@ The algorithm works "mutatis mutandis" for discrete logarithm computations
in GF(p^k). The only difference is that the two polynomials must have a
common irreducible factor of degree k over GF(p). Polynomial selection
for this case is not yet included, so you must build them by yourself,
-based on constructions available in the literature. Also the individual
+based on constructions available in the literature, and import it as
+indicated in scripts/cadofactor/README. Also the individual
logarithm has to be implemented for that case.
For DLP in GF(p^2), things are sligthly more integrated: