A proposed developed theorems for mathematical analysis of elliptic curve discrete logarithm problem (ECDLP)‎

Abstract EN

One of the problems that have found great popularity in cryptography is the problem of discrete logarithms in a subgroup of order n of an elliptic curve over the finite field used for authentication and secrecy systems.

This paper presents a proposed developed theorems and corollaries that relating to computation the Elliptic Curve Discrete Logarithm Problem (ECDLP).

These theorems are the results from mathematical analysis and investigation of the published literatures of the well known methods used to treat the attacks problems of ECDLP, especially following the Polared Rho Method.