Processing math: 100%
Article Dans Une Revue Journal of the American Mathematical Society Année : 2022

Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic

Résumé

We prove that the discrete logarithm problem can be solved in quasi-polynomial expected time in the multiplicative group of finite fields of fixed characteristic. More generally, we prove that it can be solved in the field of cardinality pn in expected time (pn)2log2(n)+O(1).
Fichier principal
Vignette du fichier
dlp.pdf (513) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03347994 , version 1 (17-09-2021)

Identifiants

Citer

Thorsten Kleinjung, Benjamin Wesolowski. Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. Journal of the American Mathematical Society, 2022, 35, pp.581-624. ⟨10.1090/jams/985⟩. ⟨hal-03347994⟩
141 Consultations
200 Téléchargements

Altmetric

Partager

More