crypto_ed25519.c 17 KB

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