Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
From MaRDI portal
Publication:6182003
DOI10.1007/S00145-023-09487-XOpenAlexW4389303985MaRDI QIDQ6182003FDOQ6182003
Authors: Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot 
Publication date: 23 January 2024
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09487-x
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
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- 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
- Title not available (Why is that?)
- 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 \(\text{GF}(p^6)\)
- 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 \(\mathrm{GF}(p^n)\)
Cited In (1)
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)
