2010International Journal of Computer ApplicationsOpen access

Implementation of Elliptic Curve Digital Signature Algorithm

Aqeel Khalique, Kuldip Singh, Sandeep K. Sood

Open full text 109 citations

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-keybit 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.

Open-access reader

About this research paper

What this paper is about

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-keybit 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.

Why it matters

OpenAlex reports 109 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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-keybit 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.

Key concepts: Elliptic Curve Digital Signature Algorithm, Elliptic curve point multiplication, Tripling-oriented Doche–Icart–Kohel curve, Elliptic curve cryptography, Computer science, Post-quantum cryptography, Hessian form of an elliptic curve, Curve25519

Related papers

Back to paper searchBrowse research topicsOriginal source
Implementation of Elliptic Curve Digital Signature Algorithm — Research Paper | ScholarLens