Cryptography, Diffie Hellman, Key Exchange, Asymmetric Encryption, Elliptic Curve.
is quite same, the difference only in that Elliptic Curve Diffie–Hellman ensures the same safety as discrete logarithm Diffie–Hellman with lower number of bits of the prime modulus P. For instance, 521 bit modulus P used in Elliptic Curve Diffie–Hellman is equally safe as 2048 bit modulus in