id: 00427911
dt: j
an: 00427911
au: Silverman, Robert D.; Wagstaff, Samuel S.jun.
ti: A practical analysis of the elliptic curve factoring algorithm.
so: Math. Comput. 61, No.203, 445-462 (1993).
py: 1993
pu: American Mathematical Society, Providence, RI
la: EN
cc: 
ut: elliptic curve factorization
ci: Zbl 0608.10005
li: doi:10.2307/2152967
ab: To find a prime factor $p$ of a composite $N$ by the elliptic curve method
    (ECM) involves choosing a curve and a smoothness bound $B\sb 1$ (and a
    larger $B\sb 2$), and also deciding when to switch to the quadratic
    sieve if ECM is unpromising. The authors submit guidelines based on
    extensive computational experience and intuition (supported by
    heuristics and a Bayesian analysis of the probable size of $p$ after
    each failure). [The authors cite the program of {\it P. L. Montgomery},
    Math. Comput. 48, 243-264 (1987; Zbl 0608.10005)].
rv: H.Cohn (New York)