]. R. Brent, MULTIPLE-PRECISION ZERO-FINDING METHODS AND THE COMPLEXITY OF ELEMENTARY FUNCTION EVALUATION, Analytic computational complexity, pp.151-176
DOI : 10.1016/B978-0-12-697560-4.50014-9

R. Brent and P. Zimmermann, Modern Computer Arithmetic, Cambridge Monographs on Applied and Computational Mathematics, vol.18, issue.3 4, 2010.
DOI : 10.1017/CBO9780511921698
URL : https://hal.archives-ouvertes.fr/cel-01500109

J. P. Buhler, A. K. Lenstra, and J. M. Pollard, Factoring integers with the number field sieve, Lecture Notes in Math, vol.32, issue.107, pp.50-94, 1993.
DOI : 10.1109/TIT.1986.1057137

H. Cohen, A course in algorithmic algebraic number theory, Grad. Texts in Math, vol.138, issue.2, p.7, 1993.

J. Couveignes, Computing a square root for the number field sieve, Lecture Notes in Math, vol.54, issue.1 5, pp.95-102, 1993.
DOI : 10.1007/BFb0091540

A. Enge and A. V. Sutherland, Class Invariants by the CRT Method, ANTS-IX Proceedings. ? 9, pp.142-156, 2010.
DOI : 10.1007/978-3-642-14518-6_14
URL : https://hal.archives-ouvertes.fr/inria-00448729

J. Zur-gathen and J. Gerhard, Modern computer algebra, p.12, 1999.
DOI : 10.1017/CBO9781139856065

P. Gaudry, A. Kruppa, F. Morain, L. Muller, E. Thomé et al., cado-nfs, An Implementation of the Number Field Sieve Algorithm, p.15, 2011.

N. Howgrave-graham and A. Joux, New Generic Algorithms for Hard Knapsacks, EUROCRYPT, pp.235-256, 2010.
DOI : 10.1007/978-3-642-13190-5_12

A. Joux, D. Naccache, and E. Thomé, When e-th Roots Become Easier Than Factoring, ASIACRYPT 2007 Proceedings. ? 2, pp.13-28, 2008.
DOI : 10.1007/978-3-540-76900-2_2
URL : https://hal.archives-ouvertes.fr/inria-00187782

T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé et al., Factorization of a 768-Bit RSA Modulus, CRYPTO 2010 Proceedings. ? 2, pp.333-350, 2010.
DOI : 10.1007/978-3-642-14623-7_18
URL : https://hal.archives-ouvertes.fr/inria-00444693

H. W. Lenstra-jr and P. Stevenhagen, Chebotarëv and his density theorem, Math. Intelligencer, vol.18, issue.2, pp.26-37, 1996.

C. Monico, ggnfs, A Number Field Sieve Implementation Available at http://www.math.ttu, p.9, 2004.

P. L. Montgomery, Square roots of products of algebraic numbers Mathematics of Computation, of Proc. Sympos, pp.567-571, 1943.

P. L. Montgomery, Square roots of products of algebraic numbers Unpublished draft, significantly different from published version, 1997.

P. Q. Nguyen, A Montgomery-like square root for the Number Field Sieve, ANTS-III Proceedings. ? 7, pp.151-168, 1998.
DOI : 10.1007/BFb0054859

J. Papadopoulos, msieve, A Library for Factoring Large Integers ? release 1, p.15, 2004.

A. V. Sutherland, Abstract, LMS Journal of Computation and Mathematics, vol.I, 2012.
DOI : 10.1090/S0025-5718-06-01849-7