Skip to main content
Cryptography

Return to Question

added a tag; minor mistakes; readability; removed "thanks"
Source Link
Patriot
Patriot
  • 3.1k
  • 3
  • 19
  • 66

Hardness of EC based-based DLP

I have a question about ECC basedEC-based DLP.

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

 

Question.Question:

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

or that or getting k$k$ where x$x$ is known?

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

Thanks

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

Hardness of EC-based DLP

I have a question about EC-based DLP. I know that getting $k$ is hard when $kG$ is known. ($G$ is a generator)

Question:

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

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

Source Link
takita
takita
  • 509
  • 2
  • 8

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