A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm (Q5387613): Difference between revisions
From MaRDI portal
Item:Q5387613
Added link to MaRDI item. |
Removed claim: author (P16): Item:Q247100 |
||
| Property / author | |||
| Property / author: Prasad Tetali / rank | |||
Revision as of 19:52, 11 February 2024
scientific article; zbMATH DE number 5279301
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm |
scientific article; zbMATH DE number 5279301 |
Statements
A Birthday Paradox for Markov Chains, with an Optimal Bound for Collision in the Pollard Rho Algorithm for Discrete Logarithm (English)
0 references
27 May 2008
0 references
Birthday Paradox
0 references
Pollard rho
0 references
discrete logarithm
0 references
self intersection
0 references
collision time
0 references
