Computing Discrete Logarithms in Small Characteristic Finite Fields in Quasi-Polynomial Time

Emmanuel Thomé 1
1 CARAMEL - Cryptology, Arithmetic: Hardware and Software
Inria Nancy - Grand Est, LORIA - ALGO - Department of Algorithms, Computation, Image and Geometry
Abstract : The advent of a heuristic quasi-polynomial complexity algorithm in 2013 for solving the discrete logarithm problem over small characteristic finite fields has had the consequence that this problem can no longer be considered as being sufficiently hard for cryptographic needs. We will describe the idea of the algorithm, its more recent modifications, and consider directions for extensions to other contexts.
Document type :
Conference papers
Complete list of metadatas

https://hal.inria.fr/hal-01276702
Contributor : Jean-Pierre Tillich <>
Submitted on : Friday, February 19, 2016 - 5:54:12 PM
Last modification on : Monday, January 21, 2019 - 2:16:07 PM

Identifiers

  • HAL Id : hal-01276702, version 1

Citation

Emmanuel Thomé. Computing Discrete Logarithms in Small Characteristic Finite Fields in Quasi-Polynomial Time. The 9th International Workshop on Coding and Cryptography 2015 WCC2015, Anne Canteaut, Gaëtan Leurent, Maria Naya-Plasencia, Apr 2015, Paris, France. ⟨hal-01276702⟩

Share

Metrics

Record views

52