The following publications are possibly variants of this publication:
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms - Simplified Setting for Small Characteristic Finite FieldsAntoine Joux, Cécile Pierrot. asiacrypt 2014: 378-397 [doi]
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small CharacteristicRazvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. eurocrypt 2014: 1-16 [doi]
- A quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristicRazvan Barbulescu, Pierrick Gaudry, Antoine Joux, Emmanuel Thomé. iacr, 2013:400, 2013. [doi]
- Technical history of discrete logarithms in small characteristic finite fields - The road from subexponential to quasi-polynomial complexityAntoine Joux, Cécile Pierrot. dcc, 78(1):73-85, 2016. [doi]
- Discrete Logarithms in Small Characteristic Finite Fields: a Survey of Recent Advances (Invited Talk)Antoine Joux. STACS 2017: [doi]