Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation

Cites Work

Title not available (Why is that?)
The Magma algebra system. I: The user language
Factoring integers with elliptic curves
Lattice basis reduction: Improved practical algorithms and solving subset sum problems
A Heuristic Quasi-Polynomial Algorithm for Discrete Logarithm in Finite Fields of Small Characteristic
New Complexity Trade-Offs for the (Multiple) Number Field Sieve Algorithm in Non-Prime Fields
Solving sparse linear equations over finite fields
Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
Algorithmic Number Theory
Lattice Enumeration Using Extreme Pruning
Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
The Number Field Sieve in the Medium Prime Case
Using number fields to compute logarithms in finite fields
On the discrete logarithm problem in finite fields of fixed characteristic
Faster individual discrete logarithms in finite fields of composite extension degree
Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
Scalable Zero Knowledge via Cycles of Elliptic Curves
The Tower Number Field Sieve
Nearly sparse linear algebra and application to discrete logarithms computations
Improving NFS for the Discrete Logarithm Problem in Non-prime Finite Fields
Collecting relations for the number field sieve in
Virtual logarithms
Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
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
Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
Lattice enumeration for tower NFS: a 521-bit discrete logarithm computation
An experiment of number field sieve for discrete logarithm problem over $\text{GF}(p^n)$

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)