H. W. Lenstra and J. , Factoring Integers with Elliptic Curves, The Annals of Mathematics, vol.126, issue.3, pp.649-673, 1987.
DOI : 10.2307/1971363
URL : https://openaccess.leidenuniv.nl/bitstream/handle/1887/2140/346_079.pdf?sequence=1

P. Zimmermann and B. Dodson, 20 Years of ECM, ANTS VII, ser, pp.525-542, 2006.
DOI : 10.1007/11792086_37
URL : https://hal.archives-ouvertes.fr/inria-00070192

D. J. Bernstein, P. Birkner, T. Lange, and C. Peters, ECM using Edwards curves, Mathematics of Computation, vol.82, issue.282, pp.1139-1179, 2013.
DOI : 10.1090/S0025-5718-2012-02633-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.7366

A. K. Lenstra, H. W. Lenstra, and J. Eds, The development of the Number Field Sieve, ser, Lecture Notes in Mathematics, vol.1554, 1993.

D. Coppersmith, Modifications to the Number Field Sieve, Journal of Cryptology, vol.6, issue.3, pp.169-180, 1993.
DOI : 10.1007/BF00198464

D. Adrian, K. Bhargavan, Z. Durumeric, P. Gaudry, M. Green et al., Imperfect Forward Secrecy, Proceedings of the 22nd ACM SIGSAC Conference on Computer and Communications Security, CCS '15, pp.5-17, 2015.
DOI : 10.1007/3-540-68339-9_29
URL : https://hal.archives-ouvertes.fr/hal-01184171

J. W. Bos and T. Kleinjung, ECM at Work, ASIACRYPT'12, pp.467-484, 2012.
DOI : 10.1007/978-3-642-34961-4_29

A. Miele, J. W. Bos, T. Kleinjung, and A. K. Lenstra, Cofactorization on Graphics Processing Units, CHES'14, ser, pp.335-352, 2014.
DOI : 10.1007/978-3-662-44709-3_19
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.637.5778

B. Dupont-de-dinechin, P. Guironnet-de-massas, G. Lager, C. Léger, B. Orgogozo et al., A distributed runtime environment for the Kalray MPPA-256 integrated manycore processor, ICCS'13, pp.1654-1663, 2013.

B. Dupont-de-dinechin, R. Ayrignac, P. Beaucamps, P. Couvert, B. Ganne et al., A clustered manycore processor architecture for embedded and accelerated applications, 2013 IEEE High Performance Extreme Computing Conference (HPEC), 2013.
DOI : 10.1109/HPEC.2013.6670342

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

S. R. Dussé, B. S. Kaliski, and J. , A Cryptographic Library for the Motorola DSP56000, EUROCRYPT'90, ser, pp.230-244, 1991.
DOI : 10.1007/3-540-46877-3_21

C. ¸. Koç, T. Acar, B. S. Kaliski, and J. , Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro, vol.16, issue.3, pp.26-33, 1996.
DOI : 10.1109/40.502403

P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation, vol.48, issue.177, pp.243-264, 1987.
DOI : 10.1090/S0025-5718-1987-0866113-7

D. J. Bernstein, P. Birkner, T. Lange, and C. Peters, EECM: ECM using Edwards curves, 2010.
DOI : 10.1090/s0025-5718-2012-02633-0
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.7366