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

DOI10.1090/MCOM/3404MaRDI QIDQ5380102zbMATHOpenAlexWikidataFDO

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

Mathematics Subject Classification ID

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

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

Cites work

• 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.)
• 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)

• Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms
• A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• 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)