L. Adleman, A subexponential algorithm for the discrete logarithm problem with applications to cryptography, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979), pp.20-55, 1979.
DOI : 10.1109/SFCS.1979.2

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.1145/2810103.2813707
URL : https://hal.archives-ouvertes.fr/hal-01184171

R. Barbulescu and C. Pierrot, Abstract, LMS Journal of Computation and Mathematics, vol.17, issue.A, pp.230-246, 2014.
DOI : 10.1017/CBO9781139856065

R. Barbulescu, Algorithmes de logarithmes discrets dans les corps finis, 2013.
URL : https://hal.archives-ouvertes.fr/tel-00925228

R. Barbulescu, P. Gaudry, A. Guillevic, and F. Morain, Discrete logarithms in GF(p 2 ) ? 180 digits (2014), https

R. Barbulescu, P. Gaudry, A. Guillevic, and F. Morain, Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields, EUROCRYPT 2015, Part I. LNCS, pp.129-155, 2015.
DOI : 10.1007/978-3-662-46800-5_6
URL : https://hal.archives-ouvertes.fr/hal-01112879

R. Barbulescu, P. Gaudry, A. Joux, and E. Thomé, A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic, EUROCRYPT 2014, pp.1-16, 2014.
DOI : 10.1007/978-3-642-55220-5_1
URL : https://hal.archives-ouvertes.fr/hal-00835446

I. F. Blake, R. C. Mullin, and S. A. Vanstone, Computing logarithms in GF(2 n ), CRYPTO'84, pp.73-82, 1984.

E. R. Canfield, P. Erdös, and C. Pomerance, On a problem of Oppenheim concerning ???factorisatio numerorum???, Journal of Number Theory, vol.17, issue.1, pp.1-28, 1983.
DOI : 10.1016/0022-314X(83)90002-1

Y. Chen, Réduction de réseau et sécurité concrète du chiffrementcompì etement homomorphe, 2013.

A. Commeine and I. Semaev, An Algorithm to Solve the Discrete Logarithm Problem with the Number Field Sieve, PKC 2006, pp.174-190, 2006.
DOI : 10.1007/11745853_12

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

D. Coppersmith, A. M. Odlzyko, and R. Schroeppel, Discrete logarithms in GF(p) Algorithmica, pp.1-15, 1986.

N. Gama and P. Q. Nguyen, Predicting Lattice Reduction, ROCRYPT 2008, pp.31-51, 2008.
DOI : 10.1007/978-3-540-78967-3_3

D. M. Gordon, 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

K. Hayasaka, K. Aoki, T. Kobayashi, and T. Takagi, An Experiment of Number Field Sieve for Discrete Logarithm Problem over GF(p 12), Number Theory and Cryptography, pp.108-120978, 2013.
DOI : 10.1007/978-3-642-42001-6_8

A. Joux and R. Lercier, 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

A. Joux, R. Lercier, D. Naccache, and E. Thomé, Oracle-Assisted Static Diffie-Hellman Is Easier Than Discrete Logarithms, 12th IMA International Conference on Cryptography and Coding, pp.351-367, 2009.
DOI : 10.1007/978-3-642-10868-6_21
URL : https://hal.archives-ouvertes.fr/inria-00337753

A. Joux, R. Lercier, N. Smart, and F. Vercauteren, The Number Field Sieve in the Medium Prime Case, CRYPTO 2006, pp.326-344, 2006.
DOI : 10.1007/11818175_19
URL : https://hal.archives-ouvertes.fr/hal-01102034

M. Kalkbrener, An upper bound on the number of monomials in determinants of sparse matrices with symbolic entries, Mathematica Pannonica, vol.73, p.82, 1997.

A. Lenstra, H. W. Lenstra, J. Lovász, and L. , Factoring polynomials with rational coefficients, Mathematische Annalen, vol.32, issue.4, pp.515-534, 1982.
DOI : 10.1007/BF01457454

D. Matyukhin, Effective version of the number field sieve for discrete logarithms in the field GF(p k ) (in Russian), Trudy po Discretnoi Matematike, vol.9, pp.121-151, 2006.

C. Pierrot, The multiple number field sieve with conjugation and generalized jouxlercier methods, EUROCRYPT 2015, Part I. LNCS, pp.156-170, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01056205

D. Weber, Computing discrete logarithms with quadratic number rings, EUROCRYPT'98, pp.171-183, 1998.
DOI : 10.1007/BFb0054125

P. Zajac, Discrete Logarithm Problem in Degree Six Finite Fields, 2008.