2019-06-25
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Publication
Publication
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).
| Additional Metadata | |
|---|---|
| Organisation | Cryptology |
|
Kleinjung, T., & Wesolowski, B. (2019). Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic. |
|
