0

The Diffie-Hellman key exchange algorithm can be used with SSH.

But how does SSH exchange the large safe prime p and the generator for a subgroup of GF(p) g? According to RFC 4253 the first steps are to send e & f which are calculated depending via:

 e = g^x mod p
 f = g^y mod p

Now x & y are randomly generated but how do both parties come to the same values of g and p? There seems to be no exchange happening of them.

Does anybody have an explanation for this?

0 Answers0