M. Leonard, J. Adleman, and . Demarrais, A subexponential algorithm for discrete logarithms over all finite fields. Mathematics of Computation, vol.61, pp.1-15, 1993.

R. Granger, T. Kleinjung, and J. Zumbrägel, On the discrete logarithm problem in finite fields of fixed characteristic, Cryptology ePrint Archive, 2015.

A. Joux and C. Pierrot, Improving the polynomial time precomputation of Frobenius representation discrete logarithm algorithms, Advances in Cryptology: ASIACRYPT'2014, pp.378-397, 2014.
URL : https://hal.archives-ouvertes.fr/hal-01213649

C. Stephen, M. E. Pohlig, and . Hellman, An improved algorithm for computing logarithms over GF(p) and its cryptographic significance (corresp.), IEEE Transactions on Information Theory, vol.24, issue.1, pp.106-110, 1978.