EdDSA: Sign / Verify - Examples
Last updated
Was this helpful?
Last updated
Was this helpful?
After we explained in the previous section how the EdDSA signatures work, now it is time to demonstrate them with code examples. First, we shall demonstrated how to use Ed25519 signatures.
We shall use the Python library , which is based on the Bernstein's original optimized highly optimized C implementation of the Ed25519 signature algorithm (EdDSA over the Curve25519 in Edwards form):
Next, generate a private + public key pair for the Ed25519 cryptosystem, sign a sample message, and verify the signature:
The output from the above sample code looks like this:
The Ed25519 key pair is generated randomly: first a 32-byte random seed is generated, then the private key is derived from the seed, then the public key is derived from the private key. The hash function for key generation is SHA-512.
The private key is encoded as 64 hex digits (32 bytes). The public key is encoded also as 64 hex digits (32 bytes). The EdDSA-Ed25519 signature {R, s} is 32 + 32 bytes (64 bytes, 128 hex digits).
If we try to verify a tampered message, the verification will fail:
The output from the above sample code is as expected:
Now, let's demonstrate how to use the Ed448 signature (EdDSA over the Curve448-Goldilocks curve in Edwards form).
Next, generate a private + public key pair for the Ed448 cryptosystem:
The output from the above sample code may look like this:
The private key is encoded as 114 hex digits (57 bytes). The public key is encoded also as 114 hex digits (57 bytes), in compressed form. In the above example the public key EC point is printed also in uncompressed format (x and y coordinates). The EdDSA-Ed448 signature {R, s} consists of 57 + 57 bytes (114 bytes, 228 hex digits).
Next, sign a sample message using the private key, and verify the signature using the public key after that:
The output from the above code example (for the above Ed448 key pair) is:
The signature is deterministic: the same message with the same private key produces the same signature.
If we try to verify the same signature with a tampered message, the verification will fail:
The output from the above sample code is as expected:
Run the above code example: .
Run the above code example: .
We shall use the Python elliptic curve library , which implements ECC with Weierstrass curves (like secp256k1
and NIST P-256
), Montgomery curves (like Curve25519
and Curve448
) and twisted Edwards curves (like Ed25519
and Ed448
):
Run the above code example: .
The Ed448 key pair is generated randomly. According to the Ed448 private key is generated from 57-byte random seed, which is transformed to 57-byte public key using the SHAKE256(x, hash_len=114) hash function, along with EC point multiplication and the special key encoding rules for Ed448.
Run the above code example: .
Run the above code example: .