The Elliptic Curve Digital Signature Algorithm (ECDSA)

被引：1254

作者：

Don Johnson

Alfred Menezes

Scott Vanstone

机构：

[1] Certicom Research,

[2] Canada,undefined

[3] Department of Combinatorics and Optimization,undefined

[4] University of Waterloo,undefined

[5] Canada E-mails: {djohnson,undefined

[6] amenezes,undefined

[7] svanstone}@certicom.com,undefined

来源：

International Journal of Information Security | 2001年 / 1卷 / 1期

关键词：

Key words: Signature schemes – Elliptic curve cryptography – DSA – ECDSA;

D O I：

10.1007/s102070100002

中图分类号：

学科分类号：

摘要：

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 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 subexponential-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 ANSI X9.62 ECDSA, and discusses related security, implementation, and interoperability issues.

引用

页码：36 / 63

页数：27