Skip to main content
Cryptography

Return to Question

Add a tag that seems relevent to me
Link
edit approved Nov 12, 2019 at 15:01
Ievgeni
edit approved Nov 12, 2019 at 15:01
Ievgeni
  • 2.6k
  • 1
  • 11
  • 33
Tweeted twitter.com/#!/StackCrypto/status/148000548568842240
formatting, rewording
Source Link
Paŭlo Ebermann
Paŭlo Ebermann
  • 22.8k
  • 7
  • 81
  • 118

What is the relation between Discrete Log Problem -, Computational Diffie-Hellman - Desicionaland Decisional Diffie-Hellman?

How are thesethe three problems Discrete Logarithm, Computational Diffie-Hellman and Decisional Diffie-Hellman related?

From my understanding, since the Discrete Log  (DL) Problem is considered hard, then so is CDH. And since CDH is considered hard, then so is DDH.

http://en.wikipedia.org/wiki/Decisional_Diffie%E2%80%93Hellman_assumption

On the wikipedia article for DDHWikipedia article for DDH it mentions that DDH is considered a stronger assumption than CDH. What does that mean?

Discrete Log Problem - Computational Diffie-Hellman - Desicional Diffie-Hellman

How are these three problems related?

From my understanding, since the Discrete Log(DL) Problem is considered hard, then so is CDH. And since CDH is considered hard, then so is DDH.

http://en.wikipedia.org/wiki/Decisional_Diffie%E2%80%93Hellman_assumption

On the wikipedia article for DDH it mentions that DDH is considered a stronger assumption than CDH. What does that mean?

What is the relation between Discrete Log, Computational Diffie-Hellman and Decisional Diffie-Hellman?

How are the three problems Discrete Logarithm, Computational Diffie-Hellman and Decisional Diffie-Hellman related?

From my understanding, since the Discrete Log  (DL) Problem is considered hard, then so is CDH. And since CDH is considered hard, then so is DDH.

On the Wikipedia article for DDH it mentions that DDH is considered a stronger assumption than CDH. What does that mean?

Source Link
Bobby S
Bobby S
  • 2k
  • 4
  • 23
  • 30

Discrete Log Problem - Computational Diffie-Hellman - Desicional Diffie-Hellman

How are these three problems related?

From my understanding, since the Discrete Log(DL) Problem is considered hard, then so is CDH. And since CDH is considered hard, then so is DDH.

http://en.wikipedia.org/wiki/Decisional_Diffie%E2%80%93Hellman_assumption

On the wikipedia article for DDH it mentions that DDH is considered a stronger assumption than CDH. What does that mean?