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.
 
 
 
 
 

577 lines
17 KiB

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