A Proposed Developments of Pollards Rho Method for Attacking the ECDLP

In cryptography, an attack is a method of solving a problem related to cryptosystem. Specifically, the aim of an attack is to find suitable fast method of solving a problem on which an encryption algorithm depends, or to find the secret key for encryption algorithm. This paper presents a proposed method for solving Elliptic Curve Discrete Logarithm Problem (ECDLP). Then present Developments that greatly reduce the Pollard’s Rho method operations for solving ECDLP. Three developed approaches are tested on the Pollards Rho method in order to reduce the total number of mathematical operations achieved within the method applied to solve the ECDLP. One of the proposed developing method provided a reduction in mathematical operation more than half of the total operations.