Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem

Abstract

Some of the most efficient algorithms for finding the discrete logarithm involve pseudo-random implementations of Markov chains, with one or more “walks” proceeding until a collision occurs, i.e. some state is visited a second time. In this paper we develop a method for determining the expected time until the first collision. We use our technique to examine… (More)
DOI: 10.1007/978-3-662-46447-2_6

Topics

3 Figures and Tables

Cite this paper

@inproceedings{Kijima2015CollisionOR, title={Collision of Random Walks and a Refined Analysis of Attacks on the Discrete Logarithm Problem}, author={Shuji Kijima and Ravi Montenegro}, booktitle={Public Key Cryptography}, year={2015} }