International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 2 - Number 2 |
Year of Publication: 2010 |
Authors: Aqeel Khalique, Kuldip Singh, Sandeep Sood |
10.5120/631-876 |
Aqeel Khalique, Kuldip Singh, Sandeep Sood . Implementation of Elliptic Curve Digital Signature Algorithm. International Journal of Computer Applications. 2, 2 ( May 2010), 21-27. DOI=10.5120/631-876
The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA). It was accepted in 1999 as an ANSI standard, and was accepted in 2000 as IEEE and NIST standards. It was also accepted in 1998 as an ISO standard, and is under consideration for inclusion in some other ISO standards. Unlike the ordinary discrete logarithm problem and the integer factorization problem, no sub exponential-time algorithm is known for the elliptic curve discrete logarithm problem. For this reason, the strength-per-key-bit is substantially greater in an algorithm that uses elliptic curves. This paper describes the implementation of ANSI X9.62 ECDSA over elliptic curve P-192, and discusses related security issues.