Title of article
Implementation of Elliptic Curve Digital Signature Algorithm
Author/Authors
Aqeel Khalique، نويسنده , , Kuldip-Singh and J. Doran ، نويسنده , , Sandeep Sood، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
7
From page
21
To page
27
Abstract
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.
Keywords
integer factorization , Discrete logarithm problem , ECDSA , Elliptic curve cryptography , DSA
Journal title
International Journal of Computer Applications
Serial Year
2010
Journal title
International Journal of Computer Applications
Record number
658415
Link To Document