wire / wire-format / eddsa
EdDSA is a digital signature scheme using twisted Edwards curves. Ed25519 (RFC 8032) uses Curve25519. Signing: hash the message with the private key, derive a nonce, compute R = r*G, S = r + H(R||A||M)*a mod l. Signature = (R, S) (64 bytes). Verification: check S*G == R + H(R||A||M)*A. Deterministic (no random nonce needed).
aka: EdDSA (Edwards-curve Digital Signature Algorithm)
spec: RFC 8032
EdDSA is a digital signature scheme using twisted Edwards curves. Ed25519 (RFC 8032) uses Curve25519. Signing: hash the message with the private key, derive a nonce, compute R = r*G, S = r + H(R||A||M)*a mod l. Signature = (R, S) (64 bytes). Verification: check S*G == R + H(R||A||M)*A. Deterministic (no random nonce needed).
| field | size | meaning |
|---|---|---|
| Private key | 32 bytes | Random 32 bytes. Hashed to derive scalar a and nonce prefix. |
| Public key | 32 bytes | A = a*G (point on Curve25519). Compressed (x-coordinate only). |
| Signature | 64 bytes | R (32 bytes, compressed point) + S (32 bytes, scalar). R = r*G, S = (r + H(R||A||M)*a) mod l. |
| Hash | SHA-512 | H = SHA-512. Used for both nonce derivation and signature computation. |
| Nonce (r) | derived | r = SHA-512(private_key_prefix || message) mod l. Deterministic (no RNG needed for signing). |
| Verification | operation | Check S*G == R + H(R||A||M)*A. If equal, signature is valid. |
example:
00 00 00 00
EdDSA (placeholder)
agent: curl -H 'accept: application/json' wire.phall.io/wire-format/eddsa
or /wire-format/eddsa.json