Imperfect forward secrecy: How Diffie-Hellman fails in practice, Communications of the ACM, vol.62, issue.1, pp.106-114, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01184171
A kilobit special number field sieve factorization, ASIACRYPT 2007, vol.4833, pp.1-12, 2007. ,
Better polynomials for GNFS, Math. Comput, vol.85, issue.298, pp.861-873, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01089507
Algorithmes de logarithmes discrets dans les corps finis, 2013. ,
URL : https://hal.archives-ouvertes.fr/tel-00925228
A uniform approach for the fast computation of matrixtype Padé approximants, SIAM J. Matrix Anal. Appl, vol.15, issue.3, pp.804-823, 1994. ,
How to find small factors of integers, 2002. ,
On improving integer factorization and discrete logarithm computation using partial triangulation, Cryptology ePrint Archive, 2017. ,
, Parallel Structured Gaussian Elimination for the Number Field Sieve, 2019.
URL : https://hal.archives-ouvertes.fr/hal-02098114
Faster cofactorization with ECM using mixed representations, PKC 2020, Part II, vol.12111, pp.483-504, 2020. ,
URL : https://hal.archives-ouvertes.fr/lirmm-02613652
Factoring integers with the number field sieve, Lenstra and Lenstra, Jr, pp.50-94 ,
, Strategies in filtering in the number field sieve, vol.1838, pp.209-231, 2000.
A course in computational algebraic number theory, Grad, Texts in Math, vol.138, 1993. ,
Solving linear equations over GF(2) via block Wiedemann algorithm, Math. Comput, vol.62, pp.333-350, 1994. ,
A New Ranking Function for Polynomial Selection in the Number Field Sieve, Contemporary Mathematics, vol.754, pp.315-325, 2020. ,
URL : https://hal.archives-ouvertes.fr/hal-02151093
Factorization using the quadratic sieve algorithm, CRYPTO'83, pp.103-113, 1983. ,
Linear time interactive certificates for the minimal polynomial and the determinant of a sparse matrix, pp.199-206, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01266041
A kilobit hidden SNFS discrete logarithm computation, EURO-CRYPT 2017, Part I. LNCS, vol.10210, pp.202-231, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01376934
Online order basis algorithm and its impact on the block Wiedemann algorithm, pp.202-209, 2014. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01232873
the GMP development team: GNU MP: The GNU Multiple Precision Arithmetic Library, version 6, vol.1, 2016. ,
The middle product algorithm I, AAECC, vol.14, issue.6, pp.415-438, 2004. ,
URL : https://hal.archives-ouvertes.fr/inria-00071921
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the Gaussian integer method, Math. Comput, vol.72, issue.242, pp.953-967, 2003. ,
URL : https://hal.archives-ouvertes.fr/hal-01102016
Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comput, vol.64, issue.210, pp.777-806, 1995. ,
Cofactorisation strategies for the number field sieve and an estimate for the sieving step for factoring 1024-bit integers, Proceedings of SHARCS'06, 2006. ,
On polynomial selection for the general number field sieve, Math. Comput, vol.75, issue.256, pp.2037-2047, 2006. ,
Polynomial selection. Slides presented at the CADO workshop on integer factorization, 2008. ,
Factorization of a 768-bit RSA modulus, CRYPTO 2010, vol.6223, pp.333-350, 2010. ,
URL : https://hal.archives-ouvertes.fr/inria-00444693
Mersenne factorization factory, ASIACRYPT 2014, Part I. LNCS, vol.8873, pp.358-377 ,
, , 2014.
Computation of a 768-bit prime field discrete logarithm, Part I. LNCS, vol.10210, pp.185-201, 2017. ,
, The development of the number field sieve, LNM, vol.1554, 1993.
Square roots of products of algebraic numbers, Mathematics of Computation 1943-1993 : a Half-Century of Computational Mathematics, vol.48, pp.567-571, 1994. ,
National Security Agency: Commercial national security algorithm suite, Polynomial Selection for the Number Field Sieve Integer Factorisation Algorithm, 1999. ,
The lattice sieve, vol.30, pp.43-49 ,
Discrete logarithms and local units, Philos. Trans. Roy. Soc. London Ser. A, vol.345, pp.409-423, 1676. ,
, CADO-NFS, an implementation of the number field sieve algorithm, 2019.
Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm, J. Symb. Comput, vol.33, issue.5, pp.757-775, 2002. ,
Square root algorithms for the number field sieve, WAIFI 2012, vol.7369, pp.208-224, 2012. ,