If G(x,y)
and P(x,y)
are on a secure elliptic curve for ECC, the problem of solving k is called "elliptic curve discrete logarithm problem", or ECDLP. It is infeasible to find k on a secure elliptic curve.
If you're not on such curve, enumerating all possible k
and see if G=kP is a reasonable approach.