Function field sieve method for discrete logarithms over finite fields, Inf. Comput, vol.151, issue.1-2, pp.5-16, 1999. ,
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, Advances in Cryptology -EUROCRYPT 2014 -33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, pp.1-16, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00835446
, Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005.
Elliptic periods for finite fields. Finite Fields and Their Applications, vol.15, pp.1-22, 2009. ,
A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms. IACR Cryptology ePrint Archive, p.430, 2018. ,
On the powers of 2. IACR Cryptology ePrint Archive, p.300, 2014. ,
On the discrete logarithm problem in finite fields of fixed characteristic, Trans. Amer. Math. Soc, vol.270, pp.3129-3145, 2018. ,
Improving the polynomial time precomputation of frobenius representation discrete logarithm algorithms -simplified setting for small characteristic finite fields, Advances in Cryptology -ASIACRYPT 2014 -20th International Conference on the Theory and Application of Cryptology and Information Security, pp.378-397, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-01213649
Technical history of discrete logarithms in small characteristic finite fields -the road from subexponential to quasipolynomial complexity, Des. Codes Cryptogr, vol.78, issue.1, pp.73-85, 2016. ,
URL : https://hal.archives-ouvertes.fr/hal-01243676
A new perspective on the powers of two descent for discrete logarithms in finite fields. IACR Cryptology ePrint Archive, p.647, 2018. ,
Discrete logarithms in quasipolynomial time in finite fields of fixed characteristic, Cryptology ePrint Archive, 2019. ,
Discrete logarithm over finite fields of small characteristic, 2016. ,
Discrete logarithm over finite fields of small characteristic, 2019. ,
The Weil pairing, and its efficient calculation, J. Cryptology, vol.17, issue.4, pp.235-261, 2004. ,
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. ,
Fast, rigorous factorization and discrete logarithm algorithms, Discrete algorithms and complexity, pp.119-143, 1987. ,
On the number of points of elliptic curves over a finite field and a problem of B. Segre, European Journal of Combinatorics, vol.4, issue.3, pp.263-270, 1983. ,
Generators and irreducible polynomials over finite fields, vol.66, pp.1195-1212, 1997. ,
Annales scientifiques de l'École Normale Supérieure, vol.2, pp.521-560, 1969. ,