Computing interval discrete logarithm problem with restricted jump method
From MaRDI portal
Recommendations
- Computing discrete logarithms in an interval
- Solving discrete logarithm problem in an interval using periodic iterates
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
- Computing discrete logarithms with the parallelized kangaroo method.
- Kangaroos, monopoly and discrete logarithms
Cites work
- Boneh-Boyen Signatures and the Strong Diffie-Hellman Problem
- Computing discrete logarithms in an interval
- scientific article; zbMATH DE number 1302855 (Why is no real title available?)
- scientific article; zbMATH DE number 1088239 (Why is no real title available?)
- scientific article; zbMATH DE number 1759796 (Why is no real title available?)
- scientific article; zbMATH DE number 3353398 (Why is no real title available?)
- Kangaroos, monopoly and discrete logarithms
- Monte Carlo Methods for Index Computation (mod p)
- On Diffie-Hellman Key Agreement with Short Exponents
- Security Analysis of the Strong Diffie-Hellman Problem
- Solving Discrete Logarithms from Partial Knowledge of the Key
- Speeding Up the Pollard Rho Method on Prime Fields
- Theory of Cryptography
- Using equivalence classes to accelerate solving the discrete logarithm problem in a short interval
Cited in
(3)
This page was built for publication: Computing interval discrete logarithm problem with restricted jump method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4988923)