A general framework for subexponential discrete logarithm algorithms
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1795243
- scientific article; zbMATH DE number 799760
- An algorithm for solving the discrete log problem on hyperelliptic curves
- A Subexponential Algorithm for Discrete Logarithms Over all Finite Fields
- An L (1/3 + ε) Algorithm for the Discrete Logarithm Problem for Low Degree Curves
Cited in
(49)- Index calculus attack for Jacobian of hyperelliptic curves of small genus using two large primes
- Index calculus in the trace zero variety
- A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
- A double large prime variation for small genus hyperelliptic index calculus
- Computation of a 30750-bit binary field discrete logarithm
- Koblitz curves over quadratic fields
- Hyperelliptic curves, Cartier-Manin matrices and Legendre polynomials
- Curves, Jacobians, and cryptography
- Finding discrete logarithms with a set orbit distinguisher
- Algebraic groups and discrete logarithm
- Algebraic curves and cryptography
- A new perspective on the powers of two descent for discrete logarithms in finite fields
- Elementary thoughts on discrete logarithms
- Smooth ideals in hyperelliptic function fields
- scientific article; zbMATH DE number 5289787 (Why is no real title available?)
- A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
- An \(L(1/3)\) discrete logarithm algorithm for low degree curves
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields
- On the discrete logarithm problem in finite fields of fixed characteristic
- Formulae for arithmetic on genus 2 hyperelliptic curves
- Field extensions and index calculus on algebraic curves
- Slope packings and coverings, and generic algorithms for the discrete logarithm problem
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- ON BOUNDS FOR BALANCED EMBEDDING DEGREE
- A review on the isomorphism classes of hyperelliptic curves of genus 2 over finite fields admitting a Weierstrass point
- Constructive and destructive facets of Weil descent on elliptic curves
- Groups from cyclic infrastructures and Pohlig-Hellman in certain infrastructures
- scientific article; zbMATH DE number 799760 (Why is no real title available?)
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- On the complexity of the discrete logarithm and Diffie-Hellman problems
- Smoothness testing of polynomials over finite fields
- Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time
- LATIN 2004: Theoretical Informatics
- On algorithmic constructions of isogenies of elliptic curves over finite fields and their applications
- Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
- The arithmetic of Jacobian groups of superelliptic cubics
- On the discrete logarithm problem in class groups of curves
- Index calculus in class groups of non-hyperelliptic curves of genus three
- Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
- Cryptographic implications of Hess' generalized GHS attack
- A new method for decomposition in the Jacobian of small genus hyperelliptic curves
- Indiscreet logarithms in finite fields of small characteristic
- scientific article; zbMATH DE number 1795243 (Why is no real title available?)
- Discrete logarithms in quasi-polynomial time in finite fields of fixed characteristic
- An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
- Parameterized Splitting Systems for the Discrete Logarithm
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma
This page was built for publication: A general framework for subexponential discrete logarithm algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2781453)
