A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1024052
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- Computation of discrete logarithms in an arbitrary finite field
- Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)
- On Computing Logarithms Over Finite Fields
Cites work
- A Fast Monte-Carlo Test for Primality
- 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>
- Discrete logarithms in \(\mathrm{GF}(p)\)
- Factoring integers with elliptic curves
- Factoring Polynomials Over Large Finite Fields
- Factoring with Cyclotomic Polynomials
- Fast Computation of Discrete Logarithms in GF (q)
- Fast evaluation of logarithms in fields of characteristic two
- Finding Isomorphisms Between Finite Fields
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- scientific article; zbMATH DE number 4077312 (Why is no real title available?)
- scientific article; zbMATH DE number 3760283 (Why is no real title available?)
- scientific article; zbMATH DE number 475432 (Why is no real title available?)
- scientific article; zbMATH DE number 3221502 (Why is no real title available?)
- scientific article; zbMATH DE number 3280208 (Why is no real title available?)
- New directions in cryptography
- On a problem of Oppenheim concerning Factorisatio Numerorum
- Primality testing and Abelian varieties over finite fields
- Probabilistic Algorithms in Finite Fields
- Solving sparse linear equations over finite fields
Cited in
(49)- Information authentication in automated control systems based on finite groups with multidimensional cyclicity
- Computation of discrete logarithms in prime fields
- A rigorous proof of the Waterloo algorithm for the discrete logarithm problem
- Function field sieve method for discrete logarithms over finite fields
- New series of rational approximations and some of their applications
- Complexity of a determinate algorithm for the discrete logarithm
- Study of the discrete logarithm problem in \(\mathbb{F}_{p^ 3}\)
- On the discrete logarithm problem for plane curves
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- A deterministic algorithm for the discrete logarithm problem in a semigroup
- On the discrete logarithm problem
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
- On the signature calculus for finite fields of order square of prime numbers
- The index calculus method using non-smooth polynomials
- Algebraic groups and discrete logarithm
- A general framework for subexponential discrete logarithm algorithms
- Finding discrete logarithms with a set orbit distinguisher
- Algorithms to solve the finite field discrete logarithm problem
- Structure computation and discrete logarithms in finite abelian \(p\)-groups
- scientific article; zbMATH DE number 2127885 (Why is no real title available?)
- The Function Field Sieve in the Medium Prime Case
- What is the inverse of repeated square and multiply algorithm?
- Fast Computation of Discrete Logarithms in GF (q)
- A subexponential-time algorithm for computing discrete logarithms over<tex>GF(p^2)</tex>
- scientific article; zbMATH DE number 3918261 (Why is no real title available?)
- On Computing Logarithms Over Finite Fields
- scientific article; zbMATH DE number 3956969 (Why is no real title available?)
- An algorithm for evaluation of discrete logarithms in some nonprime finite fields
- scientific article; zbMATH DE number 1210375 (Why is no real title available?)
- scientific article; zbMATH DE number 1024052 (Why is no real title available?)
- scientific article; zbMATH DE number 1500484 (Why is no real title available?)
- Smooth ideals in hyperelliptic function fields
- scientific article; zbMATH DE number 1795243 (Why is no real title available?)
- On the discrete logarithm problem in finite fields of fixed characteristic
- Slope packings and coverings, and generic algorithms for the discrete logarithm problem
- Computation of discrete logarithms in an arbitrary finite field
- On an probabilistic algorithm solving discrete logarithm problem
- Using number fields to compute logarithms in finite fields
- Solving systems of linear equations arising in the computation of logarithms in a finite prime field
- A subexponential-time algorithm for computing discrete logarithms over \(\mathrm{GF}(p^2)\)
- Parameterized Splitting Systems for the Discrete Logarithm
- On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
- A simplified approach to rigorous degree 2 elimination in discrete logarithm algorithms
- On the Discrete Logarithm Problem on Algebraic Tori
- Algebraic curves and cryptography
- A short proof for explicit formulas for discrete logarithms in finite fields
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Lifting of solutions of an exponential congruence
- A shorter proof for an explicit formula for discrete logarithms in finite fields
This page was built for publication: A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3137444)
