Diffie-Hellman

• (does not require a third party

  • A and B exchange two numbers p and g.
  • Each chooses a 512-bit number, s1 and s2, and keeps it secret
  • Each raises g to its secret number mod p. (gs1 mod p)
  • They exchange these values and raise them to their secret numbers (gs1 mod p)s2.
  • They now have the same secret key with only one exchange.