Recent progress on the elliptic curve discrete logarithm problem

DOI10.1007/S10623-015-0146-7zbMATH Open1364.11164DBLPjournals/dcc/GalbraithG16OpenAlexW2218139189WikidataQ61914006 ScholiaQ61914006MaRDI QIDQ908041FDOQ908041

Authors: Steven D. Galbraith, Pierrick Gaudry 

Publication date: 2 February 2016

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://hal.inria.fr/hal-01215623/file/DCC-survey.pdf

Recommendations

• 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

zbMATH Keywords

discrete logarithm problem (DLP)elliptic curve discrete logarithm problem (ECDLP)index-calculusPollard rhosummation polynomials

Mathematics Subject Classification ID

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)

Cites Work

• Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction
• On the discrete logarithm problem in class groups of curves
• Title not available (Why is that?)
• Elliptic curves. Number theory and cryptography
• Elliptic and Hyperelliptic Curves: A Practical Security Analysis
• Efficient computation of zero-dimensional Gröbner bases by change of ordering
• Mathematics of public key cryptography.
• Handbook of Elliptic and Hyperelliptic Curve Cryptography
• Advances in Elliptic Curve Cryptography
• Advances in Cryptology - EUROCRYPT 2004
• Parallel collision search with cryptanalytic applications
• Title not available (Why is that?)
• Kangaroos, monopoly and discrete logarithms
• Security Analysis of the Strong Diffie-Hellman Problem
• Algorithmic Cryptanalysis
• Title not available (Why is that?)
• Constructing Isogenies between Elliptic Curves Over Finite Fields
• Improving the parallelized Pollard lambda search on anomalous binary curves
• Title not available (Why is that?)
• Do All Elliptic Curves of the Same Order Have the Same Difficulty of Discrete Log?
• On the discrete logarithm problem in elliptic curves. II
• Title not available (Why is that?)
• Cover and Decomposition Index Calculus on Elliptic Curves Made Practical
• Title not available (Why is that?)
• On the last fall degree of zero-dimensional Weil descent systems
• Improving the Complexity of Index Calculus Algorithms in Elliptic Curves over Binary Fields
• First fall degree and Weil descent
• On Polynomial Systems Arising from a Weil Descent
• Algorithmic Number Theory
• Complexity of a determinate algorithm for the discrete logarithm
• Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
• Computing discrete logarithms in an interval
• A birthday paradox for Markov chains with an optimal bound for collision in the Pollard rho algorithm for discrete logarithm
• Constructive and destructive facets of Weil descent on elliptic curves
• Generalising the GHS Attack on the Elliptic Curve Discrete Logarithm Problem
• Discrete logarithm problems with auxiliary inputs
• On the static Diffie-Hellman problem on elliptic curves over extension fields
• On the correct use of the negation map in the Pollard rho method
• A double large prime variation for small genus hyperelliptic index calculus
• On the use of the negation map in the Pollard rho method
• Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem
• Elliptic curve discrete logarithm problem over small degree extension fields
• Title not available (Why is that?)
• On the discrete logarithm problem in elliptic curves
• Using symmetries in the index calculus for elliptic curves discrete logarithm
• Title not available (Why is that?)
• Decomposition attack for the Jacobian of a hyperelliptic curve over an extension field
• Algorithmic Number Theory
• Index calculus attack for hyperelliptic curves of small genus
• Intractable problems in cryptography
• Multi-user Collisions: Applications to Discrete Logarithm, Even-Mansour and PRINCE
• Title not available (Why is that?)
• Summation Polynomial Algorithms for Elliptic Curves in Characteristic Two
• Title not available (Why is that?)
• Title not available (Why is that?)
• Hard Problems of Algebraic Geometry Codes
• Elliptic codes over fields of characteristic 2
• Analysis of the Xedni calculus attack
• Title not available (Why is that?)
• Point Decomposition Problem in Binary Elliptic Curves
• Solving the Elliptic Curve Discrete Logarithm Problem Using Semaev Polynomials, Weil Descent and Gröbner Basis Methods – An Experimental Study
• Improvement of Faugère et al.’s Method to Solve ECDLP
• Last Fall Degree, HFE, and Weil Descent Attacks on ECDLP
• Deterministically generating Picard groups of hyperelliptic curves over finite fields
• Speeding up elliptic curve discrete logarithm computations with point halving
• A simple method for obtaining relations among factor basis elements for special hyperelliptic curves
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• A Generic Algorithm for Small Weight Discrete Logarithms in Composite Groups
• Solving the Discrete Logarithm of a 113-Bit Koblitz Curve with an FPGA Cluster
• Non-uniform Cracks in the Concrete: The Power of Free Precomputation
• Computing Small Discrete Logarithms Faster
• Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve
• Title not available (Why is that?)
• Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem
• Generic Hardness of the Multiple Discrete Logarithm Problem
• A Group Action on $${\mathbb Z}_p^{\times }$$ and the Generalized DLP with Auxiliary Inputs
• ANALYSIS OF POSSIBLE PRE-COMPUTATION AIDED DLP SOLVING ALGORITHMS
• Global Duality, Signature Calculus and the Discrete Logarithm Problem
• On the relation between Brauer groups and discrete logarithms
• Sub-cubic change of ordering for Gröbner basis
• A new approach to the discrete logarithm problem with auxiliary inputs
• Another look at non-standard discrete log and Diffie-Hellman problems
• Oracle-assisted static Diffie-Hellman is easier than discrete logarithms
• The Strong Law of Small Numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• Slope packings and coverings, and generic algorithms for the discrete logarithm problem
• How long does it take to catch a wild kangaroo?
• Analysis on a generalized algorithm for the strong discrete logarithm problem with auxiliary inputs
• Symmetrized Summation Polynomials: Using Small Order Torsion Points to Speed Up Elliptic Curve Index Calculus
• Remarks on Cheon’s Algorithms for Pairing-Related Problems
• Title not available (Why is that?)

Cited In (23)

• Acceleration of Index Calculus for Solving ECDLP over Prime Fields and Its Limitation
• A probabilistic analysis on a lattice attack against DSA
• On index calculus algorithms for subfield curves
• Koblitz curves over quadratic fields
• Still wrong use of pairings in cryptography
• Несколько замечаний о задаче дискретного логарифмирования на эллиптических кривых
• Complexity bounds on Semaev's naive index calculus method for ECDLP
• Short Generators Without Quantum Computers: The Case of Multiquadratics
• 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 first fall degree of summation polynomials
• 2DT-GLS: faster and exception-free scalar multiplication in the GLS254 binary curve
• 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
• 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
• Title not available (Why is that?)
• 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)