Computing discrete logarithms in an interval

DOI10.1090/S0025-5718-2012-02641-XzbMath1283.11164WikidataQ61914017 ScholiaQ61914017MaRDI QIDQ4912022

Steven D. Galbraith, Raminder S. Ruprai, J. M. Pollard

Publication date: 20 March 2013

Published in: Mathematics of Computation (Search for Journal in Brave)

zbMATH Keywords

random walksdiscrete logarithm problem (DLP)

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16) Randomized algorithms (68W20)

Related Items (10)

Computing elliptic curve discrete logarithms with improved baby-step giant-step algorithm ⋮ A variant of the Galbraith-Ruprai algorithm for discrete logarithms with improved complexity ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ A non-uniform birthday problem with applications to discrete logarithms ⋮ Recent progress on the elliptic curve discrete logarithm problem ⋮ Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates ⋮ An optimal distributed discrete log protocol with applications to homomorphic secret sharing ⋮ Non-uniform birthday problem revisited: refined analysis and applications to discrete logarithms ⋮ Improving the Gaudry-Schost algorithm for multidimensional discrete logarithms ⋮ Computing Interval Discrete Logarithm Problem with Restricted Jump Method

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A non-uniform birthday problem with applications to discrete logarithms
• Parallel collision search with cryptanalytic applications
• Kangaroos, monopoly and discrete logarithms
• On Diffie-Hellman Key Agreement with Short Exponents
• Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
• Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval
• Security Analysis of the Strong Diffie-Hellman Problem
• An Improvement to the Gaudry-Schost Algorithm for Multidimensional Discrete Logarithm Problems
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• On waiting time in the scheme of random allocation of coloured particies
• How long does it take to catch a wild kangaroo?
• Solving Discrete Logarithms from Partial Knowledge of the Key
• Algorithmic Number Theory
• Theory of Cryptography

This page was built for publication: Computing discrete logarithms in an interval