Elliptic curve DSA (ECSDA): an enhanced DSA

Authors:
Don B. Johnson;Alfred J. Menezes
Affiliations:
Certicom Corp., Mississauga, Ontario, Canada;Department of C&O, University of Waterloo, Waterloo, Ontario, Canada
Venue:
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Year:
1998

Citing 9
Cited 2

Use of elliptic curves in cryptography

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
A course in number theory and cryptography

A course in number theory and cryptography
Discrete logarithms in GF(P) using the number field sieve

SIAM Journal on Discrete Mathematics
A remark concerning m-divisibility and the discrete logarithm in the divisor class group of curves

Mathematics of Computation
Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p

Mathematics of Computation
Elliptic Curve Public Key Cryptosystems

Elliptic Curve Public Key Cryptosystems
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A subexponential algorithm for discrete logarithms over the rational subgroup of the jacobians of large genus hyperelliptic curves over finite fields

ANTS-I Proceedings of the First International Symposium on Algorithmic Number Theory
Fast Key Exchange with Elliptic Curve Systems

CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology

MobiRate: making mobile raters stick to their word

UbiComp '08 Proceedings of the 10th international conference on Ubiquitous computing
A secure broadcasting scheme to provide availability, reliability and authentication for wireless sensor networks

Ad Hoc Networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Elliptic Curve Digital Signature Algorithm (ECDSA) is the elliptic curve analogue of the Digital Signature Algorithm (DSA), and is under consideration for standardization by the ANSI X9 committee. Unlike the normal discrete logarithm problem and the integer factorization problem, the elliptic curve discrete logarithm problem has no subexponential-time algorithm. For this reason, the strength-perkey-bit is substantially greater in an algorithm that uses elliptic curves. In this paper, we compare the draft ANSI X9.62 ECDSA to the ANSI X9.30 DSA, the latter of which is identical to FIPS 186 DSS.