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

DOI10.1007/978-3-030-92062-3_3MaRDI QIDQ6157486zbMATH OpenOpenAlexFDO

Authors Gabrielle De Micheli, Pierrick Gaudry, Cécile Pierrot

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

zbMATH Keywords

number field sievetower variant

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• The tower number field sieve
• Extended tower number field sieve: a new complexity for the medium prime case
• Extended Tower Number Field Sieve with Application to Finite Fields of Arbitrary Composite Extension Degree
• The multiple number field sieve with conjugation and generalized Joux-Lercier methods
• The multiple number field sieve for medium- and high-characteristic finite fields

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)\)
• 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
• 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 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 Number Field Sieve in the Medium Prime Case
• The tower number field sieve
• Using number fields to compute logarithms in finite fields

Cited in

(10)

• Lattice sieving in three dimensions for discrete log in medium characteristic
• Families of SNARK-friendly 2-chains of elliptic curves
• The tower number field sieve
• On the use of the lattice sieve in the 3D NFS
• scientific article; zbMATH DE number 6292594 (Why is no real title available?)
• 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
• A short-list of pairing-friendly curves resistant to the special TNFS algorithm at the 192-bit security level
• Discrete logarithm factory

This page was built for publication: Lattice enumeration 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 Q6157486)