As with other digital signature schemes, Ed25519 consists of three protocols: key generation, signing and verification. They are similar, but distinct, from the generic Schnorr scheme.
Key Generation
Ed25519 does not match secret keys to scalars. Instead, a secret scalar is generated from a seed, a 32-byte string, which should be filled at random from a cryptographically secure RNG.
xseed = Hash(seed) = "wYd0d5LqENqMf/JueRioZuW9ag4/LQwFebmu6eR3GdQuzyyhH8eJXwl+us5NtA68/59zXpqpcHnbT3tIq+9W/w=="The seed is expanded to 64 bytes with the help of a hash function. Most Ed25519 implementations use SHA-512, but any cryptographic hash function with 64-byte output can suffice.
a = Sc(clamp(xseed[..32])) = Sc("H2Snpg77tCFdbxxAIDdN/uS9ag4/LQwFebmu6eR3GQQ=") The first 32 bytes are “clamped” by setting the lower 3 bits and the highest bit (in the LSB interpretation) to 0, and the second-highest bit to 1. The resulting byte sequence is interpreted as a scalar a.
nonce = xseed[32..] = "Ls8soR/HiV8JfrrOTbQOvP+fc16aqXB52097SKvvVv8="The upper 32 bytes of the expanded seed are used as a nonce during signing.
A = [a]B = Pt("U9LQzQamcquNWNm9Bxmb9omyZkBMKmxQrWx8jaPJtWM=") The public key is still (the encoding of) a point on the elliptic curve, obtained by multiplying the basepoint B by the secret scalar.
If you want to know why the secret scalar is clamped in this way, refer to this explanation.
Signing
Signing in Ed25519 is deterministic: it doesn't require an RNG during signing. A faulty RNG during signing can leak the secret key, so this is an understandable design choice.
r = Sc(Hash(nonce ‖ M)) = Sc("tVdeETilMRnjxre61VKtehJFB+KChtWiVTiFlAhjlQ8=") Like in RFC 6979, the “random” scalar r is chosen based on the secret key and the message M.
h = Sc(Hash(R ‖ A ‖ M)) = Sc("GoLmPp95bpjLVmUux9fmImavfkuMH8JelidDcJYxvwg=") Unlike vanilla Schnorr, we include the public key A to values being hashed.
Verification
Verification uses the equation following from Schnorr and the modified signing procedure:
[s]B == R + [H(R ‖ A ‖ M)]A.h = Sc(Hash(R ‖ A ‖ M)) = Sc("GoLmPp95bpjLVmUux9fmImavfkuMH8JelidDcJYxvwg=")Hash scalar can be readily recreated from public information.