arXiv · 1906.10668
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
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 $p^n$ in expected time $(pn)^{2\log_2(n) + O(1)}$.
Explore related subjects
Keep this discovery
Thorsten Kleinjung, Benjamin Wesolowski. 2019-06-25. Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. https://arxiv.org/abs/1906.10668
Cite the original work for its findings. Save a collection to share your selection of sources.