Cryptography, Diffie Hellman, Key Exchange, Asymmetric Encryption, Elliptic Curve.
Z(p) is P − 1 then. Thus, the safety of the Diffie–Hellman protocol is based on the discrete logarithm problem which is unsolvable in polynomial time if the constants G and P are chosen correctly. Graphically the flow of the Diffie–Hellman protocol can be expressed through the analogy with mixing