EECM: ECM using Edwards curves

The EECM-MPFQ software

EECM-MPFQ is a fast implementation
of the elliptic-curve method of factoring integers.
EECM-MPFQ was introduced in the paper
"ECM using Edwards curves"
by Bernstein, Birkner, Lange, and Peters.
EECM-MPFQ uses fewer modular multiplications
than the well-known GMP-ECM software,
takes less time than GMP-ECM,
and finds more primes than GMP-ECM.

EECM-MPFQ now also supports additional curve choices
described in the paper "Starfish on strike"
by Bernstein, Birkner, and Lange.

Installation

EECM-MPFQ requires an amd64 (x86-64) UNIX/BSD/Linux/etc. system
with gcc, g++, cmake, and m4.
Here is how to install the current versions (as of 2010.03)
of GMP 4,
GMP-ECM (which is not yet compatible with GMP 5
because GMP 5 changed __GMP_BITS_PER_MP_LIMB to GMP_LIMB_BITS),
NTL,
MPFQ,
and EECM-MPFQ
in subdirectories of your home directory:

If, for example, you want to apply 100 curves to a 1-word integer with B1 = 300,
you can run eecm1-6 100 300 instead of simply eecm.
You can specify -1 for the number of curves;
then eecm will continue running until it finds a divisor.
(Extra statistics option:
You can specify -100 for the number of curves;
then eecm will continue running through exactly 100 curves,
whether or not it finds a divisor.)

The second section of output shows various precomputations
that depend on the parameters but that do not depend on the integer being factored: