Journals Proceedings

International Journal of Advances in Computer Networks and Its Security

Elliptic Curve Cryptographic Algorithm



This paper deals with an implementation of Elliptic Curve Cryptography Algorithm. The implementation includes Diffie Hellman Key Exchange and the Digital Signature Algorithm. This paperr gives an overview of Elliptic Curve Cryptography algorithm. Cryptography (or cryptology) from Greek word kryptos, "hidden, secret"; and graph, "writing" is the practice and study of hiding information. Modern cryptography intersects the disciplines of mathematics, computer science, and engineering. Applications of cryptography include ATM cards, computer passwords, and electronic commerce. Cryptology prior to the modern age was almost synonymous with encryption, the conversion of information from a readable state to nonsense. The sender retained the ability to decrypt the information and therefore avoid unwanted persons being able to read it. The secret key cryptography and public key cryptography are the two main types of cryptography. RSA is the most prominent algorithm used in public key cryptography techniques for encryption and digital signatures. Over the years, the key lengths for RSA have been increasing. This puts considerable burden on RSA. Another public key cryptography technique is gaining popularity in the last few years. It is called as Elliptic Curve Cryptography (ECC). The main difference between RSA and Elliptic Curve Cryptography is that unlike RSA, Elliptic Curve Cryptography offers the same level of security for smaller key sizes. Elliptic Curve Cryptography is highly mathematical in nature. While conventional public-key cryptosystems (RSA, Diffie - Hellman and DSA) operate directly on large integers, an Elliptic Curve Cryptography operates over points on an elliptic curve.

No fo Author(s) : 1
Page(s) : 35 - 39
Electronic ISSN : 2250 - 3757
Volume 2 : Issue 1
Views : 566   |   Download(s) : 181