A VARIANT OF POLLARD’S RHO ATTACK ON ELLIPTIC CURVE CRYPTOSYSTEMS
Siham Ezzouak, Mohammed Elamrani and Abdelmalek Azizi
DOI : 10.3844/jcssp.2014.1575.1581
Journal of Computer Science
Volume 10, Issue 8
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.
© 2014 Siham Ezzouak, Mohammed Elamrani and Abdelmalek Azizi. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.