CryptoRecords.info
Finite-field DLP

Finite-field discrete logarithms

Compute discrete logarithms in multiplicative groups of finite fields, separating prime fields, characteristic growth and extension structure.

Small characteristic · proven

F_{p^n} with n > p in the cited theorem

1 results · 1 papers
Classical randomizedProvableall finite fields of small characteristicExpression only
Results
Compare historyJSONCSV
#PUBLICATION / AUTHORSDATETIME BOUNDSPACE BOUNDEVIDENCE
—A provably quasi-polynomial algorithm for the discrete logarithm problem in finite fields of small characteristicGuido LidoFinite Fields and Their Applications 2026SourceBibTeX / detailsunconditional elliptic presentations22 Feb 2025(log Q)O(log log Q) expected timeNot extracted from the sourcePublishedSource checked
1–1 of 1 entriesIncludes relevant non-record results. Dates refer to the specific bound.
Comparison definition & assumptions
Regime
F_{p^n} with n > p in the cited theorem
Computation
Classical randomized
Rigor
Provable
Instances
all finite fields of small characteristic
Cost scale
Expression only
Parameter
Q = p^n
Description
Provable quasi-polynomial bounds under an explicit characteristic-growth condition.
Comparison rules
Provable quasi-polynomial bounds under an explicit characteristic-growth condition. Only compare entries with this cost scale, input domain and computational model. Polynomial and quasi-polynomial expressions without an extracted scalar are not ranked.
Tags
small characteristic, quasi-polynomial, unconditional