Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
From MaRDI portal
Publication:6157486
DOI10.1007/978-3-030-92062-3_3zbMath1514.94074OpenAlexW3216932868MaRDI QIDQ6157486
Cécile Pierrot, Pierrick Gaudry, Gabrielle De Micheli
Publication date: 12 May 2023
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-030-92062-3_3
Related Items (4)
Families of SNARK-friendly 2-chains of elliptic curves ⋮ A survey of elliptic curves for proof systems ⋮ Individual discrete logarithm with sublattice reduction ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
Cites Work
- Unnamed Item
- Factoring integers with elliptic curves
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Lattice sieving in three dimensions for discrete log in medium characteristic
- Faster cofactorization with ECM using mixed representations
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- The Tower Number Field Sieve
- New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
- Nearly sparse linear algebra and application to discrete logarithms computations
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Lattice Enumeration Using Extreme Pruning
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Solving sparse linear equations over finite fields
- On the discrete logarithm problem in finite fields of fixed characteristic
- Faster individual discrete logarithms in finite fields of composite extension degree
- Using number fields to compute logarithms in finite fields
- A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- The Number Field Sieve in the Medium Prime Case
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
- Algorithmic Number Theory
This page was built for publication: Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
