Elliptic Curve DSA
From Wikipedia, the free encyclopedia
Elliptic Curve DSA (ECDSA) is a variant of the Digital Signature Algorithm (DSA) which operates on elliptic curve groups. As with Elliptic Curve Cryptography in general, the bit size of the public key believed to be needed for ECDSA is about twice the size of the security level, in bits. By comparison, at a security level of 80 bits, meaning an attacker requires about the equivalent of about 280 signature generations to find the private key, the size of a DSA public key is at least 1024 bits, whereas the size of an ECDSA public key would be 160 bits. On the other hand, the signature size is the same for both DSA and ECDSA: 4t bits, where t is the security level measured in bits, that is, about 320 bits for a security level of 80 bits.
Contents |
[edit] Signature generation algorithm
Suppose Alice wants to send a signed message to Bob. Initially, the curve parameters (q,FR,a,b,G,n,h) must be agreed upon. Also, Alice must have a key pair suitable for elliptic curve cryptography, consisting of a private key dA (a randomly selected integer in the interval [1,n − 1]) and a public key QA (where QA = dAG).
For Alice to sign a message m, she follows these steps:
- Calculate e = HASH(m), where HASH is a cryptographic hash function, such as SHA-1.
- Select a random integer k from [1,n − 1].
- Calculate r = x1(mod n), where (x1,y1) = kG. If r = 0, go back to step 2.
- Calculate s = k − 1(e + rdA)(mod n). If s = 0, go back to step 2.
- The signature is the pair (r,s).
[edit] Signature verification algorithm
For Bob to authenticate Alice's signature, he must have a copy of her public key QA. He follows these steps:
- Verify that r and s are integers in [1,n − 1]. If not, the signature is invalid.
- Calculate e = HASH(m), where HASH is the same function used in the signature generation.
- Calculate w = s − 1(mod n).
- Calculate u1 = ew(mod n) and u2 = rw(mod n).
- Calculate (x1,y1) = u1G + u2QA.
- The signature is valid if r = x1(mod n), invalid otherwise.
Note that using Straus's algorithm (also known as Shamir's trick) a sum of two scalar multiplications u1G + u2QA can be calculated faster than with two scalar multiplications.
[edit] References
- Accredited Standards Committee X9, American National Standard X9.62-2005, Public Key Cryptography for the Financial Services Industry, The Elliptic Curve Digital Signature Algorithm (ECDSA), November 16, 2005.
- Certicom Research, Standards for efficient cryptography, SEC 1: Elliptic Curve Cryptography, Version 1.0, September 20, 2000.
- López, J. and Dahab, R. An Overview of Elliptic Curve Cryptography, Technical Report IC-00-10, State University of Campinas, 2000.
- Daniel J. Bernstein, Pippenger's exponentiation algorithm, 2002.
- Daniel R. L. Brown, Generic Groups, Collision Resistance, and ECDSA, Designs, Codes and Cryptography, 35, 119-152, 2005. ePrint version
- Ian F. Blake, Gadiel Seroussi, and Nigel P. Smart, editors, Advances in Elliptic Curve Cryptography, London Mathematical Society Lecture Note Series 317, Cambridge University Press, 2005.
- Darrel Hankerson, Alfred Menezes and Scott Vanstone, Guide to Elliptic Curve Cryptography, Springer, Springer, 2004.
[edit] External links
- Digital Signature Standard; includes info on ECDSA
- Commercial/Marketing comparison between RSA and ECDSA
[edit] See also
|
|||||||||||||||||||||||||||||
