Factoring numbers using singular integers, Proceedings of the twenty-third annual ACM symposium on Theory of computing , STOC '91, pp.64-71, 1991. ,
DOI : 10.1145/103418.103432
The function field sieve, Lecture Notes in Computer Science, vol.877, issue.2, pp.108-121, 1994. ,
DOI : 10.1007/3-540-58691-1_48
« Function Field Sieve Method for Discrete Logarithms over Finite Fields Information and Computation 151, p.0890540198927614, 1999. ,
Finding suitable curves for the elliptic curve method of factorization, Mathematics of Computation, vol.60, issue.201, pp.399-405, 1993. ,
DOI : 10.1090/S0025-5718-1993-1140645-1
URL : https://hal.archives-ouvertes.fr/inria-00075015
Better polynomials for GNFS. Accepted for publication in Mathematics of Computation. 2015. url : https://hal. inria, pp.1089507-54 ,
URL : https://hal.archives-ouvertes.fr/hal-01089507
Root optimization of polynomials in the number field sieve, Mathematics of Computation, vol.84, issue.295, p.48, 2015. ,
DOI : 10.1090/S0025-5718-2015-02926-3
URL : https://hal.archives-ouvertes.fr/hal-00919367
Factorisation of RSA-704 with CADO-NFS. Cryptology ePrint Archive, p.95 ,
URL : https://hal.archives-ouvertes.fr/hal-00760322
« Familles de courbes adaptées à la factorisation des entiers ». Research report version 2, p.31, 2009. ,
« Selecting polynomials for the Function Field Sieve ». Preprint, 23 pages, pp.78-79, 2013. ,
Finding ECM-friendly curves through a study of Galois properties, ANTS X: Proceedings of the Tenth Algorithmic Number Theory Symposium, pp.63-86, 2013. ,
DOI : 10.1007/11792086_37
URL : https://hal.archives-ouvertes.fr/hal-00671948
« The relationship between some guy and cryptography ». ECC2012 rump session talk (humoristic), p.99 ,
Improvements to the Number Field Sieve for non-prime finite fields, p.72, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01052449
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields, 34th Annual International Conference on the Theory and Applications of Cryptographic Techniques ,
DOI : 10.1007/978-3-662-46800-5_6
URL : https://hal.archives-ouvertes.fr/hal-01112879
« A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic Advances in Cryptology ? EUROCRYPT 2014, Lecture Notes in Computer Science, pp.1-16978, 2014. ,
An Approximate Probabilistic Model for Structured Gaussian Elimination, Journal of Algorithms 31, p.0196677499910088, 1999. ,
DOI : 10.1006/jagm.1999.1008
Starfish on Strike, Progress in Cryptology ? LATINCRYPT 2010, pp.61-80978, 2010. ,
DOI : 10.1007/978-3-642-14712-8_4
ECM using Edwards curves, ECM using Edwards curves, pp.1139-1179, 2013. ,
DOI : 10.1090/S0025-5718-2012-02633-0
URL : http://cr.yp.to/factorization/eecm-20080109.pdf
Analysis and optimization of elliptic-curve single-scalar multiplication, Contemporary Mathematics, vol.461, pp.1-20, 2008. ,
DOI : 10.1090/conm/461/08979
A general number field sieve implementation, Lecture Notes in Computer Science, vol.32, pp.103-126, 1993. ,
DOI : 10.1109/TIT.1986.1057137
Explicit-Formulas Database. url : http : / / www . hyperelliptic.org, p.8 ,
Cryptographic Key Length Recommendation ,
« Factoring large integers with the quadratic sieve, Thèse de doct. Leiden University, p.46, 1997. ,
The filtering step of discrete logarithm and integer factorization algorithms. Preprint, 22 pages, 2013. ,
URL : https://hal.archives-ouvertes.fr/hal-00734654
Discrete logarithms in GFppq ? 180 digits. Archives of the Number Theory Mailing List (NMBRTHRY), p.97 ,
Division-Free Binary-to-Decimal Conversion, IEEE Transactions on Computers, vol.63, issue.8, 2014. ,
DOI : 10.1109/TC.2014.2315621
URL : https://hal.archives-ouvertes.fr/hal-00864293
Applied mathematical programming, p.65, 1977. ,
On addition chains, Bulletin of the American Mathematical Society, vol.45, issue.10, pp.736-739, 1939. ,
DOI : 10.1090/S0002-9904-1939-07068-7
« New Families of ECM Curves for Cunningham Numbers Algorithmic Number Theory ? ANTS-IX, Lecture Notes in Computer Science, vol.30, pp.96-109, 2010. ,
Lecture Notes in Computer Science, 1423. ,
Factoring integers with the number field sieve, Lecture Notes in Computer Science, vol.32, issue.107, pp.50-94, 1993. ,
DOI : 10.1109/TIT.1986.1057137
CADO-NFS, an implementation of the Number Field Sieve algorithm, pp.58-74 ,
« On a problem of Oppenheim concerning, Journal of Number Theory, vol.171, pp.1-28, 1983. ,
« On the Number Field Sieve Integer Factorization Algorithm, Thèse de doct, pp.85-94, 2002. ,
Factorization of a 512-Bit RSA Modulus, Advances in Cryptology ? EUROCRYPT 2000, pp.1-18, 2000. ,
DOI : 10.1007/3-540-45539-6_1
URL : https://hal.archives-ouvertes.fr/inria-00099117
« On the largest prime divisors of numbers », In : J. Indian Math. Soc, vol.11, pp.31-37, 1947. ,
A course in computational algebraic number theory. T. 138, p.34, 1993. ,
Handbook of Elliptic and Hyperelliptic Curve Cryptography. Sous la dir, pp.1-58488, 2005. ,
Solving linear equations over GF(2): block Lanczos algorithm, Linear Algebra and its Applications, vol.192, issue.93, pp.33-60, 1993. ,
DOI : 10.1016/0024-3795(93)90235-G
URL : https://doi.org/10.1016/0024-3795(93)90235-g
Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994. ,
DOI : 10.2307/2153413
« Computing a Square Root for the Number Field Sieve The development of the number field sieve, Lecture Notes in Computer Science, pp.95-102, 1993. ,
On nonlinear polynomial selection for the number field sieve ArXiv e-prints. 2013. url : http://arxiv.org/abs/1109, pp.49-63 ,
Montgomery's method of polynomial selection for the number field sieve ArXiv e-prints, p.62, 2014. ,
Prime numbers: a computational perspective. T. 182, 2006. ,
DOI : 10.1007/978-1-4684-9316-0
Elliptic Curve Data, p.23 ,
url : https://gforge.inria.fr/frs, pp.38-94 ,
Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve, Cryptology ePrint Archive, p.79 ,
Relation Collection for the Function Field Sieve, 2013 IEEE 21st Symposium on Computer Arithmetic, pp.79-99 ,
DOI : 10.1109/ARITH.2013.28
URL : https://hal.archives-ouvertes.fr/hal-00736123
« On the frequency of numbers containing prime factors of a certain relative magnitude, Ark. Mat. Astr. Fys, vol.22, pp.1-14, 1930. ,
New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976. ,
DOI : 10.1109/TIT.1976.1055638
Asymptotically fast factorization of integers, Mathematics of Computation 36, 1981. ,
DOI : 10.1090/S0025-5718-1981-0595059-1
A normal form for elliptic curves, Bulletin of the American Mathematical Society, vol.44, issue.03, pp.393-422, 2007. ,
DOI : 10.1090/S0273-0979-07-01153-6
An Implementation of the Number Field Sieve, Experimental Mathematics, vol.5, issue.3, pp.231-253, 1996. ,
DOI : 10.1007/978-1-4757-1089-2
An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves, Journal of Cryptology, vol.68, issue.226, pp.24-41, 2011. ,
DOI : 10.1090/S0025-5718-01-01352-7
URL : https://hal.archives-ouvertes.fr/inria-00135324
The GNU Multiple Precision Arithmetic Library. url : http://gmplib, p.16 ,
Elliptic Curve Method for Integer Factorization). url : https://gforge.inria.fr, p.4 ,
« On the Function Field Sieve and the Impact of Higher Splitting Probabilities Advances in Cryptology ? CRYPTO 2013, Lecture Notes in Computer Science, vol.8043, pp.978-981 ,
Solving a $$6120$$ -bit DLP on a Desktop Computer, Lecture Notes in Computer Science, pp.136-152978, 2014. ,
DOI : 10.1007/978-3-662-43414-7_7
Discrete Logarithms in $GF ( P )$ Using the Number Field Sieve, SIAM Journal on Discrete Mathematics, vol.6, issue.1, pp.124-138, 1993. ,
DOI : 10.1137/0406010
Discrete Logarithms in GFp2 9234 q. Archives of the Number Theory Mailing List (NMBRTHRY) ,
On the Powers of 2. Cryptology ePrint Archive, p.69 ,
« Smooth numbers: computational number theory and beyond ». In : Algorithmic number theory: lattices, number fields, pp.267-323, 2008. ,
Guide to elliptic curve cryptography, p.14, 2004. ,
Factorisation of B200 Archives of the Number Theory Mailing List (NMBR- THRY). 2012. url : https, pp.1-1208 ,
Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs, p.81 ,
DOI : 10.1007/978-3-319-16277-5_2
Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures, Lecture Notes in Computer Science, pp.73-75 ,
DOI : 10.1007/978-3-319-09873-9_64
URL : https://hal.archives-ouvertes.fr/hal-00946895
A new index calculus algorithm with complexity Lp1{4òp1qqLp1{4òp1qq in very small characteristic. Cryptology ePrint Archive, p.69 ,
Discrete logarithms in a 1425-bit finite field. Archives of the Number Theory Mailing List (NMBRTHRY). 2013. url : https, p.69 ,
Faster Index Calculus for the Medium Prime Case Application to 1175-bit and 1425-bit Finite Fields, Advances in Cryptology ? EUROCRYPT 2013, pp.177-193978, 2013. ,
DOI : 10.1007/978-3-642-38348-9_11
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method, Mathematics of Computation, vol.72, issue.242, pp.953-967, 2003. ,
DOI : 10.1090/S0025-5718-02-01482-5
URL : https://hal.archives-ouvertes.fr/hal-01102016
« The Number Field Sieve in the Medium Prime Case Advances in Cryptology ? CRYPTO, Lecture Notes in Computer Science, vol.isbn, pp.326-344, 2006. ,
Discrete logarithm record in characteristic 3, GFp3 p5?479q q a 3796-bit field. Archives of the Number Theory Mailing List (NMBRTHRY) ,
« Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024 bit integers, Proceedings of SHARCS, p.61, 2006. ,
« On polynomial selection for the general number field sieve Mathematics of Computation 75, pp.2037-2047, 2006. ,
Discrete logarithms in GFppq ? 160 digits Archives of the Number Theory Mailing List (NMBRTHRY) url : https://listserv.nodak, pp.1-0702, 2007. ,
Polynomial Selection. Slides presented at the CADO workshop on integer factorization, pp.50-74, 2008. ,
Discrete Logarithms in GFp2 1279 q. Archives of the Number Theory Mailing List (NMBRTHRY). 2014. url : https, pp.69-78 ,
« Factorization of a 768-bit RSA modulus Advances in Cryptology ? CRYPTO 2010, Lecture Notes in Computer Science, pp.333-350, 2010. ,
On Nonlinear Polynomial Selection and Geometric Progression (mod N) for Number Field Sieve, Cryptology ePrint Archive Report, p.63, 2011. ,
« Speeding up Integer Multiplication and Factorization Université Henri Poincaré -Nancy I, jan, Thèse de doct, p.31, 2010. ,
The RSA factoring challenge url : http://www.emc. com/emc-plus/rsa-labs/historical/the-rsa-factoring-challenge.htm (cité p, pp.38-95, 1991. ,
« Solving Large Sparse Linear Systems Over Finite Fields Advances in Cryptology -CRYPTO' 90, Lecture Notes in Computer Science, pp.109-133, 1991. ,
An iteration method for the solution of the eigenvalue problem of linear differential and integral operators, Journal of Research of the National Bureau of Standards, vol.45, issue.4, p.41, 1950. ,
DOI : 10.6028/jres.045.026
URL : https://hal.archives-ouvertes.fr/hal-01712947
Moments, positive polynomials and their applications, pp.978-979, 2009. ,
DOI : 10.1142/p665
Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982. ,
DOI : 10.1007/BF01457454
The factorization of the ninth Fermat number, Mathematics of Computation, vol.61, issue.203, pp.319-349, 1993. ,
DOI : 10.1090/S0025-5718-1993-1182953-4
« The number field sieve ». In : The development of the number field sieve, Lecture Notes in Computer Science, pp.11-42, 1993. ,
« Factoring Estimates for a 1024-Bit RSA Modulus Advances in Cryptology -ASIACRYPT 2003, Lecture Notes in Computer Science, pp.55-74978, 2003. ,
Factoring Integers with Elliptic Curves, The Annals of Mathematics, vol.126, issue.3, pp.649-673, 1987. ,
DOI : 10.2307/1971363
The number field sieve: an annotated bibliography The development of the number field sieve, Lecture Notes in Computer Science, pp.1-3, 1993. ,
« The Magma algebra system. I. The user language Computational algebra and number theory, Journal of Symbolic Computation, vol.24, pp.3-4, 1993. ,
The Elimination form of the Inverse and its Application to Linear Programming, Management Science, vol.3, issue.3, pp.255-269, 1957. ,
DOI : 10.1287/mnsc.3.3.255
« Using C ab curves in the function field sieve, IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, vol.823, pp.551-552, 1999. ,
« Evaluating recurrences of form X m`n " f pX m , X n , X m´n q via Lucas chains. » Unpublished. Déc, p.14, 1983. ,
« Speeding the Pollard and Elliptic Curve Methods of Factorization Mathematics of Computation 48, pp.243-264, 1987. ,
« An FFT extension of the elliptic curve method of factorization, Thèse de doct. University of California, p.15, 1992. ,
« Small geometric progressions modulo n ». Unpublished note of 2 pages, p.62, 1993. ,
« Square roots of products of algebraic numbers Mathematics of Computation 1943?1993: a Half-Century of Computational Mathematic, Proceedings of Symposia in Applied Mathematics, pp.567-571, 1994. ,
A Block Lanczos Algorithm for Finding Dependencies over GF(2), Advances in Cryptology ? EUROCRYPT '95 ,
DOI : 10.1007/3-540-49264-X_9
Lecture Notes in Computer Science, pp.106-1203, 1995. ,
« Square roots of products of algebraic numbers ». Article non publié, significativement différent de la version publiée, p.43, 1997. ,
« A Method of Factoring and the Factorization of F 7, Mathematics of Computation, vol.29129, issue.1, 1975. ,
mpF q : a finite field library. url : http : / / mpfq . org, p.16 ,
url : http://sourceforge, pp.38-85 ,
« Modelling the yield of number field sieve polynomials Algorithmic Number Theory. Sous la dir, Lecture Notes in Computer Science, pp.137-150, 1998. ,
« Polynomial selection for the number field sieve integer factorisation algorithm, Thèse de doct. Australian National University, p.144, 1999. ,
« On Quadratic Polynomials for the Number Field Sieve, Proceedings of the CATS '98. T. 20. Australian Computer Science Communications, pp.199-214, 1998. ,
Class field theory. T. 280, p.17, 1986. ,
Vallée et al. The LLL Algorithm. Survey and Applications. Sous la dir, Information Security and Cryptography, vol.1, pp.978-981, 2010. ,
« A Montgomery-like square root for the number field sieve Algorithmic Number Theory. Sous la dir, Lecture Notes in Computer Science, pp.151-168, 1998. ,
An analytic approach to smooth polynomials over finite fields, Lecture Notes in Computer Science, pp.226-236, 1998. ,
DOI : 10.1007/BFb0054865
A Self Tuning Filtering Implementation for the Number Field Sieve. Slides presented at the CADO workshop on integer factorization, p.85, 2008. ,
« An improved algorithm for computing logarithms over GF(p) and its cryptographic significance ». In : Information Theory, IEEE Transactions on, vol.241, 1978. ,
Theorems on factorization and primality testing, Mathematical Proceedings of the Cambridge Philosophical Society 76, 1974. ,
DOI : 10.2307/2003473
« Monte Carlo methods for index computation (mod p), Mathematics of computation 32, pp.918-924, 1978. ,
« Factoring with cubic integers The development of the number field sieve, Lecture Notes in Computer Science, pp.4-10, 1993. ,
« The lattice sieve The development of the number field sieve, Lecture Notes in Computer Science, pp.43-49, 1993. ,
The quadratic sieve factoring algorithm Advances in cryptology: EUROCRYPT '84. Sous la dir, Lecture Notes in Computer Science, pp.169-182, 1985. ,
Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes, Experimental Mathematics, vol.32, issue.2, 1992. ,
DOI : 10.1109/TIT.1986.1057137
« Non-linear polynomial selection for the number field sieve Special Issue for Joachim von zur Gathen at 60, p, Journal of Symbolic Computation, vol.474, 2012. ,
« A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.212, issue.1, pp.120-126, 1978. ,
The Sage Development Team, Sage Mathematics Software, vol.30, p.20 ,
Discrete Logarithms and Local Units, Philosophical Transactions of the Royal Society A: Mathematical, Physical and Engineering Sciences, vol.345, issue.1676, pp.1676-409, 1993. ,
DOI : 10.1098/rsta.1993.0139
Using number fields to compute logarithms in finite fields, Mathematics of Computation, vol.69, issue.231, pp.1267-1283, 2000. ,
DOI : 10.1090/S0025-5718-99-01137-0
SDPA (SemiDefinite Programming Algorithm). url : http://sourceforge, p.65 ,
Propri??t??s galoisiennes des points d???ordre fini des courbes elliptiques, Inventiones mathematicae 15, pp.259-331, 1971. ,
DOI : 10.1007/978-3-642-39816-2_94
Analysis and improvement of the continued fraction method of factorization, 1975. ,
The arithmetic of elliptic curves. T. 106, pp.5-8, 2009. ,
The multiple polynomial quadratic sieve, Mathematics of Computation, vol.48, issue.177, pp.329-339, 1987. ,
DOI : 10.1090/S0025-5718-1987-0866119-8
Computing the image of Galois. CNTA XII. 2012. url : http://math, p.22 ,
Informal preliminary report (8), p.11, 1985. ,
Square root algorithms for the number field sieve Arithmetic of Finite Fields 4th International Workshop, WAIFI 2012, pp.208-224, 2012. ,
On addition chains $1(mn)\leq 1(n)-b$, Duke Mathematical Journal, vol.40, issue.4, pp.907-913, 1973. ,
DOI : 10.1215/S0012-7094-73-04085-4
Basic Number Theory. 3 e éd. T. 144, Classics in Mathematics, p.77, 1974. ,
Solving sparse linear equations over finite fields, IEEE Transactions on Information Theory, vol.32, issue.1, pp.54-62, 1986. ,
DOI : 10.1109/TIT.1986.1057137
« A p`1 Method of Factoring Mathematics of Computation 39, pp.1-13, 1982. ,
Cubics Polynomials in the Number Field Sieve ». Mém.de mast, 2010. ,
« 20 Years of ECM Algorithmic Number Theory ? ANTS-VII. Sous la dir, Lecture Notes in Computer Science, vol.16, pp.525-542, 2006. ,
On the surjectivity of mod ? representations associated to elliptic curves, 2011. ,