Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval

DOI10.1007/978-3-642-13013-7_22MaRDI QIDQ3562909zbMATH OpenOpenAlexWikidataFDO

Authors Steven D. Galbraith, Raminder S. Ruprai

Publication date 28 May 2010

Published in Public Key Cryptography – PKC 2010 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-13013-7_22

zbMATH Keywords

elliptic curvesnegation mapDiscrete Logarithm Problem (DLP)efficiently computable group homomorphisms

Mathematics Subject Classification ID

Cryptography (94A60) Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Applications to coding theory and cryptography of arithmetic geometry (14G50)

Recommendations

• Computing discrete logarithms in an interval
• Computing discrete logarithms with the parallelized kangaroo method.
• The parallelized Pollard kangaroo method in real quadratic function fields
• Solving discrete logarithm problem in an interval using periodic iterates
• Square-root algorithms for the discrete logarithm problem (a survey)

Cited in

(22)

• The parallelized Pollard kangaroo method in real quadratic function fields
• Modified Gaudry-Schost algorithm for the two-dimensional discrete logarithm problem
• Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm
• Recent progress on the elliptic curve discrete logarithm problem
• Computing discrete logarithms in an interval
• Computing interval discrete logarithm problem with restricted jump method
• A non-uniform birthday problem with applications to discrete logarithms
• О сложности двупараметрической задачи дискретного логарифмирования в конечной циклической группе с эффективным автоморфизмом
• A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity
• Computing discrete logarithms with the parallelized kangaroo method.
• How long does it take to catch a wild kangaroo?
• ON THE COMPLEXITY OF DISCRETE LOGARITHM PROBLEM IN AN INTERVAL IN A FINITE CYCLIC GROUP WITH EFFICIENT INVERSION
• Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms
• Reducing the key size of rainbow using non-commutative rings
• Solving discrete logarithm problem in an interval using periodic iterates
• Kangaroos, monopoly and discrete logarithms
• How to Solve Multiple Short-Exponent Discrete Logarithm Problem
• Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms
• Computational hardness of IFP and ECDLP
• A discrete EOQ problem is solvable in \(O(\log n)\) time
• Using equivalent class to solve interval discrete logarithm problem
• Implementation of point-counting algorithms on genus 2 hyperelliptic curves based on the birthday paradox

This page was built for publication: Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562909)