Comparative Analysis of MOD-ECDH Algorithm and Various Algorithms

Cryptography has remained a well-known and well-researched topic for ages. It is the first line of defense for any networked system. A lot of algorithms have been developed using symmetric and asymmetric cryptographies. From the security point of view, Asymmetric Cryptography is more popular due to its enhanced security. RSA, DSA, ECS, DES, ECC, and other algorithms have been developed for realizing Asymmetric Cryptosystem. These algorithms are primarily used to ensure a secure and reliable communication. These algorithms play a vital role in establishing a secure line of communication. Elliptic Curve Cryptography (ECC) provides the same level of security with a smaller key size. In the present paper, a developed MOD-ECDH was proposed and, then, it was compared with other various popular algorithms like ECDH, RSA, and ECS. Empirical and simulation results of applying the algorithms of ECDH and MOD-ECDH were described in detail. According to the result analysis, it is evident that the proposed algorithm outperforms other algorithms in terms of processing time and key size.