A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms

DOI10.1090/mcom/3404zbMath1473.11227OpenAlexW2810300322WikidataQ129108797 ScholiaQ129108797MaRDI QIDQ5380102

Antoine Joux, Faruk Göloğlu

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

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)

Cites Work

• Improving the Polynomial time Precomputation of Frobenius Representation Discrete Logarithm Algorithms
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• On the discrete logarithm problem in finite fields of fixed characteristic

This page was built for publication: A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms