# Hardness of EC based DLP

I have a question about ECC based DLP.

I know that getting k is hard when kG is known. (G is a generator)

Question.

Is it still hard that getting kG where x is known? (in here, kG=(x,y))

or that getting k where x is known?

I think the former is not computationally hard. Am I right?

Thanks