Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Number Theory
2019-11-19 v2 Cryptography and Security
Abstract
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 in expected time .
Keywords
Cite
@article{arxiv.1906.10668,
title = {Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic},
author = {Thorsten Kleinjung and Benjamin Wesolowski},
journal= {arXiv preprint arXiv:1906.10668},
year = {2019}
}