Computing Interval Discrete Logarithm Problem with Restricted Jump Method
From MaRDI portal
Publication:4988923
DOI10.3233/FI-2020-1986zbMath1504.11132OpenAlexW3113565304MaRDI QIDQ4988923
Publication date: 20 May 2021
Published in: Fundamenta Informaticae (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3233/fi-2020-1986
Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Number-theoretic algorithms; complexity (11Y16)
Cites Work
- 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
- Speeding Up the Pollard Rho Method on Prime Fields
- Monte Carlo Methods for Index Computation (mod p)
- Computing discrete logarithms in an interval
- Solving Discrete Logarithms from Partial Knowledge of the Key
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item