Indiscreet logarithms in finite fields of small characteristic

@article{Granger2018IndiscreetLI,
  title={Indiscreet logarithms in finite fields of small characteristic},
  author={Robert Granger and T. Kleinjung and J. Zumbr{\"a}gel},
  journal={Adv. Math. Commun.},
  year={2018},
  volume={12},
  pages={263-286}
}
Recently, several striking advances have taken place regarding the discrete logarithm problem (DLP) in finite fields of small characteristic, despite progress having remained essentially static for nearly thirty years, with the best known algorithms being of subexponential complexity. In this expository article we describe the key insights and constructions which culminated in two independent quasi-polynomial algorithms. To put these developments into both a historical and a mathematical… Expand
4 Citations

References

SHOWING 1-10 OF 85 REFERENCES
On the Powers of 2
Discrete Logarithms: The Past and the Future
  • A. Odlyzko
  • Mathematics, Computer Science
  • Des. Codes Cryptogr.
  • 2000
Using number fields to compute logarithms in finite fields
Discrete Logarithms in Finite Fields and Their Cryptographic Significance
  • A. Odlyzko
  • Mathematics, Computer Science
  • EUROCRYPT
  • 1984
The Function Field Sieve Is Quite Special
The Function Field Sieve in the Medium Prime Case
...
1
2
3
4
5
...