L. M. Adleman, The function field sieve, ANTS I, pp.108-121, 1994.

L. M. Adleman and M. A. Huang, Function field sieve method for discrete logarithms over finite fields, Inf. Comput, vol.151, issue.12, pp.5-16, 1999.

R. Matsumoto, Using C ab curves in the function field sieve, IEICE Trans. Fund, issue.3, pp.551-552, 1999.

R. Granger, Estimates for discrete logarithm computations in finite fields of small characteristic, Cryptography and Coding, pp.190-206, 2003.

R. Granger, A. J. Holt, D. Page, N. P. Smart, and F. Vercauteren, Function field sieve in characteristic three, ANTS VI, pp.223-234, 2004.

E. Thomé, Computation of discrete logarithms in F 2 607, ASIACRYPT 2001, pp.107-124

D. Coppersmith, Fast evaluation of logarithms in fields of characteristic two, IEEE Trans. Inf. Theory, vol.30, issue.4, pp.587-594, 1984.

T. Hayashi, N. Shinohara, L. Wang, S. Matsuo, M. Shirase et al., Solving a 676-bit discrete logarithm problem in GF (3 6n ), PKC 2010, pp.351-367

T. Hayashi, T. Shimoyama, N. Shinohara, and T. Takagi, Breaking pairing-based cryptosystems using ?T pairing over GF (3 97 ), ASIACRYPT 2012, pp.43-60

K. Aoki, J. Franke, T. Kleinjung, A. Lenstra, and D. A. Osvik, A kilobit special number field sieve factorization, ASIACRYPT 2007, pp.1-12

S. Bai, A. Filbois, P. Gaudry, A. Kruppa, F. Morain et al., CADO-NFS: Crible algébrique: Distribution, optimisation ? Number field sieve

O. Schirokauer, Discrete logarithms and local units, Phil. Trans. R. Soc. A, vol.345, pp.409-423, 1676.

D. M. Gordon and K. S. Mccurley, Massively parallel computation of discrete logarithms, CRYPTO '92, pp.312-323

L. Hars, Applications of fast truncated multiplication in cryptography, EURASIP J. Embed. Syst, p.61721, 2007.

J. M. Pollard, The lattice sieve The development of the number field sieve, pp.43-49, 1993.

K. Aoki and H. Ueda, Sieving using bucket sort, ASI- ACRYPT 2004, pp.92-102

V. Shoup, NTL: A library for doing number theory

F. Chabaud and R. Lercier, ZEN: A toolbox for fast computation in finite extension over finite rings

R. P. Brent, P. Gaudry, E. Thomé, and P. Zimmermann, gf2x: A library for multiplying polynomials over the binary field

A. Joux and R. Lercier, The function field sieve in the medium prime case, EUROCRYPT 2006, pp.254-270
URL : https://hal.archives-ouvertes.fr/hal-00456191

Y. Kawahara, K. Aoki, and T. Takagi, Faster implementation of ?T pairing over GF(3 m ) using minimum number of logical instructions for GF(3)-addition, Pairing 2008, pp.282-296