Volume 31, Issue 2 (IJIEPR 2020)                   IJIEPR 2020, 31(2): 301-308 | Back to browse issues page


XML Print


Download citation:
BibTeX | RIS | EndNote | Medlars | ProCite | Reference Manager | RefWorks
Send citation to:

Nagesh O S, S Naresh V. COMPARATIVE ANALYSIS OF MOD-ECDH ALGORITHM WITH VARIOUS ALGORITHMS. IJIEPR 2020; 31 (2) :301-308
URL: http://ijiepr.iust.ac.ir/article-1-1061-en.html
1- Department of CSE, Sri Vasavi Engineering College, Tadepalligudem-534101, A.P, India, , osrinagesh@srivasaviengg.ac.in
2- 2. Department of CSE, Sri Vasavi Engineering College, Tadepalligudem-534101, A.P, India.
Abstract:   (3496 Views)
Cryptography is a well-known and well-researched topic for ages. Cryptography is the first line of defense for any networked system. By using Symmetric as well as Asymmetric Cryptography a lot of algorithms are developed. From the security point of view, Asymmetric Cryptography is more popular as security has been enhanced. RSA, DSA, ECS, DES, ECC and other algorithms have been developed for realizing Asymmetric Cryptosystem. These algorithms are primarily used for secure and reliable communication. These algorithms play a vital role in secure communication. Elliptic Curve Cryptography (ECC) provides similar security having less key size among them. In the present paper, an improved MOD-ECDH has been proposed and the proposed algorithm has been compared with other various popular algorithms like ECDH, RSA, ECS has been demonstrated. A detail both empirical and simulation study of the algorithm of ECDH and MOD-ECDH has been depicted. From result analysis, it is evident that the proposed algorithm outperforms the other algorithms in point of processing time and key size.
Full-Text [PDF 639 kb]   (1853 Downloads)    
Type of Study: Research | Subject: Logistic & Apply Chain
Received: 2020/04/28 | Accepted: 2020/04/28 | Published: 2020/04/28

Add your comments about this article : Your username or Email:
CAPTCHA

Send email to the article author


Rights and permissions
Creative Commons License This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.