Diffie Hellman, Encryption, Symmetric Encryption, Cryptography, Security.
possibilities), and it is also very hard to solve for a given only g, p, and gᵃ mod p (this is called the discrete logarithm problem). How to Choose Good Numbers Above, I mentioned that p should be large to make Diffie-Hellman secure. In practice, how is p chosen? For that matter, how are g, a, and