-2
$\begingroup$

Hi I am very new to this field and I was wondering how one would prove or disprove the following statements:

1) if the DH key exchange protocol is secure for a finite cyclic group G, then computing the DL is hard in G.

2) If computing the DL is hard in G, then the DH key exchange protocol is secure in G.

$\endgroup$
1
$\begingroup$

(1) is easy; you just prove the contrapositive (which is logically equivalent):

If computing the DL is easy in a finite cyclic group G, then the
DH key exchange protocol is insecure in G

This is straight-forward.

(2) has no known proof.

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.