Recent progress on the elliptic curve discrete logarithm problem
discrete logarithm problem (DLP)elliptic curve discrete logarithm problem (ECDLP)index-calculusPollard rhosummation polynomials
Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Curves over finite and local fields (11G20) Number-theoretic algorithms; complexity (11Y16) Finite ground fields in algebraic geometry (14G15) Applications to coding theory and cryptography of arithmetic geometry (14G50) Elliptic curves (14H52)
- On the discrete logarithm problem in elliptic curves
- Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
- On the discrete logarithm problem for prime-field elliptic curves
- On the discrete logarithm problem in elliptic curves. II
- The Elliptic Curve Discrete Logarithm Problem and Equivalent Hard Problems for Elliptic Divisibility Sequences
- Algebraic approaches for the elliptic curve discrete logarithm problem over prime fields
- Algorithms and Computation
- Discrete logarithms on elliptic curves
- scientific article; zbMATH DE number 1643938
- scientific article; zbMATH DE number 1594291 (Why is no real title available?)
- scientific article; zbMATH DE number 1617935 (Why is no real title available?)
- scientific article; zbMATH DE number 1643940 (Why is no real title available?)
- scientific article; zbMATH DE number 6382357 (Why is no real title available?)
- scientific article; zbMATH DE number 6488034 (Why is no real title available?)
- scientific article; zbMATH DE number 4077312 (Why is no real title available?)
- scientific article; zbMATH DE number 1304118 (Why is no real title available?)
- scientific article; zbMATH DE number 1349933 (Why is no real title available?)
- scientific article; zbMATH DE number 2034310 (Why is no real title available?)
- scientific article; zbMATH DE number 2042679 (Why is no real title available?)
- scientific article; zbMATH DE number 2085207 (Why is no real title available?)
- scientific article; zbMATH DE number 2086697 (Why is no real title available?)
- scientific article; zbMATH DE number 2114384 (Why is no real title available?)
- scientific article; zbMATH DE number 799760 (Why is no real title available?)
- scientific article; zbMATH DE number 1424171 (Why is no real title available?)
- A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
- A double large prime variation for small genus hyperelliptic index calculus
- A group action on \({\mathbb Z}_p^{\times}\) and the generalized DLP with auxiliary inputs
- A new approach to the discrete logarithm problem with auxiliary inputs
- A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Elliptic Curve Cryptography
- Algorithmic Cryptanalysis
- Algorithmic Number Theory
- Algorithmic Number Theory
- Analysis of possible pre-computation aided DLP solving algorithms
- Analysis of the Xedni calculus attack
- Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
- Another look at non-standard discrete log and Diffie-Hellman problems
- Collision of random walks and a refined analysis of attacks on the discrete logarithm problem
- Complexity of a determinate algorithm for the discrete logarithm
- Computing discrete logarithms in an interval
- Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
- Computing small discrete logarithms faster
- Constructing Isogenies between Elliptic Curves Over Finite Fields
- Constructive and destructive facets of Weil descent on elliptic curves
- Cover and decomposition index calculus on elliptic curves made practical. Application to a previously unreachable curve over \(\mathbb{F}_{p^6}\)
- Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field
- Deterministically generating Picard groups of hyperelliptic curves over finite fields
- Discrete logarithm problems with auxiliary inputs
- Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
- Efficient computation of zero-dimensional Gröbner bases by change of ordering
- Elliptic and hyperelliptic curves: a practical security analysis
- Elliptic codes over fields of characteristic 2
- Elliptic curve discrete logarithm problem over small degree extension fields
- Elliptic curves with weak coverings over cubic extensions of finite fields with odd characteristic
- Elliptic curves. Number theory and cryptography
- First fall degree and Weil descent
- Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
- Generic Hardness of the Multiple Discrete Logarithm Problem
- Global duality, signature calculus and the discrete logarithm problem
- Handbook of Elliptic and Hyperelliptic Curve Cryptography
- Hard Problems of Algebraic Geometry Codes
- How long does it take to catch a wild kangaroo?
- Improvement of Faugère et al.'s method to solve ECDLP
- Improving the complexity of index calculus algorithms in elliptic curves over binary fields
- Improving the parallelized Pollard lambda search on anomalous binary curves
- Index calculus attack for hyperelliptic curves of small genus
- Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
- Intractable problems in cryptography
- Kangaroos, monopoly and discrete logarithms
- Last fall degree, HFE, and Weil descent attacks on ECDLP
- Mathematics of public key cryptography.
- Multi-user collisions: applications to discrete logarithm, Even-Mansour and PRINCE
- Non-uniform cracks in the concrete: the power of free precomputation
- On polynomial systems arising from a Weil descent
- On the correct use of the negation map in the Pollard rho method
- On the discrete logarithm problem in class groups of curves
- On the discrete logarithm problem in elliptic curves
- On the discrete logarithm problem in elliptic curves. II
- On the last fall degree of zero-dimensional Weil descent systems
- On the relation between Brauer groups and discrete logarithms
- On the static Diffie-Hellman problem on elliptic curves over extension fields
- On the use of the negation map in the Pollard rho method
- Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
- Parallel collision search with cryptanalytic applications
- Remarks on Cheon’s Algorithms for Pairing-Related Problems
- Security Analysis of the Strong Diffie-Hellman Problem
- Slope packings and coverings, and generic algorithms for the discrete logarithm problem
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
- Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
- Solving the discrete logarithm of a 113-bit Koblitz curve with an FPGA cluster
- Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods -- an experimental study
- Speeding up elliptic curve discrete logarithm computations with point halving
- Sub-cubic change of ordering for Gröbner basis: a probabilistic approach
- Summation polynomial algorithms for elliptic curves in characteristic two
- Symmetrized summation polynomials: using small order torsion points to speed up elliptic curve index calculus
- The Strong Law of Small Numbers
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
- Using symmetries in the index calculus for elliptic curves discrete logarithm
- Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
- On index calculus algorithms for subfield curves
- A probabilistic analysis on a lattice attack against DSA
- Koblitz curves over quadratic fields
- Still wrong use of pairings in cryptography
- Complexity bounds on Semaev's naive index calculus method for ECDLP
- Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
- A generalization of the anomalous attack for the ECDLP over \(\mathbb Q_p\)
- The multi-base discrete logarithm problem: tight reductions and non-rewinding proofs for Schnorr identification and signatures
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- Can we beat the square root bound for ECDLP over \(\mathbb{F}_p^2\) via representation?
- On the possibility of transformation of multidimensional ECDLP into 1-dimensional ECDLP
- On the computational complexity of ECDLP for elliptic curves in various forms using index calculus
- Solving 114-bit ECDLP for a Barreto-Naehrig curve
- Summation polynomial algorithms for elliptic curves in characteristic two
- On the first fall degree of summation polynomials
- 2DT-GLS: faster and exception-free scalar multiplication in the GLS254 binary curve
- Short generators without quantum computers: the case of multiquadratics
- Low weight discrete logarithm and subset sum in \(2^{0.65n}\) with polynomial memory
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic
- Solving the elliptic curve discrete logarithm problem using Semaev polynomials, Weil descent and Gröbner basis methods -- an experimental study
- Cryptocash, cryptocurrencies, and cryptocontracts
- Efficient Software Implementation of Laddering Algorithms Over Binary Elliptic Curves
- An authenticated key scheme over elliptic curves for topological networks
- On the discrete logarithm problem for prime-field elliptic curves
- Source-location privacy full protection in wireless sensor networks
- Algebraic approaches for the elliptic curve discrete logarithm problem over prime fields
- scientific article; zbMATH DE number 4179451 (Why is no real title available?)
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma
- New results on quasi-subfield polynomials
This page was built for publication: Recent progress on the elliptic curve discrete logarithm problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q908041)