Implementation of Elliptic Curve Diffie-Hellman (ECDH) for Encoding Messeges Becomes a Point on the GF(p)

Abstract

In data communication systems, the authenticity of data becomes important in the process of exchanging messages on insecure channels. If there is no security in the transmission process, then the possibility that occurs is an intercept from an irresponsible party. The elliptic curve defined in GF(p) is only closed to the sum, the process of adding two points in the elliptic curve always produces a point located on the elliptic curve, in this work using p = 149. The cryptography used by Elliptic Curve Diffe-Hellman (ECDH) to encrypt plaintext by changing the original message using a point on the curve with the help of the Python program. Elliptic Curve Cyptography (ECC) offers a better level of security compared to non-ECC cryptography because it has a shorter key size for example, a 160-bit ECC has a strength equivalent to 1024-bit RSA keys