You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

605 lines
18 KiB

  1. #include "test.h"
  2. #include <stdio.h>
  3. #include "ec_point.h"
  4. #include "decaf.h"
  5. #include "scalarmul.h"
  6. #include "magic.h"
  7. #include "field.h"
  8. #include "crandom.h"
  9. static void
  10. failprint_ext (
  11. const struct extensible_t *a
  12. ) {
  13. field_a_t zi, scaled;
  14. field_print(" x", a->x);
  15. field_print(" y", a->y);
  16. field_print(" z", a->z);
  17. field_inverse(zi, a->z);
  18. field_mul(scaled, zi, a->x);
  19. field_print(" X", scaled);
  20. field_mul(scaled, zi, a->y);
  21. field_print(" Y", scaled);
  22. printf("\n");
  23. }
  24. static void
  25. failprint_tw_ext (
  26. const struct tw_extensible_t *a
  27. ) {
  28. failprint_ext((const struct extensible_t *)a);
  29. }
  30. static mask_t
  31. fail_if_different (
  32. const struct extensible_t *a,
  33. const struct extensible_t *b,
  34. const char *faildescr,
  35. const char *adescr,
  36. const char *bdescr
  37. ) {
  38. mask_t succ = eq_extensible(a, b);
  39. if (!succ) {
  40. youfail();
  41. printf(" %s\n", faildescr);
  42. printf("\n %s:\n", adescr);
  43. failprint_ext(a);
  44. printf("\n %s:\n", bdescr);
  45. failprint_ext(b);
  46. }
  47. return succ;
  48. }
  49. static mask_t
  50. validate_ext(
  51. const struct extensible_t *ext,
  52. int evenness,
  53. const char *description
  54. ) {
  55. mask_t succ = validate_extensible(ext), succ2;
  56. const char *error = "Point isn't on the curve.";
  57. if (evenness > 0) {
  58. succ2 = is_even_pt(ext);
  59. if (succ &~ succ2) error = "Point isn't even.";
  60. succ &= succ2;
  61. } else if (evenness < 0) {
  62. succ2 = is_even_pt(ext);
  63. if (succ &~ succ2) error = "Point is even but shouldn't be.";
  64. succ &= succ2;
  65. } /* FUTURE: quadness */
  66. if (~succ) {
  67. youfail();
  68. printf(" %s\n", error);
  69. printf(" %s\n", description);
  70. failprint_ext(ext);
  71. }
  72. return succ;
  73. }
  74. static mask_t
  75. validate_tw_ext(
  76. const struct tw_extensible_t *ext,
  77. int evenness,
  78. const char *description
  79. ) {
  80. mask_t succ = validate_tw_extensible(ext), succ2;
  81. const char *error = "Point isn't on the twisted curve.";
  82. if (evenness > 0) {
  83. succ2 = is_even_tw(ext);
  84. if (succ &~ succ2) error = "Point isn't even.";
  85. succ &= succ2;
  86. } else if (evenness < 0) {
  87. succ2 = is_even_tw(ext);
  88. if (succ &~ succ2) error = "Point is even but shouldn't be.";
  89. succ &= succ2;
  90. } /* FUTURE: quadness */
  91. if (~succ) {
  92. youfail();
  93. printf(" %s\n", error);
  94. printf(" %s\n", description);
  95. failprint_tw_ext(ext);
  96. }
  97. return succ;
  98. }
  99. static mask_t
  100. fail_if_different_tw (
  101. const struct tw_extensible_t *a,
  102. const struct tw_extensible_t *b,
  103. const char *faildescr,
  104. const char *adescr,
  105. const char *bdescr
  106. ) {
  107. return fail_if_different(
  108. (const struct extensible_t *)a, (const struct extensible_t *)b,
  109. faildescr,adescr,bdescr
  110. );
  111. }
  112. static int
  113. add_double_test (
  114. const struct affine_t *base1,
  115. const struct affine_t *base2
  116. ) {
  117. mask_t succ = MASK_SUCCESS;
  118. struct extensible_t exb;
  119. struct tw_extensible_t text1, text2, texta, textb;
  120. struct tw_extended_t ted1, ted2;
  121. struct tw_pniels_t pn;
  122. /* Convert to ext */
  123. convert_affine_to_extensible(&exb, base1);
  124. succ &= validate_ext(&exb,0,"base1");
  125. twist_and_double(&text1, &exb);
  126. succ &= validate_tw_ext(&text1,2,"iso1");
  127. convert_affine_to_extensible(&exb, base2);
  128. succ &= validate_ext(&exb,0,"base2");
  129. twist_and_double(&text2, &exb);
  130. succ &= validate_tw_ext(&text2,2,"iso2");
  131. /* a + b == b + a? */
  132. convert_tw_extensible_to_tw_pniels(&pn, &text1);
  133. copy_tw_extensible(&texta, &text2);
  134. add_tw_pniels_to_tw_extensible(&texta, &pn);
  135. convert_tw_extensible_to_tw_pniels(&pn, &text2);
  136. copy_tw_extensible(&textb, &text1);
  137. add_tw_pniels_to_tw_extensible(&textb, &pn);
  138. decaf_point_t ted3;
  139. convert_tw_extensible_to_tw_extended(&ted1, &text1);
  140. convert_tw_extensible_to_tw_extended(&ted2, &text2);
  141. decaf_add(ted3, (struct decaf_point_s*)&ted1, (struct decaf_point_s*)&ted2);
  142. add_tw_extended(&ted1, &ted2);
  143. convert_tw_extensible_to_tw_extended(&ted2, &textb);
  144. if (~decaf_eq_tw_extended(&ted1, &ted2) | ~decaf_eq((struct decaf_point_s*)&ted1, ted3)) {
  145. youfail();
  146. succ = 0;
  147. printf(" Tw extended simple compat:\n");
  148. field_print(" x1",ted1.x);
  149. field_print(" y1",ted1.y);
  150. field_print(" z1",ted1.z);
  151. field_print(" t1",ted1.t);
  152. field_print(" x2",ted2.x);
  153. field_print(" y2",ted2.y);
  154. field_print(" z2",ted2.z);
  155. field_print(" t2",ted2.t);
  156. struct tw_extended_t *t3 = (struct tw_extended_t *)&ted3;
  157. field_print(" x3",t3->x);
  158. field_print(" y3",t3->y);
  159. field_print(" z3",t3->z);
  160. field_print(" t3",t3->t);
  161. }
  162. succ &= fail_if_different_tw(&texta,&textb,"Addition commutativity","a+b","b+a");
  163. copy_tw_extensible(&textb, &text2);
  164. add_tw_pniels_to_tw_extensible(&textb, &pn);
  165. copy_tw_extensible(&texta, &text2);
  166. double_tw_extensible(&texta);
  167. succ &= fail_if_different_tw(&texta,&textb,"Doubling test","2b","b+b");
  168. if (~succ) {
  169. printf(" Bases were:\n");
  170. field_print(" x1", base1->x);
  171. field_print(" y1", base1->y);
  172. field_print(" x2", base2->x);
  173. field_print(" y2", base2->y);
  174. }
  175. return succ ? 0 : -1;
  176. }
  177. static int
  178. single_twisting_test (
  179. const struct affine_t *base
  180. ) {
  181. struct extensible_t exb, ext, tmpext;
  182. struct tw_extensible_t text, text2;
  183. mask_t succ = MASK_SUCCESS;
  184. convert_affine_to_extensible(&exb, base);
  185. succ &= validate_ext(&exb,0,"base");
  186. /* check: dual . iso = 4 */
  187. twist_and_double(&text, &exb);
  188. succ &= validate_tw_ext(&text,2,"iso");
  189. untwist_and_double(&ext, &text);
  190. succ &= validate_ext(&ext,2,"dual.iso");
  191. copy_extensible(&tmpext,&exb);
  192. double_extensible(&tmpext);
  193. succ &= validate_ext(&tmpext,1,"2*base");
  194. double_extensible(&tmpext);
  195. succ &= validate_ext(&tmpext,2,"4*base");
  196. succ &= fail_if_different(&ext,&tmpext,"Isogeny and dual","Dual . iso","4*base");
  197. /* check: twist and serialize */
  198. test_only_twist(&text, &exb);
  199. succ &= validate_tw_ext(&text,0,"tot");
  200. mask_t evt = is_even_tw(&text), evb = is_even_pt(&exb);
  201. if (evt != evb) {
  202. youfail();
  203. printf(" Different evenness from twist base: %d, twist: %d\n", (int)-evt, (int)-evb);
  204. succ = 0;
  205. } /* FUTURE: quadness */
  206. field_a_t sera,serb;
  207. untwist_and_double_and_serialize(sera,&text);
  208. copy_extensible(&tmpext,&exb);
  209. double_extensible(&tmpext);
  210. serialize_extensible(serb,&tmpext);
  211. /* check that their (doubled; FUTURE?) serializations are equal */
  212. if (~field_eq(sera,serb)) {
  213. youfail();
  214. printf(" Different serialization from twist + double ()\n");
  215. field_print(" t", sera);
  216. field_print(" b", serb);
  217. succ = 0;
  218. }
  219. untwist_and_double(&ext, &text);
  220. succ &= validate_ext(&tmpext,1,"dual.tot");
  221. twist_and_double(&text2, &ext);
  222. succ &= validate_tw_ext(&text2,2,"iso.dual.tot");
  223. double_tw_extensible(&text);
  224. succ &= validate_tw_ext(&text,1,"2*tot");
  225. double_tw_extensible(&text);
  226. succ &= validate_tw_ext(&text,2,"4*tot");
  227. succ &= fail_if_different_tw(&text,&text2,"Dual and isogeny","4*tot","iso.dual.tot");
  228. if (~succ) {
  229. printf(" Base was:\n");
  230. field_print(" x", base->x);
  231. field_print(" y", base->y);
  232. }
  233. return succ ? 0 : -1;
  234. }
  235. int test_decaf_evil (void) {
  236. #if FIELD_BITS != 448 || WORD_BITS != 64
  237. printf(" [ UNIMP ] ");
  238. return 0;
  239. #else
  240. word_t evil_scalars[5][7] = {
  241. {0},
  242. {0x2378c292ab5844f3,0x216cc2728dc58f55,0xc44edb49aed63690,0xffffffff7cca23e9,
  243. 0xffffffffffffffff,0xffffffffffffffff,0x3fffffffffffffff}, /* q */
  244. {0xdc873d6d54a7bb0d,0xde933d8d723a70aa,0x3bb124b65129c96f,
  245. 0x335dc16,0x0,0x0,0x4000000000000000}, /* qtwist */
  246. {0x46f1852556b089e6,0x42d984e51b8b1eaa,0x889db6935dac6d20,0xfffffffef99447d3,
  247. 0xffffffffffffffff,0xffffffffffffffff,0x7fffffffffffffff}, /* 2q */
  248. {0xb90e7adaa94f761a,0xbd267b1ae474e155,0x7762496ca25392df,0x66bb82c,
  249. 0x0,0x0,0x8000000000000000} /* 2*qtwist */
  250. };
  251. word_t random_scalar[7];
  252. unsigned char evil_inputs[3][56];
  253. memset(evil_inputs[0],0,56);
  254. memset(evil_inputs[1],0,56);
  255. memset(evil_inputs[2],0xff,56);
  256. evil_inputs[1][0] = 1;
  257. evil_inputs[2][0] = evil_inputs[2][28] = 0xFE;
  258. unsigned char random_input[56];
  259. crandom_state_a_t crand;
  260. crandom_init_from_buffer(crand, "my evil_decaf random initializer");
  261. int i,j,fails=0;
  262. int ret = 0;
  263. for (i=0; i<100; i++) {
  264. crandom_generate(crand, (unsigned char *)random_scalar, sizeof(random_scalar));
  265. if (i<15) {
  266. memcpy(random_scalar, evil_scalars[i%5], sizeof(random_scalar));
  267. if (i%3 == 1) random_scalar[0] ++;
  268. if (i%3 == 2) random_scalar[0] --;
  269. }
  270. for (j=0; j<100; j++) {
  271. crandom_generate(crand, random_input, sizeof(random_input));
  272. mask_t should = 0, care_should = 0;
  273. if (j<3) {
  274. memcpy(random_input, evil_inputs[j], sizeof(random_input));
  275. care_should = -1;
  276. should = (j==0) ? -1 : 0;
  277. } else {
  278. random_input[55] &= 0x7F;
  279. }
  280. field_a_t base, out_m, out_e, out_ed;
  281. mask_t s_base = field_deserialize(base,random_input);
  282. affine_a_t pt_e;
  283. tw_affine_a_t pt_te;
  284. tw_extended_a_t pt_ed;
  285. // TODO: test don't allow identity
  286. mask_t s_e = decaf_deserialize_affine(pt_e,base,-1);
  287. mask_t s_te = decaf_deserialize_tw_affine(pt_te,base,-1);
  288. mask_t s_ed = decaf_deserialize_tw_extended(pt_ed,base,-1);
  289. mask_t s_m = decaf_montgomery_ladder(out_m, base, random_scalar, 448);
  290. tw_extensible_a_t work;
  291. convert_tw_affine_to_tw_extensible(work,pt_te);
  292. scalarmul(work, random_scalar);
  293. decaf_serialize_tw_extensible(out_e, work);
  294. scalarmul_ed(pt_ed, random_scalar);
  295. decaf_serialize_tw_extended(out_ed, pt_ed);
  296. uint8_t ser_de[56], ser_ed[56];
  297. decaf_point_t pt_dec, pt_dec2;
  298. memcpy(pt_dec, pt_ed, sizeof(pt_dec));
  299. decaf_encode(ser_de, pt_dec);
  300. mask_t succ_dec = decaf_decode(pt_dec2, ser_de, -1);
  301. field_serialize(ser_ed, out_ed);
  302. decaf_point_t p;
  303. decaf_nonuniform_map_to_curve (p,random_input);
  304. mask_t succ_nur = decaf_valid(p);
  305. if ((care_should && should != s_m)
  306. || ~s_base || s_e != s_te || s_m != s_te || s_ed != s_te
  307. || (s_te && ~field_eq(out_e,out_m))
  308. || (s_ed && ~field_eq(out_e,out_ed))
  309. || memcmp(ser_de, ser_ed, 56)
  310. || (s_e & ~succ_dec)
  311. || (s_e & ~decaf_eq(pt_dec, pt_dec2)
  312. || (s_e & ~decaf_valid(pt_dec))
  313. || ~succ_nur)
  314. ) {
  315. youfail();
  316. field_print(" base", base);
  317. scalar_print(" scal", random_scalar, (448+WORD_BITS-1)/WORD_BITS);
  318. field_print(" oute", out_e);
  319. field_print(" outE", out_ed);
  320. field_print(" outm", out_m);
  321. printf(" succ: m=%d, e=%d, t=%d, b=%d, T=%d, D=%d, nur=%d, should=%d[%d]\n",
  322. -(int)s_m,-(int)s_e,-(int)s_te,-(int)s_base,-(int)s_ed,-(int)succ_dec,
  323. -(int)succ_nur,
  324. -(int)should,-(int)care_should
  325. );
  326. ret = -1;
  327. fails++;
  328. }
  329. }
  330. }
  331. if (fails) {
  332. printf(" Failed %d trials\n", fails);
  333. }
  334. return ret;
  335. #endif
  336. }
  337. int test_decaf (void) {
  338. struct affine_t base;
  339. struct tw_affine_t tw_base;
  340. field_a_t serf;
  341. struct crandom_state_t crand;
  342. crandom_init_from_buffer(&crand, "my test_decaf random initializer");
  343. int i, hits = 0, fails = 0;
  344. for (i=0; i<1000; i++) {
  345. uint8_t ser[FIELD_BYTES];
  346. int j;
  347. mask_t succ = 0;
  348. for (j=0; j<128 && !succ; j++) {
  349. crandom_generate(&crand, ser, sizeof(ser));
  350. ser[FIELD_BYTES-1] &= (1<<((FIELD_BITS-1)%8)) - 1;
  351. succ = field_deserialize(serf, ser);
  352. if (!succ) {
  353. youfail();
  354. printf(" Unlikely: fail at field_deserialize\n");
  355. return -1;
  356. }
  357. succ &= decaf_deserialize_affine(&base, serf, 0);
  358. }
  359. if (!succ) {
  360. youfail();
  361. printf("Unlikely: fail 128 desers\n");
  362. return -1;
  363. }
  364. hits++;
  365. field_a_t serf2;
  366. struct extensible_t ext;
  367. convert_affine_to_extensible(&ext, &base);
  368. decaf_serialize_extensible(serf2, &ext);
  369. if (~validate_affine(&base)) {
  370. youfail();
  371. printf("Invalid decaf deser:\n");
  372. field_print(" s", serf);
  373. field_print(" x", base.x);
  374. field_print(" y", base.y);
  375. fails ++;
  376. } else if (~field_eq(serf, serf2)) {
  377. youfail();
  378. printf("Fail round-trip through decaf ser:\n");
  379. field_print(" s", serf);
  380. field_print(" x", base.x);
  381. field_print(" y", base.y);
  382. printf(" deser is %s\n", validate_affine(&base) ? "valid" : "invalid");
  383. field_print(" S", serf2);
  384. fails ++;
  385. } else if (~is_even_pt(&ext)) {
  386. youfail();
  387. printf("Decaf deser isn't even:\n");
  388. field_print(" s", serf);
  389. field_print(" x", base.x);
  390. field_print(" y", base.y);
  391. fails ++;
  392. }
  393. succ = decaf_deserialize_tw_affine(&tw_base, serf, 0);
  394. struct tw_extensible_t tw_ext, tw_ext2;
  395. convert_tw_affine_to_tw_extensible(&tw_ext, &tw_base);
  396. decaf_serialize_tw_extensible(serf2, &tw_ext);
  397. twist_even(&tw_ext2, &ext);
  398. if (~succ | ~validate_tw_extensible(&tw_ext)) {
  399. youfail();
  400. printf("Invalid decaf tw deser:\n");
  401. field_print(" s", serf);
  402. field_print(" x", tw_base.x);
  403. field_print(" y", tw_base.y);
  404. fails ++;
  405. } else if (~field_eq(serf, serf2)) {
  406. youfail();
  407. printf("Fail round-trip through decaf ser:\n");
  408. field_print(" s", serf);
  409. field_print(" x", tw_base.x);
  410. field_print(" y", tw_base.y);
  411. printf(" tw deser is %s\n", validate_tw_extensible(&tw_ext) ? "valid" : "invalid");
  412. field_print(" S", serf2);
  413. fails ++;
  414. } else if (~is_even_tw(&tw_ext)) {
  415. youfail();
  416. printf("Decaf tw deser isn't even:\n");
  417. field_print(" s", serf);
  418. field_print(" x", tw_base.x);
  419. field_print(" y", tw_base.y);
  420. fails ++;
  421. } else if (~decaf_eq_tw_extensible(&tw_ext,&tw_ext2)) {
  422. youfail();
  423. printf("Decaf tw doesn't equal ext:\n");
  424. field_print(" s", serf);
  425. field_print(" x1", base.x);
  426. field_print(" y1", base.y);
  427. field_print(" x2", tw_base.x);
  428. field_print(" y2", tw_base.y);
  429. field_print(" X2", tw_ext2.x);
  430. field_print(" Y2", tw_ext2.y);
  431. fails ++;
  432. }
  433. tw_extended_a_t ed;
  434. succ = decaf_deserialize_tw_extended(ed, serf, 0);
  435. decaf_serialize_tw_extended(serf2, ed);
  436. if (~succ) {
  437. youfail();
  438. printf("Invalid decaf ed deser:\n");
  439. field_print(" s", serf);
  440. fails ++;
  441. } else if (~field_eq(serf, serf2)) {
  442. youfail();
  443. printf("Fail round-trip through decaf ser:\n");
  444. field_print(" s", serf);
  445. field_print(" x", ed->x);
  446. field_print(" y", ed->y);
  447. field_print(" z", ed->z);
  448. field_print(" t", ed->t);
  449. printf(" tw deser is %s\n", validate_tw_extensible(&tw_ext) ? "valid" : "invalid");
  450. field_print(" S", serf2);
  451. fails ++;
  452. }
  453. word_t scalar = 1;
  454. mask_t res = decaf_montgomery_ladder(serf2,serf,&scalar,1+(i%31));
  455. if (~res | ~field_eq(serf2,serf)) {
  456. youfail();
  457. printf("Decaf Montgomery ladder i=%d res=%d\n", 1+(i%31), (int)res);
  458. field_print(" s", serf);
  459. field_print(" o", serf2);
  460. printf("\n");
  461. }
  462. }
  463. if (hits < 1000) {
  464. youfail();
  465. printf(" Fail: only %d successes in decaf_deser\n", hits);
  466. return -1;
  467. } else if (fails) {
  468. printf(" %d fails\n", fails);
  469. return -1;
  470. } else {
  471. return 0;
  472. }
  473. }
  474. int test_pointops (void) {
  475. struct affine_t base, pbase;
  476. field_a_t serf;
  477. struct crandom_state_t crand;
  478. crandom_init_from_buffer(&crand, "test_pointops random initializer");
  479. struct extensible_t ext_base;
  480. if (!validate_affine(goldilocks_base_point)) {
  481. youfail();
  482. printf(" Base point isn't on the curve.\n");
  483. return -1;
  484. }
  485. convert_affine_to_extensible(&ext_base, goldilocks_base_point);
  486. if (!validate_ext(&ext_base, 2, "base")) return -1;
  487. int i, ret;
  488. for (i=0; i<1000; i++) {
  489. uint8_t ser[FIELD_BYTES];
  490. crandom_generate(&crand, ser, sizeof(ser));
  491. #if (FIELD_BITS % 8)
  492. ser[FIELD_BYTES-1] &= (1<<(FIELD_BITS%8)) - 1;
  493. #endif
  494. /* TODO: we need a field generate, which can return random or pathological. */
  495. mask_t succ = field_deserialize(serf, ser);
  496. if (!succ) {
  497. youfail();
  498. printf(" Unlikely: fail at field_deserialize\n");
  499. return -1;
  500. }
  501. if (i) {
  502. copy_affine(&pbase, &base);
  503. }
  504. elligator_2s_inject(&base, serf);
  505. if (i) {
  506. ret = add_double_test(&base, &pbase);
  507. if (ret) return ret;
  508. }
  509. ret = single_twisting_test(&base);
  510. if (ret) return ret;
  511. }
  512. return 0;
  513. }