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.55-60, 1979.
DOI : 10.1109/SFCS.1979.2

S. Bai, C. Bouvier, A. Filbois, P. Gaudry, L. Imbert 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

N. Bell and M. Garland, Efficient sparse matrix-vector multiplication on CUDA, 2008.

N. Bell and M. Garland, Cusp: Generic parallel algorithms for sparse matrix and graph computations, 2012.

D. J. Bernstein, Multidigit modular multiplication with the explicit chinese remainder theorem, 1995.

G. E. Blelloch, M. A. Heroux, and M. Zagha, Segmented operations for sparse matrix computation on vector multiprocessors, 1993.

B. Boyer, J. 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

T. Hayashi, T. Shimoyama, N. Shinohara, and T. Takagi, Breaking pairing-based cryptosystems using ?t pairing over GF(3 97 ) Cryptology ePrint Archive, 2012.

H. Jeljeli, Resolution of Linear Algebra for the Discrete Logarithm Problem Using GPU and Multi-core Architectures, Euro-Par 2014, pp.764-775, 2014.
DOI : 10.1007/978-3-319-09873-9_64
URL : https://hal.archives-ouvertes.fr/hal-00946895

E. Kaltofen, Analysis of coppersmith's block wiedemann algorithm for the parallel solution of sparse linear systems, Mathematics of Computation, vol.64, issue.210, pp.777-806, 1995.

B. A. Lamacchia and A. M. Odlyzko, Solving Large Sparse Linear Systems Over Finite Fields, CRYPTO '90, pp.109-133, 1991.
DOI : 10.1007/3-540-38424-3_8

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

N. Corporation, PTX: Parallel Thread Execution ISA Version 3.0, 2012.

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

J. M. Pollard, A monte carlo method for factorization, BIT, vol.29, issue.129, pp.331-334, 1975.
DOI : 10.1007/BF01933667

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

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

S. Sengupta, M. Harris, Y. Zhang, and J. D. Owens, Scan primitives for GPU computing, pp.97-106, 2007.

D. Shanks, Class number, a theory of factorization, and genera, 1969 Number Theory Institute (Proc. Sympos, pp.415-440, 1969.
DOI : 10.1090/pspum/020/0316385

P. Stach, Optimizations to nfs linear algebra. CADO workshop on integer factorization

N. S. Szabo and R. I. Tanaka, Residue Arithmetic and Its Applications to Computer Technology, 1967.

F. J. Taylor, Residue Arithmetic A Tutorial with Examples, Computer, vol.17, issue.5, pp.50-62, 1984.
DOI : 10.1109/MC.1984.1659138

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