Lesson 30: The Key Exchange Problem

This video describes the issues with exchanging cryptographic keys and describes the Diffie-Hellman key exchange protocol to generate a shared secret over public channels. There is one example of computing a shared key value mathematically using DH key exchange. It's important to note that choosing the values of g and p is very important. The short version: p must be prime, and g must be a primitive root modulo p. These values should be very large (hundreds of digits) for this method to be secure. For more information, read: https://en.wikipedia.org/wiki/Diffie%...