A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
From MaRDI portal
Publication:5380102
DOI10.1090/MCOM/3404zbMATH Open1473.11227OpenAlexW2810300322WikidataQ129108797 ScholiaQ129108797MaRDI QIDQ5380102FDOQ5380102
Authors: Faruk Göloğlu, Antoine Joux 
Publication date: 14 June 2019
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/mcom/3404
Recommendations
- Factor base discrete logarithms in Kummer extensions
- A new index calculus algorithm with complexity \(L(1/4+o(1))\) in small characteristic
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- Solving a $$6120$$ -bit DLP on a Desktop Computer
- Indiscreet logarithms in finite fields of small characteristic
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
- On the discrete logarithm problem in finite fields of fixed characteristic
Cited In (4)
- Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
- Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
- An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
This page was built for publication: A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5380102)
