Integrate and enable ed25519-donna.

The runtime sanity checking is slightly different from the optimized
basepoint stuff in that it uses a given implementation's self tests if
available, and checks if signing/verification works with a test vector
from the IETF EdDSA draft.

The unit tests include a new testcase that will fuzz donna against ref0,
including the blinding and curve25519 key conversion routines.  If this
is something that should be done at runtime (No?), the code can be
stolen from there.

Note: Integrating batch verification is not done yet.
This commit is contained in:
Yawning Angel 2015-07-06 10:11:10 +00:00
parent f079c27761
commit 840e68d917
6 changed files with 292 additions and 15 deletions

4
changes/feature16467 Normal file
View File

@ -0,0 +1,4 @@
o Minor feature (performance):
- Improve the runtime speed of Ed25519 operations by using the
public-domain ed25519-donna by Andrew M. ("floodyberry"). Implements
ticket 16467.

View File

@ -26,6 +26,7 @@
#define CRYPTO_PRIVATE
#include "crypto.h"
#include "crypto_curve25519.h"
#include "crypto_ed25519.h"
#if OPENSSL_VERSION_NUMBER < OPENSSL_V_SERIES(1,0,0)
#error "We require OpenSSL >= 1.0.0"
@ -308,6 +309,7 @@ crypto_early_init(void)
return -1;
curve25519_init();
ed25519_init();
}
return 0;
}

View File

