Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
From MaRDI portal
(Redirected from Publication:6182003)
Recommendations
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- The tower number field sieve
- Extended tower number field sieve: a new complexity for the medium prime case
- Individual discrete logarithm with sublattice reduction
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
Cites work
- A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic
- A short-list of pairing-friendly curves resistant to special TNFS at the 128-bit security level
- Algorithmic Number Theory
- An experiment of number field sieve for discrete logarithm problem over \(\mathrm{GF}(p^n)\)
- Collecting relations for the number field sieve in \(\text{GF}(p^6)\)
- Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
- Computing discrete logarithms in \(\mathbb F_{p^6}\)
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
- Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
- Extended tower number field sieve: a new complexity for the medium prime case
- Factoring integers with elliptic curves
- Faster cofactorization with ECM using mixed representations
- Faster individual discrete logarithms in finite fields of composite extension degree
- scientific article; zbMATH DE number 475433 (Why is no real title available?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
- Lattice enumeration using extreme pruning
- Lattice sieving in three dimensions for discrete log in medium characteristic
- Nearly sparse linear algebra and application to discrete logarithms computations
- New complexity trade-offs for the (multiple) number field sieve algorithm in non-prime fields
- On the discrete logarithm problem in finite fields of fixed characteristic
- Scalable zero knowledge via cycles of elliptic curves
- Solving sparse linear equations over finite fields
- The Magma algebra system. I: The user language
- The Number Field Sieve in the Medium Prime Case
- The tower number field sieve
- Using number fields to compute logarithms in finite fields
- Virtual logarithms
This page was built for publication: Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6182003)
