Logarithm problem
From Elliptic Curve Crypto
The difficulty, or assumed difficulty, of the elliptic curve discrete logarithm problem is essentially the basis for the claimed security of all elliptic curve public key cryptographic schemes such as Ed25519.
Given two points P and Q on an elliptic curve over a finite field, the objective is to find the number of times P should be composed with itself using the point group operation to yield Q.
The baby-step giant-step algorithm [1][2] and Pollard’s rho algorithm [3] are two of the most well known methods of solving small examples of this problem.