@ -16,9 +16,81 @@
#include "util.h"
#include "ed25519/ref10/ed25519_ref10.h"
#include "ed25519/donna/ed25519_donna_tor.h"
#include <openssl/sha.h>
static void pick_ed25519_impl(void);
static int ed25519_impl_spot_check(void);
/** An Ed25519 implementation */
typedef struct {
int (*selftest)(void);
int (*seckey)(unsigned char *);
int (*seckey_expand)(unsigned char *, const unsigned char *);
int (*pubkey)(unsigned char *, const unsigned char *);
int (*keygen)(unsigned char *, unsigned char *);
int (*open)(const unsigned char *, const unsigned char *, size_t, const
unsigned char *);
int (*sign)(unsigned char *, const unsigned char *, size_t,
const unsigned char *, const unsigned char *);
int (*blind_secret_key)(unsigned char *, const unsigned char *,
const unsigned char *);
int (*blind_public_key)(unsigned char *, const unsigned char *,
const unsigned char *);
int (*pubkey_from_curve25519_pubkey)(unsigned char *, const unsigned char *,
int);
} ed25519_impl_t;
static const ed25519_impl_t impl_ref10 = {
NULL,
ed25519_ref10_seckey,
ed25519_ref10_seckey_expand,
ed25519_ref10_pubkey,
ed25519_ref10_keygen,
ed25519_ref10_open,
ed25519_ref10_sign,
ed25519_ref10_blind_secret_key,
ed25519_ref10_blind_public_key,
ed25519_ref10_pubkey_from_curve25519_pubkey,
};
static const ed25519_impl_t impl_donna = {
ed25519_donna_selftest,
ed25519_donna_seckey,
ed25519_donna_seckey_expand,
ed25519_donna_pubkey,
ed25519_donna_keygen,
ed25519_donna_open,
ed25519_donna_sign,
ed25519_donna_blind_secret_key,
ed25519_donna_blind_public_key,
ed25519_donna_pubkey_from_curve25519_pubkey,
};
static const ed25519_impl_t *ed25519_impl = NULL;
static inline const ed25519_impl_t *
get_ed_impl(void)
{
if (PREDICT_UNLIKELY(ed25519_impl == NULL)) {
pick_ed25519_impl();
}
return ed25519_impl;
}
/**
* Initialize a new ed25519 secret key in <b>seckey_out</b>. If
* <b>extra_strong</b>, take the RNG inputs directly from the operating
@ -33,7 +105,7 @@ ed25519_secret_key_generate(ed25519_secret_key_t *seckey_out,
if (! extra_strong || crypto_strongest_rand(seed, sizeof(seed)) < 0)
crypto_rand((char*)seed, sizeof(seed));
r = ed25519_ref10_seckey_expand(seckey_out->seckey, seed);
r = get_ed_impl()->seckey_expand(seckey_out->seckey, seed);
memwipe(seed, 0, sizeof(seed));
return r < 0 ? -1 : 0;
@ -47,8 +119,8 @@ int
ed25519_secret_key_from_seed(ed25519_secret_key_t *seckey_out,
const uint8_t *seed)
{
if (ed25519_ref10_seckey_expand(seckey_out->seckey, seed) < 0)
return -1;
if (get_ed_impl()->seckey_expand(seckey_out->seckey, seed) < 0)
return -1;
return 0;
}
@ -60,7 +132,7 @@ int
ed25519_public_key_generate(ed25519_public_key_t *pubkey_out,
const ed25519_secret_key_t *seckey)
{
if (ed25519_ref10_pubkey(pubkey_out->pubkey, seckey->seckey) < 0)
if (get_ed_impl()->pubkey(pubkey_out->pubkey, seckey->seckey) < 0)
return -1;
return 0;
}
@ -88,10 +160,9 @@ ed25519_sign(ed25519_signature_t *signature_out,
const uint8_t *msg, size_t len,
const ed25519_keypair_t *keypair)
{
if (ed25519_ref10_sign(signature_out->sig, msg, len,
keypair->seckey.seckey,
keypair->pubkey.pubkey) < 0) {
if (get_ed_impl()->sign(signature_out->sig, msg, len,
keypair->seckey.seckey,
keypair->pubkey.pubkey) < 0) {
return -1;
}
@ -110,7 +181,7 @@ ed25519_checksig(const ed25519_signature_t *signature,
const ed25519_public_key_t *pubkey)
{
return
ed25519_ref10_open(signature->sig, msg, len, pubkey->pubkey) < 0 ? -1 : 0;
get_ed_impl()->open(signature->sig, msg, len, pubkey->pubkey) < 0 ? -1 : 0;
}
/** Validate every signature among those in <b>checkable</b>, which contains
@ -164,6 +235,7 @@ ed25519_checksig_batch(int *okay_out,
res = 0;
for (i = 0; i < n_checkable; ++i) {
/* XXX/yawning: Propagate to okay_out? */
if (!oks[i])
--res;
}
@ -229,9 +301,9 @@ ed25519_public_key_from_curve25519_public_key(ed25519_public_key_t *pubkey,
const curve25519_public_key_t *pubkey_in,
int signbit)
{
return ed25519_ref10_pubkey_from_curve25519_pubkey(pubkey->pubkey,
pubkey_in->public_key,
signbit);
return get_ed_impl()->pubkey_from_curve25519_pubkey(pubkey->pubkey,
pubkey_in->public_key,
signbit);
}
/**
@ -251,7 +323,7 @@ ed25519_keypair_blind(ed25519_keypair_t *out,
{
ed25519_public_key_t pubkey_check;
ed25519_ref10_blind_secret_key(out->seckey.seckey,
get_ed_impl()->blind_secret_key(out->seckey.seckey,
inp->seckey.seckey, param);
ed25519_public_blind(&pubkey_check, &inp->pubkey, param);
@ -274,7 +346,7 @@ ed25519_public_blind(ed25519_public_key_t *out,
const ed25519_public_key_t *inp,
const uint8_t *param)
{
ed25519_ref10_blind_public_key(out->pubkey, inp->pubkey, param);
get_ed_impl()->blind_public_key(out->pubkey, inp->pubkey, param);
return 0;
}
@ -372,3 +444,114 @@ ed25519_pubkey_eq(const ed25519_public_key_t *key1,
return tor_memeq(key1->pubkey, key2->pubkey, ED25519_PUBKEY_LEN);
}
/** Check whether the given Ed25519 implementation seems to be working.
* If so, return 0; otherwise return -1. */
static int
ed25519_impl_spot_check(void)
{
static const uint8_t alicesk[32] = {
0xc5,0xaa,0x8d,0xf4,0x3f,0x9f,0x83,0x7b,
0xed,0xb7,0x44,0x2f,0x31,0xdc,0xb7,0xb1,
0x66,0xd3,0x85,0x35,0x07,0x6f,0x09,0x4b,
0x85,0xce,0x3a,0x2e,0x0b,0x44,0x58,0xf7
};
static const uint8_t alicepk[32] = {
0xfc,0x51,0xcd,0x8e,0x62,0x18,0xa1,0xa3,
0x8d,0xa4,0x7e,0xd0,0x02,0x30,0xf0,0x58,
0x08,0x16,0xed,0x13,0xba,0x33,0x03,0xac,
0x5d,0xeb,0x91,0x15,0x48,0x90,0x80,0x25
};
static const uint8_t alicemsg[2] = { 0xaf, 0x82 };
static const uint8_t alicesig[64] = {
0x62,0x91,0xd6,0x57,0xde,0xec,0x24,0x02,
0x48,0x27,0xe6,0x9c,0x3a,0xbe,0x01,0xa3,
0x0c,0xe5,0x48,0xa2,0x84,0x74,0x3a,0x44,
0x5e,0x36,0x80,0xd7,0xdb,0x5a,0xc3,0xac,
0x18,0xff,0x9b,0x53,0x8d,0x16,0xf2,0x90,
0xae,0x67,0xf7,0x60,0x98,0x4d,0xc6,0x59,
0x4a,0x7c,0x15,0xe9,0x71,0x6e,0xd2,0x8d,
0xc0,0x27,0xbe,0xce,0xea,0x1e,0xc4,0x0a
};
const ed25519_impl_t *impl = get_ed_impl();
uint8_t sk[ED25519_SECKEY_LEN];
uint8_t pk[ED25519_PUBKEY_LEN];
uint8_t sig[ED25519_SIG_LEN];
int r = 0;
/* Some implementations (eg: The modified Ed25519-donna) have handy self-test
* code that sanity-checks the internals. If present, use that to screen out
* catastrophic errors like massive compiler failure.
*/
if (impl->selftest && impl->selftest() != 0)
goto fail;
/* Validate results versus known answer tests. People really should be
* running "make test" instead of relying on this, but it's better than
* nothing.
*
* Test vectors taken from "EdDSA & Ed25519 - 6. Test Vectors for Ed25519
* (TEST3)" (draft-josefsson-eddsa-ed25519-03).
*/
/* Key expansion, public key derivation. */
if (impl->seckey_expand(sk, alicesk) < 0)
goto fail;
if (impl->pubkey(pk, sk) < 0)
goto fail;
if (fast_memneq(pk, alicepk, ED25519_PUBKEY_LEN))
goto fail;
/* Signing, verification. */
if (impl->sign(sig, alicemsg, sizeof(alicemsg), sk, pk) < 0)
return -1;
if (fast_memneq(sig, alicesig, ED25519_SIG_LEN))
return -1;
if (impl->open(sig, alicemsg, sizeof(alicemsg), pk) < 0)
return -1;
/* XXX/yawning: Someone that's more paranoid than I am, can write "Assume
* ref0 is cannonical, and fuzz impl against it" if they want, but I doubt
* that will catch anything that the known answer tests won't.
*/
goto end;
fail:
r = -1;
end:
return r;
}
/** Force the Ed25519 implementation to a given one, without sanity checking
* the output. Used for testing.
*/
void
ed25519_set_impl_params(int use_donna)
{
if (use_donna)
ed25519_impl = &impl_donna;
else
ed25519_impl = &impl_ref10;
}
/** Choose whether to use the Ed25519-donna implementation. */
static void
pick_ed25519_impl(void)
{
ed25519_impl = &impl_donna;
if (ed25519_impl_spot_check() == 0)
return;
log_warn(LD_CRYPTO, "The Ed25519-donna implementation seems broken; using "
"the ref10 implementation.");
ed25519_impl = &impl_ref10;
}
/* Initialize the Ed25519 implementation. This is neccessary if you're
* going to use them in a multithreaded setting, and not otherwise. */
void
ed25519_init(void)
{
pick_ed25519_impl();
}

