A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields

DOI10.2307/2152932zbMath0784.11060OpenAlexW4248835387MaRDI QIDQ3137444

Jonathan DeMarrais, Leonard M. Adleman

Publication date: 4 January 1994

Full work available at URL: https://doi.org/10.2307/2152932

zbMATH Keywords

complexityfinite fielddiscrete logarithm problemsubexponential algorithm

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Algebraic number theory computations (11Y40)

Related Items (9)

Smooth ideals in hyperelliptic function fields ⋮ A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point ⋮ A deterministic algorithm for the discrete logarithm problem in a semigroup ⋮ A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms ⋮ Algebraic curves and cryptography ⋮ The Function Field Sieve in the Medium Prime Case ⋮ Using number fields to compute logarithms in finite fields ⋮ Information authentication in automated control systems based on finite groups with multidimensional cyclicity ⋮ Function field sieve method for discrete logarithms over finite fields

Cites Work

• On a problem of Oppenheim concerning Factorisatio Numerorum
• Factoring integers with elliptic curves
• Discrete logarithms in \(\mathrm{GF}(p)\)
• Primality testing and Abelian varieties over finite fields
• Fast evaluation of logarithms in fields of characteristic two
• Finding Isomorphisms Between Finite Fields
• Fast Computation of Discrete Logarithms in GF (q)
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
• Solving sparse linear equations over finite fields
• Factoring with Cyclotomic Polynomials
• New directions in cryptography
• Probabilistic Algorithms in Finite Fields
• A Fast Monte-Carlo Test for Primality
• Factoring Polynomials Over Large Finite Fields
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields