L. M. 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

L. M. Adleman, The function field sieve, 1st Algorithmic Number Theory Symposium, pp.108-121, 1994.
DOI : 10.1007/3-540-58691-1_48

L. M. Adleman and J. Demarrais, A subexponential algorithm for discrete logarithms over all finite fields, Mathematics of Computation, vol.61, issue.203, pp.1-15, 1993.
DOI : 10.1090/S0025-5718-1993-1225541-3

S. Arita, Algorithms for computations in Jacobians of C ab curve and their application to discrete-log-based public key cryptosystems, Proceedings of Conference on The Mathematics of Public Key Cryptography, pp.12-17, 1999.

I. F. Blake, R. Fuji-hara, R. C. Mullin, and S. A. Vanstone, Computing Logarithms in Finite Fields of Characteristic Two, SIAM Journal on Algebraic Discrete Methods, vol.5, issue.2, pp.276-285, 1984.
DOI : 10.1137/0605029

S. Cavallar, Strategies in Filtering in the Number Field Sieve, ANTS-IV 4th Algorithmic Number Theory Symposium, pp.209-231, 2000.
DOI : 10.1007/10722028_11

S. Cavallar, B. Dodson, A. K. Lenstra, W. Lioen, P. L. Montgomery et al., Factorization of a 512-Bit RSA Modulus, Advances in Cryptology ? EURO- CRYPT 2000 Proc. International Conference on the Theory and Application of Cryptographic Techniques, pp.1-18, 2000.
DOI : 10.1007/3-540-45539-6_1
URL : https://hal.archives-ouvertes.fr/inria-00099117

F. Chabaud and R. Lercier, ZEN, a toolbox for fast computation in finite extensions over finite rings

D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Transactions on Information Theory, vol.30, issue.4, pp.587-594, 1984.
DOI : 10.1109/TIT.1984.1056941

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

T. Denny and V. Müller, On the reduction of composed relations from the number field sieve, 2nd Algorithmic Number Theory Symposium, pp.75-90, 1996.
DOI : 10.1007/3-540-61581-4_43

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

B. Dodson and A. K. Lenstra, NFS with Four Large Primes: An Explosive Experiment, Proc. 15th Annual International Cryptology Conference, pp.372-385, 1995.
DOI : 10.1007/3-540-44750-4_30
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.126.5323

G. Frey and H. Rück, A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves, Math. Comp, vol.62, issue.206, pp.865-874, 1994.

S. D. Galbraith, S. M. Paulus, and N. P. Smart, Arithmetic on superelliptic curves, Mathematics of Computation, vol.71, issue.237, 2001.
DOI : 10.1090/S0025-5718-00-01297-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.18.1706

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

D. M. Gordon and K. S. Mccurley, Massively Parallel Computation of Discrete Logarithms, Proc. 12th Annual International Cryptology Conference, pp.312-323, 1992.
DOI : 10.1007/3-540-48071-4_22

T. Granlund, GMP, the GNU multiple precision arithmetic library, 1996.

A. Joux and R. Lercier, Discrete logarithms in GF(2 n ) (521 bits) Email to the NMBRTHRY mailing list, 2001.

A. Joux and R. Lercier, Discrete logarithms in GF(p) (120 decimal digits) Email to the NMBRTHRY mailing list, 2001.

E. Kaltofen, Analysis of Coppersmith's block Wiedemann algorithm for the parallel solution of sparse linear systems, Math. Comp, vol.64, issue.210, pp.777-806, 1995.

E. Kaltofen and A. Lobo, Distributed Matrix-Free Solution of Large Sparse Linear Systems over Finite Fields, Algorithmica, vol.24, issue.3-4, pp.331-348, 1999.
DOI : 10.1007/PL00008266

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

N. Koblitz, Hyperelliptic cryptosystems, Journal of Cryptology, vol.2, issue.4, pp.139-150, 1989.
DOI : 10.1007/BF02252872

B. A. Lamacchia and A. M. Odlyzko, Solving Large Sparse Linear Systems Over Finite Fields, Advances in Cryptology ? CRYPTO '90 Proc. 10th Annual International Cryptology Conference, pp.109-133, 1990.
DOI : 10.1007/3-540-38424-3_8

A. K. Lenstra and M. S. Manasse, Factoring with two large primes, Mathematics of Computation, vol.63, issue.208, pp.785-798, 1994.
DOI : 10.1090/S0025-5718-1994-1250773-9

R. Lidl and H. Niederreiter, Finite fields of Encyclopedia of mathematics and its applications, 1983.

A. Menezes, T. Okamoto, and S. A. Vanstone, Reducing elliptic curve logarithms to logarithms in a finite field, IEEE Transactions on Information Theory, vol.39, issue.5, pp.1639-1646, 1993.
DOI : 10.1109/18.259647

A. J. Menezes, Elliptic curve public key cryptosystems, 1993.
DOI : 10.1007/978-1-4615-3198-2

P. L. Montgomery, A Block Lanczos Algorithm for Finding Dependencies over GF(2)
DOI : 10.1007/3-540-49264-X_9

H. Niederreiter, A new efficient factorization algorithm for polynomials over small finite fields, Applicable Algebra in Engineering, Communication and Computing, vol.35, issue.2, pp.81-87, 1993.
DOI : 10.1007/BF01386831

A. M. Odlyzko, Discrete logarithms in finite fields and their cryptographic significance, Advances in Cryptology ? EUROCRYPT '84, pp.224-314
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

C. P. Schnorr, Efficient signature generation by smart cards, Journal of Cryptology, vol.4, issue.3, pp.161-174, 1991.
DOI : 10.1007/BF00196725
URL : http://publikationen.ub.uni-frankfurt.de/files/4280/schnorr.pdf

E. Thomé, Fast computation of linear generators for matrix sequences and application to the block Wiedemann algorithm, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.323-331, 2001.
DOI : 10.1145/384101.384145

G. Villard, Further analysis of Coppersmith's block Wiedemann algorithm for the solution of sparse linear systems (extended abstract), Proceedings of the 1997 international symposium on Symbolic and algebraic computation , ISSAC '97, pp.32-39, 1997.
DOI : 10.1145/258726.258742

G. Villard, A study of Coppersmith's block Wiedemann algorithm using matrix polynomials, Research report LMC-IMAG, vol.975, 1997.

D. Weber and T. Denny, The solution of McCurley's discrete log challenge, Proc. 18th Annual International Cryptology Conference, pp.458-471, 1998.
DOI : 10.1007/BFb0055747

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