Algorithms to solve the finite field discrete logarithm problem

MaRDI QIDQ2998505zbMATH OpenFDO

Authors Antoine Joux, Reynald Lercier

Publication date 18 May 2011

zbMATH Keywords

complexitycryptographydiscrete logarithm problemfinite field

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Finite fields (field-theoretic aspects) (12E20) Number-theoretic algorithms; complexity (11Y16)

Recommendations

• scientific article; zbMATH DE number 5575556
• On the Discrete Logarithm Problem on Algebraic Tori
• A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
• On the discrete logarithm problem in elliptic curves
• Algebraic curves and cryptography

Cited in

(9)

• A Las Vegas algorithm to solve the elliptic curve discrete logarithm problem
• scientific article; zbMATH DE number 2079935 (Why is no real title available?)
• On the Discrete Logarithm Problem on Algebraic Tori
• The generalized Weil pairing and the discrete logarithm problem on elliptic curves
• scientific article; zbMATH DE number 7310271 (Why is no real title available?)
• Public Key Cryptography - PKC 2006
• Selecting polynomials for the function field sieve
• On the relation between Brauer groups and discrete logarithms
• Improvements to the general number field sieve for discrete logarithms in prime fields. A comparison with the gaussian integer method

This page was built for publication: Algorithms to solve the finite field discrete logarithm problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2998505)