Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates

DOI10.1007/978-3-319-89500-0_6zbMath1452.94076OpenAlexW2797215380MaRDI QIDQ3297479

Jianing Liu, Kewei Lv

Publication date: 20 July 2020

Published in: Information and Communications Security (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-89500-0_6

zbMATH Keywords

discrete logarithm problemPollard's rho methodPollard's kangaroos method

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Kangaroos, monopoly and discrete logarithms
• On Diffie-Hellman Key Agreement with Short Exponents
• Security Analysis of the Strong Diffie-Hellman Problem
• Speeding Up the Pollard Rho Method on Prime Fields
• Computing discrete logarithms in an interval
• Solving Discrete Logarithms from Partial Knowledge of the Key
• Algorithmic Number Theory
• Theory of Cryptography

This page was built for publication: Solving Discrete Logarithm Problem in an Interval Using Periodic Iterates