L. M. Adleman, The function field sieve, ANTS-I, pp.108-121, 1994.
DOI : 10.1007/3-540-58691-1_48

K. Aoki, J. Franke, T. Kleinjung, A. Lenstra, and D. A. Osvik, A Kilobit Special Number Field Sieve Factorization, Cryptology ePrint Archive Report, vol.205, 2007.
DOI : 10.1007/978-3-540-76900-2_1

F. Bahr, J. Franke, and T. Kleinjung, Discrete logarithms in GF(p) -160 digits Email to the NMBRTHRY mailing list, 2007.

S. Bai, A. Filbois, P. Gaudry, A. Kruppa, F. Morain et al., CADO-NFS, Crible Algébrique: Distribution, Optimisation -Number Field Sieve

R. Barbulescu, C. Bouvier, J. Detrey, P. Gaudry, H. Jeljeli et al., Discrete logarithm in GF(2 809 ) with FFS, PKC 2014, pp.221-238, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00818124

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

C. Bouvier, The filtering step of discrete logarithm and integer factorization algorithms, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00734654

B. Boyer, J. G. Dumas, and P. Giorgi, Exact sparse matrix-vector multiplication on GPU's and multicore architectures, Proceedings of the 4th International Workshop on Parallel and Symbolic Computation, PASCO '10, 2010.
DOI : 10.1145/1837210.1837224

D. Coppersmith, 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

W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.644-654, 1976.
DOI : 10.1109/TIT.1976.1055638

R. Dutta, R. Barua, and P. Sarkar, Pairing-based cryptographic protocols : a survey, Cryptology ePrint Archive Report, p.64, 2004.

H. Jeljeli, Accelerating Iterative SpMV for the Discrete Logarithm Problem Using GPUs, 2013.
DOI : 10.1007/978-3-319-16277-5_2

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.72953-967, 2003.
DOI : 10.1090/S0025-5718-02-01482-5
URL : https://hal.archives-ouvertes.fr/hal-01102016

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Mathematics of Computation, 1995.
DOI : 10.1007/3-540-56686-4_44

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

C. Lanczos, Solution of systems of linear equations by minimized iterations, Journal of Research of the National Bureau of Standards, vol.49, issue.1, pp.33-53, 1952.
DOI : 10.6028/jres.049.006

A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, 1984.
DOI : 10.1007/3-540-39757-4_20

C. Pomerance and J. W. Smith, Reduction of Huge, Sparse Matrices over Finite Fields Via Created Catastrophes, Experimental Mathematics, vol.32, issue.2, pp.89-94, 1992.
DOI : 10.1080/10586458.1992.10504250

S. Potluri, K. Hamidouche, A. Venkatesh, D. Bureddy, and D. K. Panda, Efficient Inter-node MPI Communication Using GPUDirect RDMA for InfiniBand Clusters with NVIDIA GPUs, 2013 42nd International Conference on Parallel Processing, pp.80-89, 2013.
DOI : 10.1109/ICPP.2013.17

B. Schmidt, H. Aribowo, and H. Dang, Iterative Sparse Matrix-Vector Multiplication for Integer Factorization on GPUs, pp.413-424, 2011.
DOI : 10.1007/978-3-642-23397-5_41

V. Strassen, Gaussian elimination is not optimal, Numerische Mathematik, vol.13, issue.4, pp.354-356, 1969.
DOI : 10.1007/BF02165411
URL : http://www.digizeitschriften.de/download/PPN362160546_0013/PPN362160546_0013___log38.pdf

E. Thomé, Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm, Journal of Symbolic Computation, vol.33, issue.5, pp.757-775, 2002.
DOI : 10.1006/jsco.2002.0533

D. H. Wiedemann, 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