The importance of information security led to the evolution of cryptography. Cryptography aims a keeping information secure. Encryption is the process of converting a plain text into cipher text and decryption is the process of getting back the original message from the cipher text. Cryptography provides confidentiality, as well as authentication, integrity and non-repudiation. The strength of a cryptosystem relies heavily on the key used in the encryption/decryption process. It is the key size that makes it difficult to perform a brute force attack. However, this requires more processing power and increases the complexity of the algorithm. Cryptosystems implemented based on elliptic curves can provide the same level of security but with smaller key sizes. This paper introduces two cryptographic algorithms using elliptic curve and compares them with two novel algorithms that base on Elliptic Curve Diffie–Hellman Key Exchange. Our experimental results of the proposed algorithms show valuable improvements in the performance compared to those algorithms pervious proposed. Where a simulation program will be written using Java platform and using Netbeans integrated development environment (IDE) to get results.