Collision bounds for the additive Pollard rho algorithm for solving discrete logarithms
We prove collision bounds for the Pollard rho algorithm to solve the discrete logarithm problem in a general cyclic group $\mathbf {G}$. Unlike the setting studied by Kim et al., we consider additive walks: the setting used in practice to solve the elliptic curve discrete logarithm problem. Our bou...
Guardado en:
| Autores principales: | , , |
|---|---|
| Formato: | Artigo |
| Lenguaje: | Inglês |
| Publicado: |
De Gruyter
2014-02-01
|
| Colección: | Journal of Mathematical Cryptology |
| Materias: | |
| Acceso en línea: | https://doi.org/10.1515/jmc-2012-0032 |
| Etiquetas: |
Sin Etiquetas, Sea el primero en etiquetar este registro!
|