@article {10.3844/jcssp.2014.1575.1581,
article_type = {journal},
title = {A VARIANT OF POLLARD'S RHO ATTACK ON ELLIPTIC CURVE CRYPTOSYSTEMS},
author = {Ezzouak, Siham and Elamrani, Mohammed and Azizi, Abdelmalek},
volume = {10},
number = {8},
year = {2014},
month = {Apr},
pages = {1575-1581},
doi = {10.3844/jcssp.2014.1575.1581},
url = {https://thescipub.com/abstract/jcssp.2014.1575.1581},
abstract = {Elliptic Curve cryptosystems appear to be more secure and  efficient when requiring small  key size to implement than other  public key cryptosystems. Its security is based upon the difficulty of solving Elliptic Curve Discrete Logarithm Problem (ECDLP). This study proposes a variant of generic algorithm Pollard's Rho  for finding ECDLP using cycle detection with stack  and a mixture of cycle detection and random walks. The Pollard's Rho using cycle detection with stack requires less  iterations  than Pollard's Rho original in reaching collision. Random walks allow the iteration function to act randomly than the original iteration function, thus, the Pollard rho method performs more efficiently. In practice, the experiment results show that the proposed methods decreases the number of iterations and  speed up the computation of discrete logarithm problem on elliptic curves.},
journal = {Journal of Computer Science},
publisher = {Science Publications}
}