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=2f5088c6abb45beb6348f65126243415cdd59ce9;hb=4f1c4ca9b915c6c9bc3acca90543d7a6eff5472a;hpb=7c7e926d96b4400fca963b777421f4a56591bb5c
diff --git a/README.dlp b/README.dlp
index 2f5088c..c038b34 100644
--- a/README.dlp
+++ b/README.dlp
@@ -62,7 +62,7 @@ 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
@@ -110,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: