Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
From MaRDI portal
Publication:2096516
DOI10.1007/978-3-030-56880-1_3zbMath1504.94109arXiv2006.06197OpenAlexW3034714558MaRDI QIDQ2096516
Fabrice Boudot, Nadia Heninger, Emmanuel Thomé, Pierrick Gaudry, Aurore Guillevic, Paul Zimmermann
Publication date: 9 November 2022
Full work available at URL: https://arxiv.org/abs/2006.06197
Related Items (4)
New discrete logarithm computation for the medium prime case using the function field sieve ⋮ Individual discrete logarithm with sublattice reduction ⋮ Concrete quantum cryptanalysis of binary elliptic curves via addition chain ⋮ Lattice enumeration and automorphisms for tower NFS: a 521-bit discrete logarithm computation
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The development of the number field sieve
- Subquadratic computation of vector generating polynomials and improvement of the block Wiedemann algorithm
- The middle product algorithm. I: Speeding up the division and square root of power series
- Faster cofactorization with ECM using mixed representations
- Better polynomials for GNFS
- Mersenne Factorization Factory
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix
- Square Root Algorithms for the Number Field Sieve
- On polynomial selection for the general number field sieve
- Online order basis algorithm and its impact on the block Wiedemann algorithm
- Factorization of a 768-Bit RSA Modulus
- Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm
- Discrete logarithms and local units
- A Uniform Approach for the Fast Computation of Matrix-Type Padé Approximants
- Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method
- Analysis of Coppersmith's Block Wiedemann Algorithm for the Parallel Solution of Sparse Linear Systems
- Factorization Using the Quadratic Sieve Algorithm
- A Kilobit Special Number Field Sieve Factorization
- Computation of a 768-Bit Prime Field Discrete Logarithm
- A Kilobit Hidden SNFS Discrete Logarithm Computation
This page was built for publication: Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment
