EdDSA

Uses your system voice; voice and rate in settings.

Snapshot

≈ 4 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

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.

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. of elliptic curve E over \mathbb{F}_q whose group E(\mathbb{F}_q) of \mathbb{F}_q -rational points has order \#E(\mathbb{F}_q) = 2^c \ell , where \ell is a large prime and 2^c is called the cofactor; of base point B \in E(\mathbb{F}_q) with order \ell ; and of cryptographic hash function H with 2b -bit outputs, where 2^{b - 1} > q so that elements of \mathbb{F}_q and curve points in E(\mathbb{F}_q) can be represented by strings of b bits. These parameters are common to all users of the EdDSA signature scheme. The security of the EdDSA signature scheme depends critically on the choices of parameters, except for the arbitrary choice of base point—for example, Pollard's rho algorithm for logarithms is expected to take approximately \sqrt{\ell\pi/4} curve additions before it can compute a discrete logarithm, so \ell must be large enough for this to be infeasible, and is typically taken to exceed . The choice of \ell is limited by the choice of q , since by Hasse's theorem, \#E(\mathbb{F}_q) = 2^c \ell cannot differ from q + 1 by more than 2\sqrt{q} . The hash function H is normally modelled as a random oracle in formal analyses of EdDSA's security. Within an EdDSA signature scheme, Public key An EdDSA public key is a curve point A \in E(\mathbb{F}_q) , encoded in b bits. Signature verification An EdDSA signature on a message M by public key A is the pair (R, S) , encoded in 2b bits, of a curve point R \in E(\mathbb{F}_q) and an integer 0 satisfying the following verification equation, where \parallel denotes concatenation: 2^c S B = 2^c R + 2^c H(R \parallel A \parallel M) A. Private key An EdDSA private key is a b -bit string k which should be chosen uniformly at random. The corresponding public key is A = s B , where s = H_{0,\dots,b - 1}(k) is the least significant b bits of H(k) interpreted as an integer in little-endian. Signing The signature on a message M is deterministically computed as (R, S), where R = r B for r = H(H_{b,\dots,2b - 1}(k) \parallel M) , and S \equiv r + H(R \parallel A \parallel M) s \pmod \ell. This satisfies the verification equation \begin{align} 2^c S B &= 2^c (r + H(R \parallel A \parallel M) s) B \\ &= 2^c r B + 2^c H(R \parallel A \parallel M) s B \\ &= 2^c R + 2^c H(R \parallel A \parallel M) A. \end{align} q = 2^{255} - 19, E/\mathbb{F}_q is the twisted Edwards curve -x^2 + y^2 = 1 - \frac{121665}{121666}x^2y^2, \ell = 2^{252} + 27742317777372353535851937790883648493 and c = 3 B is the unique point in E(\mathbb{F}_q) whose y coordinate is 4/5 and whose x coordinate is positive. "positive" is defined in terms of bit-encoding: "positive" coordinates are even coordinates (least significant bit is cleared) "negative" coordinates are odd coordinates (least significant bit is set) H is SHA-512, with b = 256 . The twisted Edwards curve E/\mathbb{F}_q is known as edwards25519, and is birationally equivalent to the Montgomery curve known as Curve25519. The equivalence is x = \frac{u}{v}\sqrt{-486664}, \quad y = \frac{u - 1}{u + 1}.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1344842505 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

28 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.