Computing Discrete Logarithms in Small Characteristic Finite Fields in Quasi-Polynomial Time - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2016

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

Résumé

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.
Fichier non déposé

Dates et versions

hal-01276702 , version 1 (19-02-2016)

Identifiants

  • HAL Id : hal-01276702 , version 1

Citer

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⟩
64 Consultations
3 Téléchargements

Partager

Gmail Facebook X LinkedIn More