O. L. Arthur, Atkin and François Morain, Finding suitable curves for the elliptic curve method of factorization, Mathematics of Computation, vol.60, pp.399-405, 1993.

R. Barbulescu, J. W. Bos, C. Bouvier, T. Kleinjung, and P. L. Montgomery, Finding ECM-friendly curves through a study of Galois properties, Proceedings of the Tenth Algorithmic Number Theory Symposium, pp.63-86, 2012.
DOI : 10.1007/11792086_37

URL : https://hal.archives-ouvertes.fr/hal-00671948

D. J. Bernstein, P. Birkner, and T. Lange, Starfish on Strike, Progress in Cryptology -LATINCRYPT 2010, Proceedings, pp.61-80, 2010.
DOI : 10.1007/978-3-642-14712-8_4

D. J. Bernstein, P. Birkner, T. Lange, and C. Peters, ECM using Edwards curves, ECM using Edwards curves, pp.1139-1179, 2013.
DOI : 10.1090/S0025-5718-2012-02633-0

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=

M. Harold and . Edwards, A normal form for elliptic curves, Bulletin of the American Mathematical Society, vol.44, pp.393-422, 2007.

H. Hisil, K. Wong, G. Carter, and E. Dawson, Advances in Cryptology -ASIACRYPT, Proceedings, pp.326-343, 2008.

K. Arjen, H. W. Lenstra, and . Lenstra-jr, The development of the number field sieve, Lecture Notes in Mathematics, vol.1554, 1993.

W. Hendrik and . Lenstra-jr, Factoring integers with elliptic curves, Annals of Mathematics, vol.126, pp.649-673, 1987.

L. Peter and . Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation, vol.48, pp.243-264, 1987.

H. Suyama, Informal preliminary report, 1985.