View File

@ -123,5 +123,8 @@ void ed25519_keypair_free(ed25519_keypair_t *kp);
int ed25519_pubkey_eq(const ed25519_public_key_t *key1,
const ed25519_public_key_t *key2);
void ed25519_set_impl_params(int use_donna);
void ed25519_init(void);
#endif

View File

@ -248,7 +248,7 @@ bench_onion_ntor(void)
}
static void
bench_ed25519(void)
bench_ed25519_impl(void)
{
uint64_t start, end;
const int iters = 1<<12;
@ -304,6 +304,19 @@ bench_ed25519(void)
MICROCOUNT(start, end, iters));
}
static void
bench_ed25519(void)
{
int donna;
for (donna = 0; donna <= 1; ++donna) {
printf("Ed25519-donna = %s.\n",
(donna == 0) ? "disabled" : "enabled");
ed25519_set_impl_params(donna);
bench_ed25519_impl();
}
}
static void
bench_cell_aes(void)
{

View File

@ -1636,6 +1636,77 @@ test_crypto_ed25519_testvectors(void *arg)
tor_free(mem_op_hex_tmp);
}
static void
test_crypto_ed25519_fuzz_donna(void *arg)
{
const unsigned iters = 1024;
uint8_t msg[1024];
unsigned i;
(void)arg;
tt_assert(sizeof(msg) == iters);
crypto_rand((char*) msg, sizeof(msg));
/* Fuzz Ed25519-donna vs ref10, alternating the implementation used to
* generate keys/sign per iteration.
*/
for (i = 0; i < iters; ++i) {
const int use_donna = i & 1;
uint8_t blinding[32];
curve25519_keypair_t ckp;
ed25519_keypair_t kp, kp_blind, kp_curve25519;
ed25519_public_key_t pk, pk_blind, pk_curve25519;
ed25519_signature_t sig, sig_blind;
int bit = 0;
crypto_rand((char*) blinding, sizeof(blinding));
/* Impl. A:
* 1. Generate a keypair.
* 2. Blinded the keypair.
* 3. Sign a message (unblinded).
* 4. Sign a message (blinded).
* 5. Generate a curve25519 keypair, and convert it to Ed25519.
*/
ed25519_set_impl_params(use_donna);
tt_int_op(0, OP_EQ, ed25519_keypair_generate(&kp, i&1));
tt_int_op(0, OP_EQ, ed25519_keypair_blind(&kp_blind, &kp, blinding));
tt_int_op(0, OP_EQ, ed25519_sign(&sig, msg, i, &kp));
tt_int_op(0, OP_EQ, ed25519_sign(&sig_blind, msg, i, &kp_blind));
tt_int_op(0, OP_EQ, curve25519_keypair_generate(&ckp, i&1));
tt_int_op(0, OP_EQ, ed25519_keypair_from_curve25519_keypair(
&kp_curve25519, &bit, &ckp));
/* Impl. B:
* 1. Validate the public key by rederiving it.
* 2. Validate the blinded public key by rederiving it.
* 3. Validate the unblinded signature (and test a invalid signature).
* 4. Validate the blinded signature.
* 5. Validate the public key (from Curve25519) by rederiving it.
*/
ed25519_set_impl_params(!use_donna);
tt_int_op(0, OP_EQ, ed25519_public_key_generate(&pk, &kp.seckey));
tt_mem_op(pk.pubkey, OP_EQ, kp.pubkey.pubkey, 32);
tt_int_op(0, OP_EQ, ed25519_public_blind(&pk_blind, &kp.pubkey, blinding));
tt_mem_op(pk_blind.pubkey, OP_EQ, kp_blind.pubkey.pubkey, 32);
tt_int_op(0, OP_EQ, ed25519_checksig(&sig, msg, i, &pk));
sig.sig[0] ^= 15;
tt_int_op(-1, OP_EQ, ed25519_checksig(&sig, msg, sizeof(msg), &pk));
tt_int_op(0, OP_EQ, ed25519_checksig(&sig_blind, msg, i, &pk_blind));
tt_int_op(0, OP_EQ, ed25519_public_key_from_curve25519_public_key(
&pk_curve25519, &ckp.pubkey, bit));
tt_mem_op(pk_curve25519.pubkey, OP_EQ, kp_curve25519.pubkey.pubkey, 32);
}
done:
;
}
static void
test_crypto_siphash(void *arg)
{
@ -1767,6 +1838,7 @@ struct testcase_t crypto_tests[] = {
{ "ed25519_convert", test_crypto_ed25519_convert, 0, NULL, NULL },
{ "ed25519_blinding", test_crypto_ed25519_blinding, 0, NULL, NULL },
{ "ed25519_testvectors", test_crypto_ed25519_testvectors, 0, NULL, NULL },
{ "ed25519_fuzz_donna", test_crypto_ed25519_fuzz_donna, TT_FORK, NULL, NULL },
{ "siphash", test_crypto_siphash, 0, NULL, NULL },
END_OF_TESTCASES
};