This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these template messages)(Learn how and when to remove this template message)
In public-key cryptography, Edwards-curve Digital Signature Algorithm (EdDSA) is a digital signature scheme using a variant of Schnorr signature based on Twisted Edwards curves. It is designed to be faster than existing digital signature schemes without sacrificing security. It was developed by a team including Daniel J. Bernstein, Niels Duif, Tanja Lange, Peter Schwabe, and Bo-Yin Yang. The reference implementation is public domain software.
Ed25519 is the reference implementation of EdDSA using the Twisted Edwards curve:
The Bernstein team has optimized Ed25519 for the x86-64 Nehalem/Westmere processor family. Verification can be performed in batches of 64 signatures for even greater throughput. Ed25519 is intended to provide attack resistance comparable to quality 128-bit symmetric ciphers. Public keys are 256 bits in length and signatures are twice that size.
Security features of Ed25519 include elimination of branch operations and array indexing steps that depend on secret data, so as to defeat many side channel attacks.
Like other digital signature algorithms, EdDSA requires a secret value, or nonce, unique to each signature. However EdDSA calculates this nonce deterministically, as the hash of the secret key and the message, rather than using a randomly generated number. This reduces the risk of a random number generator attack, but does not completely eliminate it, since high quality random numbers are still needed for key generation.
- SUPERCOP reference implementation (C language with inline assembler)
- Slow but concise alternate implementation, does not include side-channel attack protection (Python)
- CryptoNote cryptocurrency protocol
- I2Pd has its own implementation of EdDSA
- Minisign and Minisign Miscellanea for macOS
- Bernstein, Daniel J.; Duif, Niels; Lange, Tanja; Schwabe, Peter; Bo-Yin Yang (2012). "High-speed high-security signatures" (PDF). Journal of Cryptographic Engineering 2 (2): 77–89. doi:10.1007/s13389-012-0027-1.
- Copyrights - The Ed25519 software is in the public domain. on ed25519.cr.yp.to
- Bernstein, Daniel J.; Lange, Tanja (2007). Kurosawa, Kaoru, ed. Faster addition and doubling on elliptic curves. Advances in cryptology—ASIACRYPT. Lecture Notes in Computer Science. Berlin: Springer. pp. 29–50. doi:10.1007/978-3-540-76900-2_3. ISBN 978-3-540-76899-9. MR 2565722.
- "Things that use Ed25519". Retrieved 6 January 2015.
- "Alternate implementations". Retrieved 17 November 2014.
- ""Heuristic Algorithms and Distributed Computing pp.55-56" (PDF). Retrieved 2015.