Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
From MaRDI portal
Publication:5862178
DOI10.1090/jams/985zbMath1487.11113arXiv1906.10668OpenAlexW2966295786MaRDI QIDQ5862178
Thorsten Kleinjung, Benjamin Wesolowski
Publication date: 7 March 2022
Published in: Journal of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1906.10668
discrete logarithm problemdescent procedureelliptic curve model of a finite fieldquasi-polynomial complexity
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Elliptic curves (14H52)
Related Items
Tensors in computations ⋮ Dynamic universal accumulator with batch update over bilinear groups ⋮ Lattice packings of cross‐polytopes from Reed–Solomon codes and Sidon sets ⋮ A survey of elliptic curves for proof systems ⋮ Individual discrete logarithm with sublattice reduction ⋮ Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation ⋮ Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Weil bounds for singular curves
- Elliptic periods for finite fields
- A general framework for subexponential discrete logarithm algorithms
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- On the discrete logarithm problem in elliptic curves
- On the discrete logarithm problem in finite fields of fixed characteristic
- On the Selection of Polynomials for the DLP Quasi-Polynomial Time Algorithm for Finite Fields of Small Characteristic
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Abelian varieties over finite fields
- A new perspective on the powers of two descent for discrete logarithms in finite fields
This page was built for publication: Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic