crypto_ed25519.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580
  1. /* Copyright (c) 2013-2015, The Tor Project, Inc. */
  2. /* See LICENSE for licensing information */
  3. /* Wrapper code for an ed25519 implementation. */
  4. #include "orconfig.h"
  5. #ifdef HAVE_SYS_STAT_H
  6. #include <sys/stat.h>
  7. #endif
  8. #include "crypto.h"
  9. #include "crypto_curve25519.h"
  10. #include "crypto_ed25519.h"
  11. #include "crypto_format.h"
  12. #include "torlog.h"
  13. #include "util.h"
  14. #include "ed25519/ref10/ed25519_ref10.h"
  15. #include "ed25519/donna/ed25519_donna_tor.h"
  16. #include <openssl/sha.h>
  17. static void pick_ed25519_impl(void);
  18. static int ed25519_impl_spot_check(void);
  19. /** An Ed25519 implementation */
  20. typedef struct {
  21. int (*selftest)(void);
  22. int (*seckey)(unsigned char *);
  23. int (*seckey_expand)(unsigned char *, const unsigned char *);
  24. int (*pubkey)(unsigned char *, const unsigned char *);
  25. int (*keygen)(unsigned char *, unsigned char *);
  26. int (*open)(const unsigned char *, const unsigned char *, size_t, const
  27. unsigned char *);
  28. int (*sign)(unsigned char *, const unsigned char *, size_t,
  29. const unsigned char *, const unsigned char *);
  30. int (*open_batch)(const unsigned char **, size_t *, const unsigned char **,
  31. const unsigned char **, size_t, int *);
  32. int (*blind_secret_key)(unsigned char *, const unsigned char *,
  33. const unsigned char *);
  34. int (*blind_public_key)(unsigned char *, const unsigned char *,
  35. const unsigned char *);
  36. int (*pubkey_from_curve25519_pubkey)(unsigned char *, const unsigned char *,
  37. int);
  38. } ed25519_impl_t;
  39. static const ed25519_impl_t impl_ref10 = {
  40. NULL,
  41. ed25519_ref10_seckey,
  42. ed25519_ref10_seckey_expand,
  43. ed25519_ref10_pubkey,
  44. ed25519_ref10_keygen,
  45. ed25519_ref10_open,
  46. ed25519_ref10_sign,
  47. NULL,
  48. ed25519_ref10_blind_secret_key,
  49. ed25519_ref10_blind_public_key,
  50. ed25519_ref10_pubkey_from_curve25519_pubkey,
  51. };
  52. static const ed25519_impl_t impl_donna = {
  53. ed25519_donna_selftest,
  54. ed25519_donna_seckey,
  55. ed25519_donna_seckey_expand,
  56. ed25519_donna_pubkey,
  57. ed25519_donna_keygen,
  58. ed25519_donna_open,
  59. ed25519_donna_sign,
  60. ed25519_sign_open_batch_donna,
  61. ed25519_donna_blind_secret_key,
  62. ed25519_donna_blind_public_key,
  63. ed25519_donna_pubkey_from_curve25519_pubkey,
  64. };
  65. static const ed25519_impl_t *ed25519_impl = NULL;
  66. static inline const ed25519_impl_t *
  67. get_ed_impl(void)
  68. {
  69. if (PREDICT_UNLIKELY(ed25519_impl == NULL)) {
  70. pick_ed25519_impl();
  71. }
  72. return ed25519_impl;
  73. }
  74. /**
  75. * Initialize a new ed25519 secret key in <b>seckey_out</b>. If
  76. * <b>extra_strong</b>, take the RNG inputs directly from the operating
  77. * system. Return 0 on success, -1 on failure.
  78. */
  79. int
  80. ed25519_secret_key_generate(ed25519_secret_key_t *seckey_out,
  81. int extra_strong)
  82. {
  83. int r;
  84. uint8_t seed[32];
  85. if (! extra_strong || crypto_strongest_rand(seed, sizeof(seed)) < 0)
  86. crypto_rand((char*)seed, sizeof(seed));
  87. r = get_ed_impl()->seckey_expand(seckey_out->seckey, seed);
  88. memwipe(seed, 0, sizeof(seed));
  89. return r < 0 ? -1 : 0;
  90. }
  91. /**
  92. * Given a 32-byte random seed in <b>seed</b>, expand it into an ed25519
  93. * secret key in <b>seckey_out</b>. Return 0 on success, -1 on failure.
  94. */
  95. int
  96. ed25519_secret_key_from_seed(ed25519_secret_key_t *seckey_out,
  97. const uint8_t *seed)
  98. {
  99. if (get_ed_impl()->seckey_expand(seckey_out->seckey, seed) < 0)
  100. return -1;
  101. return 0;
  102. }
  103. /**
  104. * Given a secret key in <b>seckey</b>, expand it into an
  105. * ed25519 public key. Return 0 on success, -1 on failure.
  106. */
  107. int
  108. ed25519_public_key_generate(ed25519_public_key_t *pubkey_out,
  109. const ed25519_secret_key_t *seckey)
  110. {
  111. if (get_ed_impl()->pubkey(pubkey_out->pubkey, seckey->seckey) < 0)
  112. return -1;
  113. return 0;
  114. }
  115. /** Generate a new ed25519 keypair in <b>keypair_out</b>. If
  116. * <b>extra_strong</b> is set, try to mix some system entropy into the key
  117. * generation process. Return 0 on success, -1 on failure. */
  118. int
  119. ed25519_keypair_generate(ed25519_keypair_t *keypair_out, int extra_strong)
  120. {
  121. if (ed25519_secret_key_generate(&keypair_out->seckey, extra_strong) < 0)
  122. return -1;
  123. if (ed25519_public_key_generate(&keypair_out->pubkey,
  124. &keypair_out->seckey)<0)
  125. return -1;
  126. return 0;
  127. }
  128. /**
  129. * Set <b>signature_out</b> to a signature of the <b>len</b>-byte message
  130. * <b>msg</b>, using the secret and public key in <b>keypair</b>.
  131. */
  132. int
  133. ed25519_sign(ed25519_signature_t *signature_out,
  134. const uint8_t *msg, size_t len,
  135. const ed25519_keypair_t *keypair)
  136. {
  137. if (get_ed_impl()->sign(signature_out->sig, msg, len,
  138. keypair->seckey.seckey,
  139. keypair->pubkey.pubkey) < 0) {
  140. return -1;
  141. }
  142. return 0;
  143. }
  144. /**
  145. * Check whether if <b>signature</b> is a valid signature for the
  146. * <b>len</b>-byte message in <b>msg</b> made with the key <b>pubkey</b>.
  147. *
  148. * Return 0 if the signature is valid; -1 if it isn't.
  149. */
  150. int
  151. ed25519_checksig(const ed25519_signature_t *signature,
  152. const uint8_t *msg, size_t len,
  153. const ed25519_public_key_t *pubkey)
  154. {
  155. return
  156. get_ed_impl()->open(signature->sig, msg, len, pubkey->pubkey) < 0 ? -1 : 0;
  157. }
  158. /** Validate every signature among those in <b>checkable</b>, which contains
  159. * exactly <b>n_checkable</b> elements. If <b>okay_out</b> is non-NULL, set
  160. * the i'th element of <b>okay_out</b> to 1 if the i'th element of
  161. * <b>checkable</b> is valid, and to 0 otherwise. Return 0 if every signature
  162. * was valid. Otherwise return -N, where N is the number of invalid
  163. * signatures.
  164. */
  165. int
  166. ed25519_checksig_batch(int *okay_out,
  167. const ed25519_checkable_t *checkable,
  168. int n_checkable)
  169. {
  170. int i, res;
  171. const ed25519_impl_t *impl = get_ed_impl();
  172. if (impl->open_batch == NULL) {
  173. /* No batch verification implementation available, fake it by checking the
  174. * each signature individually.
  175. */
  176. res = 0;
  177. for (i = 0; i < n_checkable; ++i) {
  178. const ed25519_checkable_t *ch = &checkable[i];
  179. int r = ed25519_checksig(&ch->signature, ch->msg, ch->len, ch->pubkey);
  180. if (r < 0)
  181. --res;
  182. if (okay_out)
  183. okay_out[i] = (r == 0);
  184. }
  185. } else {
  186. /* ed25519-donna style batch verification available.
  187. *
  188. * Theoretically, this should only be called if n_checkable >= 3, since
  189. * that's the threshold where the batch verification actually kicks in,
  190. * but the only difference is a few mallocs/frees.
  191. */
  192. const uint8_t **ms;
  193. size_t *lens;
  194. const uint8_t **pks;
  195. const uint8_t **sigs;
  196. int *oks;
  197. int all_ok;
  198. ms = tor_malloc(sizeof(uint8_t*)*n_checkable);
  199. lens = tor_malloc(sizeof(size_t)*n_checkable);
  200. pks = tor_malloc(sizeof(uint8_t*)*n_checkable);
  201. sigs = tor_malloc(sizeof(uint8_t*)*n_checkable);
  202. oks = okay_out ? okay_out : tor_malloc(sizeof(int)*n_checkable);
  203. for (i = 0; i < n_checkable; ++i) {
  204. ms[i] = checkable[i].msg;
  205. lens[i] = checkable[i].len;
  206. pks[i] = checkable[i].pubkey->pubkey;
  207. sigs[i] = checkable[i].signature.sig;
  208. oks[i] = 0;
  209. }
  210. res = 0;
  211. all_ok = impl->open_batch(ms, lens, pks, sigs, n_checkable, oks);
  212. for (i = 0; i < n_checkable; ++i) {
  213. if (!oks[i])
  214. --res;
  215. }
  216. /* XXX: For now sanity check oks with the return value. Once we have
  217. * more confidence in the code, if `all_ok == 0` we can skip iterating
  218. * over oks since all the signatures were found to be valid.
  219. */
  220. tor_assert(((res == 0) && !all_ok) || ((res < 0) && all_ok));
  221. tor_free(ms);
  222. tor_free(lens);
  223. tor_free(pks);
  224. if (! okay_out)
  225. tor_free(oks);
  226. }
  227. return res;
  228. }
  229. /**
  230. * Given a curve25519 keypair in <b>inp</b>, generate a corresponding
  231. * ed25519 keypair in <b>out</b>, and set <b>signbit_out</b> to the
  232. * sign bit of the X coordinate of the ed25519 key.
  233. *
  234. * NOTE THAT IT IS PROBABLY NOT SAFE TO USE THE GENERATED KEY FOR ANYTHING
  235. * OUTSIDE OF WHAT'S PRESENTED IN PROPOSAL 228. In particular, it's probably
  236. * not a great idea to use it to sign attacker-supplied anything.
  237. */
  238. int
  239. ed25519_keypair_from_curve25519_keypair(ed25519_keypair_t *out,
  240. int *signbit_out,
  241. const curve25519_keypair_t *inp)
  242. {
  243. const char string[] = "Derive high part of ed25519 key from curve25519 key";
  244. ed25519_public_key_t pubkey_check;
  245. SHA512_CTX ctx;
  246. uint8_t sha512_output[64];
  247. memcpy(out->seckey.seckey, inp->seckey.secret_key, 32);
  248. SHA512_Init(&ctx);
  249. SHA512_Update(&ctx, out->seckey.seckey, 32);
  250. SHA512_Update(&ctx, string, sizeof(string));
  251. SHA512_Final(sha512_output, &ctx);
  252. memcpy(out->seckey.seckey + 32, sha512_output, 32);
  253. ed25519_public_key_generate(&out->pubkey, &out->seckey);
  254. *signbit_out = out->pubkey.pubkey[31] >> 7;
  255. ed25519_public_key_from_curve25519_public_key(&pubkey_check, &inp->pubkey,
  256. *signbit_out);
  257. tor_assert(fast_memeq(pubkey_check.pubkey, out->pubkey.pubkey, 32));
  258. memwipe(&pubkey_check, 0, sizeof(pubkey_check));
  259. memwipe(&ctx, 0, sizeof(ctx));
  260. memwipe(sha512_output, 0, sizeof(sha512_output));
  261. return 0;
  262. }
  263. /**
  264. * Given a curve25519 public key and sign bit of X coordinate of the ed25519
  265. * public key, generate the corresponding ed25519 public key.
  266. */
  267. int
  268. ed25519_public_key_from_curve25519_public_key(ed25519_public_key_t *pubkey,
  269. const curve25519_public_key_t *pubkey_in,
  270. int signbit)
  271. {
  272. return get_ed_impl()->pubkey_from_curve25519_pubkey(pubkey->pubkey,
  273. pubkey_in->public_key,
  274. signbit);
  275. }
  276. /**
  277. * Given an ed25519 keypair in <b>inp</b>, generate a corresponding
  278. * ed25519 keypair in <b>out</b>, blinded by the corresponding 32-byte input
  279. * in 'param'.
  280. *
  281. * Tor uses key blinding for the "next-generation" hidden services design:
  282. * service descriptors are encrypted with a key derived from the service's
  283. * long-term public key, and then signed with (and stored at a position
  284. * indexed by) a short-term key derived by blinding the long-term keys.
  285. */
  286. int
  287. ed25519_keypair_blind(ed25519_keypair_t *out,
  288. const ed25519_keypair_t *inp,
  289. const uint8_t *param)
  290. {
  291. ed25519_public_key_t pubkey_check;
  292. get_ed_impl()->blind_secret_key(out->seckey.seckey,
  293. inp->seckey.seckey, param);
  294. ed25519_public_blind(&pubkey_check, &inp->pubkey, param);
  295. ed25519_public_key_generate(&out->pubkey, &out->seckey);
  296. tor_assert(fast_memeq(pubkey_check.pubkey, out->pubkey.pubkey, 32));
  297. memwipe(&pubkey_check, 0, sizeof(pubkey_check));
  298. return 0;
  299. }
  300. /**
  301. * Given an ed25519 public key in <b>inp</b>, generate a corresponding blinded
  302. * public key in <b>out</b>, blinded with the 32-byte parameter in
  303. * <b>param</b>. Return 0 on sucess, -1 on railure.
  304. */
  305. int
  306. ed25519_public_blind(ed25519_public_key_t *out,
  307. const ed25519_public_key_t *inp,
  308. const uint8_t *param)
  309. {
  310. get_ed_impl()->blind_public_key(out->pubkey, inp->pubkey, param);
  311. return 0;
  312. }
  313. /**
  314. * Store seckey unencrypted to <b>filename</b>, marking it with <b>tag</b>.
  315. * Return 0 on success, -1 on failure.
  316. */
  317. int
  318. ed25519_seckey_write_to_file(const ed25519_secret_key_t *seckey,
  319. const char *filename,
  320. const char *tag)
  321. {
  322. return crypto_write_tagged_contents_to_file(filename,
  323. "ed25519v1-secret",
  324. tag,
  325. seckey->seckey,
  326. sizeof(seckey->seckey));
  327. }
  328. /**
  329. * Read seckey unencrypted from <b>filename</b>, storing it into
  330. * <b>seckey_out</b>. Set *<b>tag_out</> to the tag it was marked with.
  331. * Return 0 on success, -1 on failure.
  332. */
  333. int
  334. ed25519_seckey_read_from_file(ed25519_secret_key_t *seckey_out,
  335. char **tag_out,
  336. const char *filename)
  337. {
  338. ssize_t len;
  339. len = crypto_read_tagged_contents_from_file(filename, "ed25519v1-secret",
  340. tag_out, seckey_out->seckey,
  341. sizeof(seckey_out->seckey));
  342. if (len == sizeof(seckey_out->seckey)) {
  343. return 0;
  344. } else if (len >= 0) {
  345. errno = EINVAL;
  346. }
  347. return -1;
  348. }
  349. /**
  350. * Store pubkey unencrypted to <b>filename</b>, marking it with <b>tag</b>.
  351. * Return 0 on success, -1 on failure.
  352. */
  353. int
  354. ed25519_pubkey_write_to_file(const ed25519_public_key_t *pubkey,
  355. const char *filename,
  356. const char *tag)
  357. {
  358. return crypto_write_tagged_contents_to_file(filename,
  359. "ed25519v1-public",
  360. tag,
  361. pubkey->pubkey,
  362. sizeof(pubkey->pubkey));
  363. }
  364. /**
  365. * Store pubkey unencrypted to <b>filename</b>, marking it with <b>tag</b>.
  366. * Return 0 on success, -1 on failure.
  367. */
  368. int
  369. ed25519_pubkey_read_from_file(ed25519_public_key_t *pubkey_out,
  370. char **tag_out,
  371. const char *filename)
  372. {
  373. ssize_t len;
  374. len = crypto_read_tagged_contents_from_file(filename, "ed25519v1-public",
  375. tag_out, pubkey_out->pubkey,
  376. sizeof(pubkey_out->pubkey));
  377. if (len == sizeof(pubkey_out->pubkey)) {
  378. return 0;
  379. } else if (len >= 0) {
  380. errno = EINVAL;
  381. }
  382. return -1;
  383. }
  384. /** Release all storage held for <b>kp</b>. */
  385. void
  386. ed25519_keypair_free(ed25519_keypair_t *kp)
  387. {
  388. if (! kp)
  389. return;
  390. memwipe(kp, 0, sizeof(*kp));
  391. tor_free(kp);
  392. }
  393. /** Return true iff <b>key1</b> and <b>key2</b> are the same public key. */
  394. int
  395. ed25519_pubkey_eq(const ed25519_public_key_t *key1,
  396. const ed25519_public_key_t *key2)
  397. {
  398. tor_assert(key1);
  399. tor_assert(key2);
  400. return tor_memeq(key1->pubkey, key2->pubkey, ED25519_PUBKEY_LEN);
  401. }
  402. /** Check whether the given Ed25519 implementation seems to be working.
  403. * If so, return 0; otherwise return -1. */
  404. static int
  405. ed25519_impl_spot_check(void)
  406. {
  407. static const uint8_t alicesk[32] = {
  408. 0xc5,0xaa,0x8d,0xf4,0x3f,0x9f,0x83,0x7b,
  409. 0xed,0xb7,0x44,0x2f,0x31,0xdc,0xb7,0xb1,
  410. 0x66,0xd3,0x85,0x35,0x07,0x6f,0x09,0x4b,
  411. 0x85,0xce,0x3a,0x2e,0x0b,0x44,0x58,0xf7
  412. };
  413. static const uint8_t alicepk[32] = {
  414. 0xfc,0x51,0xcd,0x8e,0x62,0x18,0xa1,0xa3,
  415. 0x8d,0xa4,0x7e,0xd0,0x02,0x30,0xf0,0x58,
  416. 0x08,0x16,0xed,0x13,0xba,0x33,0x03,0xac,
  417. 0x5d,0xeb,0x91,0x15,0x48,0x90,0x80,0x25
  418. };
  419. static const uint8_t alicemsg[2] = { 0xaf, 0x82 };
  420. static const uint8_t alicesig[64] = {
  421. 0x62,0x91,0xd6,0x57,0xde,0xec,0x24,0x02,
  422. 0x48,0x27,0xe6,0x9c,0x3a,0xbe,0x01,0xa3,
  423. 0x0c,0xe5,0x48,0xa2,0x84,0x74,0x3a,0x44,
  424. 0x5e,0x36,0x80,0xd7,0xdb,0x5a,0xc3,0xac,
  425. 0x18,0xff,0x9b,0x53,0x8d,0x16,0xf2,0x90,
  426. 0xae,0x67,0xf7,0x60,0x98,0x4d,0xc6,0x59,
  427. 0x4a,0x7c,0x15,0xe9,0x71,0x6e,0xd2,0x8d,
  428. 0xc0,0x27,0xbe,0xce,0xea,0x1e,0xc4,0x0a
  429. };
  430. const ed25519_impl_t *impl = get_ed_impl();
  431. uint8_t sk[ED25519_SECKEY_LEN];
  432. uint8_t pk[ED25519_PUBKEY_LEN];
  433. uint8_t sig[ED25519_SIG_LEN];
  434. int r = 0;
  435. /* Some implementations (eg: The modified Ed25519-donna) have handy self-test
  436. * code that sanity-checks the internals. If present, use that to screen out
  437. * catastrophic errors like massive compiler failure.
  438. */
  439. if (impl->selftest && impl->selftest() != 0)
  440. goto fail;
  441. /* Validate results versus known answer tests. People really should be
  442. * running "make test" instead of relying on this, but it's better than
  443. * nothing.
  444. *
  445. * Test vectors taken from "EdDSA & Ed25519 - 6. Test Vectors for Ed25519
  446. * (TEST3)" (draft-josefsson-eddsa-ed25519-03).
  447. */
  448. /* Key expansion, public key derivation. */
  449. if (impl->seckey_expand(sk, alicesk) < 0)
  450. goto fail;
  451. if (impl->pubkey(pk, sk) < 0)
  452. goto fail;
  453. if (fast_memneq(pk, alicepk, ED25519_PUBKEY_LEN))
  454. goto fail;
  455. /* Signing, verification. */
  456. if (impl->sign(sig, alicemsg, sizeof(alicemsg), sk, pk) < 0)
  457. return -1;
  458. if (fast_memneq(sig, alicesig, ED25519_SIG_LEN))
  459. return -1;
  460. if (impl->open(sig, alicemsg, sizeof(alicemsg), pk) < 0)
  461. return -1;
  462. /* XXX/yawning: Someone that's more paranoid than I am, can write "Assume
  463. * ref0 is cannonical, and fuzz impl against it" if they want, but I doubt
  464. * that will catch anything that the known answer tests won't.
  465. */
  466. goto end;
  467. fail:
  468. r = -1;
  469. end:
  470. return r;
  471. }
  472. /** Force the Ed25519 implementation to a given one, without sanity checking
  473. * the output. Used for testing.
  474. */
  475. void
  476. ed25519_set_impl_params(int use_donna)
  477. {
  478. if (use_donna)
  479. ed25519_impl = &impl_donna;
  480. else
  481. ed25519_impl = &impl_ref10;
  482. }
  483. /** Choose whether to use the Ed25519-donna implementation. */
  484. static void
  485. pick_ed25519_impl(void)
  486. {
  487. ed25519_impl = &impl_donna;
  488. if (ed25519_impl_spot_check() == 0)
  489. return;
  490. log_warn(LD_CRYPTO, "The Ed25519-donna implementation seems broken; using "
  491. "the ref10 implementation.");
  492. ed25519_impl = &impl_ref10;
  493. }
  494. /* Initialize the Ed25519 implementation. This is neccessary if you're
  495. * going to use them in a multithreaded setting, and not otherwise. */
  496. void
  497. ed25519_init(void)
  498. {
  499. pick_ed25519_impl();
  500. }