Papers › A provably quasi-polynomial algorithm for the discrete logarithm problem in finite...
A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristic
Guido Lido
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We describe a provably quasi-polynomial algorithm to compute discrete logarithms in the multiplicative groups of finite fields of small characteristic, that is finite fields whose characteristic is logarithmic in the order. We partially follow the heuristically quasi-polynomial algorithm presented by Barbulescu, Gaudry, Joux and Thome'. The main difference is to use a presentation of the finite field based on elliptic curves: the abundance of elliptic curves ensures the existence of such a presentation.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections