Diffie Hellman, Encryption, Symmetric Encryption, Cryptography, Security.
you recall the definition of a primitive root modulo p, this means the shared secret can be any number between 1 and p-1. In other words, this gives us a large range of potential values for the shared secret (as long as p is large), which is good for security. Lastly, you need to understand that in