Random Walks Revisited: Extensions of Pollard s Rho Algorithm for Computing Multiple Discrete Logarithms

Fabian Kuhn, René Struik. Random Walks Revisited: Extensions of Pollard s Rho Algorithm for Computing Multiple Discrete Logarithms. In Serge Vaudenay, Amr M. Youssef, editors, Selected Areas in Cryptography, 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001, Revised Papers. Volume 2259 of Lecture Notes in Computer Science, pages 212-229, Springer, 2001. [doi]

@inproceedings{KuhnS01,
  title = {Random Walks Revisited: Extensions of Pollard s Rho Algorithm for Computing Multiple Discrete Logarithms},
  author = {Fabian Kuhn and René Struik},
  year = {2001},
  url = {http://link.springer.de/link/service/series/0558/bibs/2259/22590212.htm},
  researchr = {https://researchr.org/publication/KuhnS01},
  cites = {0},
  citedby = {0},
  pages = {212-229},
  booktitle = {Selected Areas in Cryptography, 8th Annual International Workshop, SAC 2001 Toronto, Ontario, Canada, August 16-17, 2001, Revised Papers},
  editor = {Serge Vaudenay and Amr M. Youssef},
  volume = {2259},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {3-540-43066-0},
}