Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)



A practical analysis of the elliptic curve factoring algorithm

Authors: Robert D. Silverman and Samuel S. Wagstaff
Journal: Math. Comp. 61 (1993), 445-462
MSC: Primary 11Y05; Secondary 11A51, 68Q25
MathSciNet review: 1122078
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: Much asymptotic analysis has been devoted to factoring algorithms. We present a practical analysis of the complexity of the elliptic curve algorithm, suggesting optimal parameter selection and run-time guidelines. The parameter selection is aided by a novel use of Bayesian statistical decision techniques as applied to random algorithms. We discuss how frequently the elliptic curve algorithm succeeds in practice and compare it with the quadratic sieve algorithm.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 11Y05, 11A51, 68Q25

Retrieve articles in all journals with MSC: 11Y05, 11A51, 68Q25

Additional Information

Keywords: Elliptic curves, Dickman's function, smooth groups, quadratic sieve, factorization
Article copyright: © Copyright 1993 American Mathematical Society

American Mathematical Society