IJCSI

A COMPARATIVE ANALYSIS OF ECDSA V/S RSA ALGORITHM

---

---

Abstract

Elliptic curve Cryptography with its various protocols implemented in terms of accuracy and fast observation of results for better security solution. ECC applied on two finite fields: prime field and binary field. Because it is public key cryptography so, it also focus on generation of elliptic curve and shows why finite fields are introduced. But for accurate observation we do analysis on category of cryptographic primitives used to solve given security problem. RSA & ECDSA both have basic criteria of production of keys and method of encryption and decryption in basic application as per security and other properties which are authentication, non-repudiation, privacy, integrity

Recommended Citation

[1] Elliptic curve cryptography an implementation guide by Anoop MS anoopms@tataelxsi.co.in. [2] CSE 450/598 Design and analysis of algorithm Project ID:P113 Elliptic Curve Cryptography by Vikram V Kumar, Satish Doraiswamy, Zabeer Jainullabudeen. [3] Elliptic curve cryptography, datacom white papers2000. [4] Standards for efficient cryptography ” by Certicom Research September 20,2000. [5] Applications of elliptic curves in public key cryptography” by Andrej Dujella 2002. [6] Method for breaking RSA Security by Vibhor Malhotra, Dr. K. C Joshi, September2012, www.ijarcsse.com. [7] Implementation of Elliptic curve digital Signature Algorithm by Aqeel Khalique, Kuldeep Singh, Sandeep Sood (IIT ROORKEE) vol.2 May 2010. [8] Suzanne Craig Liljana Babinkostova, Elliptic Pairs of Primes in Cryptography and Their Effects on RSA Security,November,2011. [9] The Elliptic Curve Digital Signature Algorithm by Don Johnson and Alfred Menezes, Scott Vanstone, Certicom Research Canada, University of Walterloo. [10] www.cryptographyworld.com/des.html.