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.
 
 
 
 
 

994 lines
28 KiB

  1. /* Copyright (c) 2015 Cryptography Research, Inc.
  2. * Released under the MIT License. See LICENSE.txt for license information.
  3. */
  4. /**
  5. * @file decaf.c
  6. * @author Mike Hamburg
  7. * @brief Decaf high-level functions.
  8. */
  9. #define __STDC_WANT_LIB_EXT1__ 1 /* for memset_s */
  10. #include <decaf.h>
  11. #include <string.h>
  12. #include <assert.h>
  13. #define sv static void
  14. #define snv static void __attribute__((noinline))
  15. #define siv static inline void __attribute__((always_inline))
  16. static const gf ZERO = {{{0}}}, ONE = {{{1}}}, TWO = {{{2}}};
  17. #define LMASK ((((decaf_word_t)1)<<LBITS)-1)
  18. #if WBITS == 64
  19. static const gf P = {{{ LMASK, LMASK, LMASK, LMASK, LMASK-1, LMASK, LMASK, LMASK }}};
  20. #else
  21. static const gf P = {{{ LMASK, LMASK, LMASK, LMASK, LMASK, LMASK, LMASK, LMASK,
  22. LMASK-1, LMASK, LMASK, LMASK, LMASK, LMASK, LMASK, LMASK }}};
  23. #endif
  24. static const int EDWARDS_D = -39081;
  25. const decaf_448_scalar_t decaf_448_scalar_p = {{{
  26. SC_LIMB(0x2378c292ab5844f3),
  27. SC_LIMB(0x216cc2728dc58f55),
  28. SC_LIMB(0xc44edb49aed63690),
  29. SC_LIMB(0xffffffff7cca23e9),
  30. SC_LIMB(0xffffffffffffffff),
  31. SC_LIMB(0xffffffffffffffff),
  32. SC_LIMB(0x3fffffffffffffff)
  33. }}}, decaf_448_scalar_one = {{{1}}}, decaf_448_scalar_zero = {{{0}}};
  34. static const decaf_448_scalar_t decaf_448_scalar_r2 = {{{
  35. SC_LIMB(0xe3539257049b9b60),
  36. SC_LIMB(0x7af32c4bc1b195d9),
  37. SC_LIMB(0x0d66de2388ea1859),
  38. SC_LIMB(0xae17cf725ee4d838),
  39. SC_LIMB(0x1a9cc14ba3c47c44),
  40. SC_LIMB(0x2052bcb7e4d070af),
  41. SC_LIMB(0x3402a939f823b729)
  42. }}};
  43. static const decaf_word_t DECAF_MONTGOMERY_FACTOR = (decaf_word_t)(0x3bd440fae918bc5ull);
  44. #define FIELD_LITERAL(a,b,c,d,e,f,g,h) {{LIMB(a),LIMB(b),LIMB(c),LIMB(d),LIMB(e),LIMB(f),LIMB(g),LIMB(h)}}
  45. const decaf_448_point_t decaf_448_point_base = {{
  46. {FIELD_LITERAL(0x00fffffffffffffe,0x00ffffffffffffff,0x00ffffffffffffff,0x00ffffffffffffff,
  47. 0x0000000000000003,0x0000000000000000,0x0000000000000000,0x0000000000000000)},
  48. {FIELD_LITERAL(0x0081e6d37f752992,0x003078ead1c28721,0x00135cfd2394666c,0x0041149c50506061,
  49. 0x0031d30e4f5490b3,0x00902014990dc141,0x0052341b04c1e328,0x0014237853c10a1b)},
  50. {FIELD_LITERAL(0x00fffffffffffffb,0x00ffffffffffffff,0x00ffffffffffffff,0x00ffffffffffffff,
  51. 0x00fffffffffffffe,0x00ffffffffffffff,0x00ffffffffffffff,0x00ffffffffffffff)},
  52. {FIELD_LITERAL(0x008f205b70660415,0x00881c60cfd3824f,0x00377a638d08500d,0x008c66d5d4672615,
  53. 0x00e52fa558e08e13,0x0087770ae1b6983d,0x004388f55a0aa7ff,0x00b4d9a785cf1a91)}
  54. }};
  55. struct decaf_448_precomputed_s { decaf_448_point_t p[1]; };
  56. const struct decaf_448_precomputed_s *decaf_448_precomputed_base =
  57. (const struct decaf_448_precomputed_s *)decaf_448_point_base;
  58. const size_t sizeof_decaf_448_precomputed_s = sizeof(struct decaf_448_precomputed_s);
  59. const size_t alignof_decaf_448_precomputed_s = 32;
  60. #ifdef __clang__
  61. #if 100*__clang_major__ + __clang_minor__ > 305
  62. #define VECTORIZE _Pragma("clang loop unroll(disable) vectorize(enable) vectorize_width(8)")
  63. #endif
  64. #endif
  65. #ifndef VECTORIZE
  66. #define VECTORIZE
  67. #endif
  68. #if (defined(__OPTIMIZE__) && !defined(__OPTIMIZE_SIZE__)) || defined(DECAF_FORCE_UNROLL)
  69. #if DECAF_448_LIMBS==8
  70. #define FOR_LIMB_U(i,op) { unsigned int i=0; \
  71. op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; \
  72. }
  73. #elif DECAF_448_LIMBS==16
  74. #define FOR_LIMB_U(i,op) { unsigned int i=0; \
  75. op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; \
  76. op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; op;i++; \
  77. }
  78. #else
  79. #define FOR_LIMB_U(i,op) { unsigned int i=0; for (i=0; i<DECAF_448_LIMBS; i++) { op; }}
  80. #endif
  81. #else
  82. #define FOR_LIMB_U(i,op) { unsigned int i=0; for (i=0; i<DECAF_448_LIMBS; i++) { op; }}
  83. #endif
  84. #define FOR_LIMB(i,op) { unsigned int i=0; for (i=0; i<DECAF_448_LIMBS; i++) { op; }}
  85. /* PERF: figure out why this horribly degrades speed if you use it */
  86. #define FOR_LIMB_V(i,op) { unsigned int i=0; VECTORIZE for (i=0; i<DECAF_448_LIMBS; i++) { op; }}
  87. /** Copy x = y */
  88. siv gf_cpy(gf x, const gf y) { FOR_LIMB_U(i, x->limb[i] = y->limb[i]); }
  89. /** Mostly-unoptimized multiply (PERF), but at least it's unrolled. */
  90. snv gf_mul (gf c, const gf a, const gf b) {
  91. gf aa;
  92. gf_cpy(aa,a);
  93. decaf_dword_t accum[DECAF_448_LIMBS] = {0};
  94. FOR_LIMB_U(i, {
  95. FOR_LIMB_U(j,{ accum[(i+j)%DECAF_448_LIMBS] += (decaf_dword_t)b->limb[i] * aa->limb[j]; });
  96. aa->limb[(DECAF_448_LIMBS-1-i)^(DECAF_448_LIMBS/2)] += aa->limb[DECAF_448_LIMBS-1-i];
  97. });
  98. accum[DECAF_448_LIMBS-1] += accum[DECAF_448_LIMBS-2] >> LBITS;
  99. accum[DECAF_448_LIMBS-2] &= LMASK;
  100. accum[DECAF_448_LIMBS/2] += accum[DECAF_448_LIMBS-1] >> LBITS;
  101. FOR_LIMB_U(j,{
  102. accum[j] += accum[(j-1)%DECAF_448_LIMBS] >> LBITS;
  103. accum[(j-1)%DECAF_448_LIMBS] &= LMASK;
  104. });
  105. FOR_LIMB_U(j, c->limb[j] = accum[j] );
  106. }
  107. /** No dedicated square (PERF) */
  108. #define gf_sqr(c,a) gf_mul(c,a,a)
  109. /** Inverse square root using addition chain. */
  110. snv gf_isqrt(gf y, const gf x) {
  111. int i;
  112. #define STEP(s,m,n) gf_mul(s,m,c); gf_cpy(c,s); for (i=0;i<n;i++) gf_sqr(c,c);
  113. gf a, b, c;
  114. gf_sqr ( c, x );
  115. STEP(b,x,1);
  116. STEP(b,x,3);
  117. STEP(a,b,3);
  118. STEP(a,b,9);
  119. STEP(b,a,1);
  120. STEP(a,x,18);
  121. STEP(a,b,37);
  122. STEP(b,a,37);
  123. STEP(b,a,111);
  124. STEP(a,b,1);
  125. STEP(b,x,223);
  126. gf_mul(y,a,c);
  127. }
  128. /** Weak reduce mod p. */
  129. siv gf_reduce(gf x) {
  130. x->limb[DECAF_448_LIMBS/2] += x->limb[DECAF_448_LIMBS-1] >> LBITS;
  131. FOR_LIMB_U(j,{
  132. x->limb[j] += x->limb[(j-1)%DECAF_448_LIMBS] >> LBITS;
  133. x->limb[(j-1)%DECAF_448_LIMBS] &= LMASK;
  134. });
  135. }
  136. /** Add mod p. Conservatively always weak-reduce. (PERF) */
  137. sv gf_add ( gf x, const gf y, const gf z ) {
  138. FOR_LIMB_U(i, x->limb[i] = y->limb[i] + z->limb[i] );
  139. gf_reduce(x);
  140. }
  141. /** Subtract mod p. Conservatively always weak-reduce. (PERF) */
  142. sv gf_sub ( gf x, const gf y, const gf z ) {
  143. FOR_LIMB_U(i, x->limb[i] = y->limb[i] - z->limb[i] + 2*P->limb[i] );
  144. gf_reduce(x);
  145. }
  146. /** Constant time, x = is_z ? z : y */
  147. sv cond_sel(gf x, const gf y, const gf z, decaf_bool_t is_z) {
  148. FOR_LIMB_U(i, x->limb[i] = (y->limb[i] & ~is_z) | (z->limb[i] & is_z) );
  149. }
  150. /** Constant time, if (neg) x=-x; */
  151. siv cond_neg(gf x, decaf_bool_t neg) {
  152. gf y;
  153. gf_sub(y,ZERO,x);
  154. cond_sel(x,x,y,neg);
  155. }
  156. /** Constant time, if (swap) (x,y) = (y,x); */
  157. sv cond_swap(gf x, gf_s *__restrict__ y, decaf_bool_t swap) {
  158. FOR_LIMB_U(i, {
  159. decaf_word_t s = (x->limb[i] ^ y->limb[i]) & swap;
  160. x->limb[i] ^= s;
  161. y->limb[i] ^= s;
  162. });
  163. }
  164. /**
  165. * Mul by signed int. Not constant-time WRT the sign of that int.
  166. * Just uses a full mul (PERF)
  167. */
  168. siv gf_mlw(gf a, const gf b, int w) {
  169. if (w>0) {
  170. gf ww = {{{w}}};
  171. gf_mul(a,b,ww);
  172. } else {
  173. gf ww = {{{-w}}};
  174. gf_mul(a,b,ww);
  175. gf_sub(a,ZERO,a);
  176. }
  177. }
  178. /** Canonicalize */
  179. snv gf_canon ( gf a ) {
  180. gf_reduce(a);
  181. /* subtract p with borrow */
  182. decaf_sdword_t carry = 0;
  183. FOR_LIMB(i, {
  184. carry = carry + a->limb[i] - P->limb[i];
  185. a->limb[i] = carry & LMASK;
  186. carry >>= LBITS;
  187. });
  188. decaf_bool_t addback = carry;
  189. carry = 0;
  190. /* add it back */
  191. FOR_LIMB(i, {
  192. carry = carry + a->limb[i] + (P->limb[i] & addback);
  193. a->limb[i] = carry & LMASK;
  194. carry >>= LBITS;
  195. });
  196. }
  197. /** Compare a==b */
  198. static decaf_word_t __attribute__((noinline)) gf_eq(const gf a, const gf b) {
  199. gf c;
  200. gf_sub(c,a,b);
  201. gf_canon(c);
  202. decaf_word_t ret=0;
  203. FOR_LIMB(i, ret |= c->limb[i] );
  204. /* Hope the compiler is too dumb to optimize this, thus noinline */
  205. return ((decaf_dword_t)ret - 1) >> WBITS;
  206. }
  207. /** Return high bit of x = low bit of 2x mod p */
  208. static decaf_word_t hibit(const gf x) {
  209. gf y;
  210. gf_add(y,x,x);
  211. gf_canon(y);
  212. return -(y->limb[0]&1);
  213. }
  214. /* a = use_c ? c : b */
  215. sv decaf_448_cond_sel (
  216. decaf_448_point_t a,
  217. const decaf_448_point_t b,
  218. const decaf_448_point_t c,
  219. decaf_bool_t use_c
  220. ) {
  221. cond_sel(a->x, b->x, c->x, use_c);
  222. cond_sel(a->y, b->y, c->y, use_c);
  223. cond_sel(a->z, b->z, c->z, use_c);
  224. cond_sel(a->t, b->t, c->t, use_c);
  225. }
  226. /** {extra,accum} - sub +? p
  227. * Must have extra <= 1
  228. */
  229. snv decaf_448_subx(
  230. decaf_448_scalar_t out,
  231. const decaf_word_t accum[DECAF_448_SCALAR_LIMBS],
  232. const decaf_448_scalar_t sub,
  233. const decaf_448_scalar_t p,
  234. decaf_word_t extra
  235. ) {
  236. decaf_sdword_t chain = 0;
  237. unsigned int i;
  238. for (i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  239. chain = (chain + accum[i]) - sub->limb[i];
  240. out->limb[i] = chain;
  241. chain >>= WBITS;
  242. }
  243. decaf_bool_t borrow = chain+extra; /* = 0 or -1 */
  244. chain = 0;
  245. for (i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  246. chain = (chain + out->limb[i]) + (p->limb[i] & borrow);
  247. out->limb[i] = chain;
  248. chain >>= WBITS;
  249. }
  250. }
  251. snv decaf_448_montmul (
  252. decaf_448_scalar_t out,
  253. const decaf_448_scalar_t a,
  254. const decaf_448_scalar_t b
  255. ) {
  256. unsigned int i,j;
  257. decaf_word_t accum[DECAF_448_SCALAR_LIMBS+1] = {0};
  258. decaf_word_t hi_carry = 0;
  259. for (i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  260. decaf_word_t mand = a->limb[i];
  261. const decaf_word_t *mier = b->limb;
  262. decaf_dword_t chain = 0;
  263. for (j=0; j<DECAF_448_SCALAR_LIMBS; j++) {
  264. chain += ((decaf_dword_t)mand)*mier[j] + accum[j];
  265. accum[j] = chain;
  266. chain >>= WBITS;
  267. }
  268. accum[j] = chain;
  269. mand = accum[0] * DECAF_MONTGOMERY_FACTOR;
  270. chain = 0;
  271. mier = decaf_448_scalar_p->limb;
  272. for (j=0; j<DECAF_448_SCALAR_LIMBS; j++) {
  273. chain += (decaf_dword_t)mand*mier[j] + accum[j];
  274. if (j) accum[j-1] = chain;
  275. chain >>= WBITS;
  276. }
  277. chain += accum[j];
  278. chain += hi_carry;
  279. accum[j-1] = chain;
  280. hi_carry = chain >> WBITS;
  281. }
  282. decaf_448_subx(out, accum, decaf_448_scalar_p, decaf_448_scalar_p, hi_carry);
  283. }
  284. void decaf_448_scalar_mul (
  285. decaf_448_scalar_t out,
  286. const decaf_448_scalar_t a,
  287. const decaf_448_scalar_t b
  288. ) {
  289. decaf_448_montmul(out,a,b);
  290. decaf_448_montmul(out,out,decaf_448_scalar_r2);
  291. }
  292. decaf_bool_t decaf_448_scalar_invert (
  293. decaf_448_scalar_t out,
  294. const decaf_448_scalar_t a
  295. ) {
  296. decaf_448_scalar_t b, ma;
  297. int i;
  298. decaf_448_montmul(b,decaf_448_scalar_one,decaf_448_scalar_r2);
  299. decaf_448_montmul(ma,a,decaf_448_scalar_r2);
  300. for (i=DECAF_448_SCALAR_BITS-1; i>=0; i--) {
  301. decaf_448_montmul(b,b,b);
  302. decaf_word_t w = decaf_448_scalar_p->limb[i/WBITS];
  303. if (i<WBITS) {
  304. assert(w >= 2);
  305. w-=2;
  306. }
  307. if (1 & w>>(i%WBITS)) {
  308. decaf_448_montmul(b,b,ma);
  309. }
  310. }
  311. decaf_448_montmul(out,b,decaf_448_scalar_one);
  312. decaf_448_scalar_destroy(b);
  313. decaf_448_scalar_destroy(ma);
  314. return ~decaf_448_scalar_eq(out,decaf_448_scalar_zero);
  315. }
  316. void decaf_448_scalar_sub (
  317. decaf_448_scalar_t out,
  318. const decaf_448_scalar_t a,
  319. const decaf_448_scalar_t b
  320. ) {
  321. decaf_448_subx(out, a->limb, b, decaf_448_scalar_p, 0);
  322. }
  323. void decaf_448_scalar_add (
  324. decaf_448_scalar_t out,
  325. const decaf_448_scalar_t a,
  326. const decaf_448_scalar_t b
  327. ) {
  328. decaf_dword_t chain = 0;
  329. unsigned int i;
  330. for (i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  331. chain = (chain + a->limb[i]) + b->limb[i];
  332. out->limb[i] = chain;
  333. chain >>= WBITS;
  334. }
  335. decaf_448_subx(out, out->limb, decaf_448_scalar_p, decaf_448_scalar_p, chain);
  336. }
  337. void decaf_448_scalar_set (
  338. decaf_448_scalar_t out,
  339. decaf_word_t w
  340. ) {
  341. memset(out,0,sizeof(decaf_448_scalar_t));
  342. out->limb[0] = w;
  343. }
  344. decaf_bool_t decaf_448_scalar_eq (
  345. const decaf_448_scalar_t a,
  346. const decaf_448_scalar_t b
  347. ) {
  348. int i;
  349. decaf_word_t diff = 0;
  350. for(i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  351. diff |= a->limb[i] ^ b->limb[i];
  352. }
  353. return (((decaf_dword_t)diff)-1)>>WBITS;
  354. }
  355. /* *** API begins here *** */
  356. /** identity = (0,1) */
  357. const decaf_448_point_t decaf_448_point_identity = {{{{{0}}},{{{1}}},{{{1}}},{{{0}}}}};
  358. void decaf_448_point_encode( unsigned char ser[DECAF_448_SER_BYTES], const decaf_448_point_t p ) {
  359. /* Can shave off one mul here; not important but makes consistent with paper */
  360. gf a, b, c, d;
  361. gf_mlw ( a, p->y, 1-EDWARDS_D );
  362. gf_mul ( c, a, p->t );
  363. gf_mul ( a, p->x, p->z );
  364. gf_sub ( d, c, a );
  365. gf_add ( a, p->z, p->y );
  366. gf_sub ( b, p->z, p->y );
  367. gf_mul ( c, b, a );
  368. gf_mlw ( b, c, -EDWARDS_D );
  369. gf_isqrt ( a, b );
  370. gf_mlw ( b, a, -EDWARDS_D );
  371. gf_mul ( c, b, a );
  372. gf_mul ( a, c, d );
  373. gf_add ( d, b, b );
  374. gf_mul ( c, d, p->z );
  375. cond_neg ( b, ~hibit(c) );
  376. gf_mul ( c, b, p->y );
  377. gf_add ( a, a, c );
  378. cond_neg ( a, hibit(a) );
  379. gf_canon(a);
  380. int k=0, bits=0;
  381. decaf_dword_t buf=0;
  382. FOR_LIMB(i, {
  383. buf |= (decaf_dword_t)a->limb[i]<<bits;
  384. for (bits += LBITS; (bits>=8 || i==DECAF_448_LIMBS-1) && k<DECAF_448_SER_BYTES; bits-=8, buf>>=8) {
  385. ser[k++]=buf;
  386. }
  387. });
  388. }
  389. /**
  390. * Deserialize a bool, return TRUE if < p.
  391. */
  392. static decaf_bool_t gf_deser(gf s, const unsigned char ser[DECAF_448_SER_BYTES]) {
  393. unsigned int i, k=0, bits=0;
  394. decaf_dword_t buf=0;
  395. for (i=0; i<DECAF_448_SER_BYTES; i++) {
  396. buf |= (decaf_dword_t)ser[i]<<bits;
  397. for (bits += 8; (bits>=LBITS || i==DECAF_448_SER_BYTES-1) && k<DECAF_448_LIMBS; bits-=LBITS, buf>>=LBITS) {
  398. s->limb[k++] = buf & LMASK;
  399. }
  400. }
  401. decaf_sdword_t accum = 0;
  402. FOR_LIMB(i, accum = (accum + s->limb[i] - P->limb[i]) >> WBITS );
  403. return accum;
  404. }
  405. /* Constant-time add or subtract */
  406. snv decaf_448_point_add_sub (
  407. decaf_448_point_t p,
  408. const decaf_448_point_t q,
  409. const decaf_448_point_t r,
  410. decaf_bool_t do_sub
  411. ) {
  412. /* Twisted Edward formulas, complete when 4-torsion isn't involved */
  413. gf a, b, c, d;
  414. gf_sub ( b, q->y, q->x );
  415. gf_sub ( c, r->y, r->x );
  416. gf_add ( d, r->y, r->x );
  417. cond_swap(c,d,do_sub);
  418. gf_mul ( a, c, b );
  419. gf_add ( b, q->y, q->x );
  420. gf_mul ( p->y, d, b );
  421. gf_mul ( b, r->t, q->t );
  422. gf_mlw ( p->x, b, 2-2*EDWARDS_D );
  423. gf_add ( b, a, p->y );
  424. gf_sub ( c, p->y, a );
  425. gf_mul ( a, q->z, r->z );
  426. gf_add ( a, a, a );
  427. gf_add ( p->y, a, p->x );
  428. gf_sub ( a, a, p->x );
  429. cond_swap(a,p->y,do_sub);
  430. gf_mul ( p->z, a, p->y );
  431. gf_mul ( p->x, p->y, c );
  432. gf_mul ( p->y, a, b );
  433. gf_mul ( p->t, b, c );
  434. }
  435. decaf_bool_t decaf_448_point_decode (
  436. decaf_448_point_t p,
  437. const unsigned char ser[DECAF_448_SER_BYTES],
  438. decaf_bool_t allow_identity
  439. ) {
  440. gf s, a, b, c, d, e;
  441. decaf_bool_t succ = gf_deser(s, ser), zero = gf_eq(s, ZERO);
  442. succ &= allow_identity | ~zero;
  443. succ &= ~hibit(s);
  444. gf_sqr ( a, s );
  445. gf_sub ( p->z, ONE, a );
  446. gf_sqr ( b, p->z );
  447. gf_mlw ( c, a, 4-4*EDWARDS_D );
  448. gf_add ( c, c, b );
  449. gf_mul ( b, c, a );
  450. gf_isqrt ( d, b );
  451. gf_sqr ( e, d );
  452. gf_mul ( a, e, b );
  453. gf_add ( a, a, ONE );
  454. succ &= ~gf_eq ( a, ZERO );
  455. gf_mul ( b, c, d );
  456. cond_neg ( d, hibit(b) );
  457. gf_add ( p->x, s, s );
  458. gf_mul ( c, d, s );
  459. gf_sub ( b, TWO, p->z );
  460. gf_mul ( a, b, c );
  461. gf_mul ( p->y,a,p->z );
  462. gf_mul ( p->t,p->x,a );
  463. p->y->limb[0] -= zero;
  464. /* TODO: do something safe if ~succ? */
  465. return succ;
  466. }
  467. void decaf_448_point_sub(decaf_448_point_t a, const decaf_448_point_t b, const decaf_448_point_t c) {
  468. decaf_448_point_add_sub(a,b,c,-1);
  469. }
  470. void decaf_448_point_add(decaf_448_point_t a, const decaf_448_point_t b, const decaf_448_point_t c) {
  471. decaf_448_point_add_sub(a,b,c,0);
  472. }
  473. /* No dedicated point double yet (PERF) */
  474. void decaf_448_point_double(decaf_448_point_t a, const decaf_448_point_t b) {
  475. decaf_448_point_add(a,b,b);
  476. }
  477. void decaf_448_point_negate (
  478. decaf_448_point_t nega,
  479. const decaf_448_point_t a
  480. ) {
  481. gf_sub(nega->x, ZERO, a->x);
  482. gf_cpy(nega->y, a->y);
  483. gf_cpy(nega->z, a->z);
  484. gf_sub(nega->t, ZERO, a->t);
  485. }
  486. decaf_bool_t decaf_448_scalar_decode(
  487. decaf_448_scalar_t s,
  488. const unsigned char ser[DECAF_448_SER_BYTES]
  489. ) {
  490. unsigned int i,j,k=0;
  491. for (i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  492. decaf_word_t out = 0;
  493. for (j=0; j<sizeof(decaf_word_t); j++,k++) {
  494. out |= ((decaf_word_t)ser[k])<<(8*j);
  495. }
  496. s->limb[i] = out;
  497. }
  498. decaf_sdword_t accum = 0;
  499. for (i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  500. accum = (accum + s->limb[i] - decaf_448_scalar_p->limb[i]) >> WBITS;
  501. }
  502. decaf_448_scalar_mul(s,s,decaf_448_scalar_one); /* ham-handed reduce */
  503. return accum;
  504. }
  505. void decaf_bzero (
  506. void *s,
  507. size_t size
  508. ) {
  509. #ifdef __STDC_LIB_EXT1__
  510. memset_s(s, size, 0, size);
  511. #else
  512. volatile uint8_t *destroy = (volatile uint8_t *)s;
  513. unsigned i;
  514. for (i=0; i<size; i++) {
  515. destroy[i] = 0;
  516. }
  517. #endif
  518. }
  519. void decaf_448_scalar_destroy (
  520. decaf_448_scalar_t scalar
  521. ) {
  522. decaf_bzero(scalar, sizeof(decaf_448_scalar_t));
  523. }
  524. static inline void ignore_result ( decaf_bool_t boo ) {
  525. (void)boo;
  526. }
  527. void decaf_448_scalar_decode_long(
  528. decaf_448_scalar_t s,
  529. const unsigned char *ser,
  530. size_t ser_len
  531. ) {
  532. if (ser_len == 0) {
  533. decaf_448_scalar_copy(s, decaf_448_scalar_zero);
  534. return;
  535. }
  536. size_t i;
  537. unsigned char tmp[DECAF_448_SER_BYTES] = {0};
  538. decaf_448_scalar_t t1, t2;
  539. i = ser_len - (ser_len%DECAF_448_SER_BYTES);
  540. if (i==ser_len) i -= DECAF_448_SER_BYTES;
  541. memcpy(tmp, ser+i, ser_len - i);
  542. ignore_result( decaf_448_scalar_decode(t1, tmp) );
  543. decaf_bzero(tmp, sizeof(tmp));
  544. while (i) {
  545. i -= DECAF_448_SER_BYTES;
  546. decaf_448_montmul(t1,t1,decaf_448_scalar_r2);
  547. ignore_result( decaf_448_scalar_decode(t2, ser+i) );
  548. decaf_448_scalar_add(t1, t1, t2);
  549. }
  550. decaf_448_scalar_copy(s, t1);
  551. decaf_448_scalar_destroy(t1);
  552. decaf_448_scalar_destroy(t2);
  553. }
  554. void decaf_448_scalar_encode(
  555. unsigned char ser[DECAF_448_SER_BYTES],
  556. const decaf_448_scalar_t s
  557. ) {
  558. unsigned int i,j,k=0;
  559. for (i=0; i<DECAF_448_SCALAR_LIMBS; i++) {
  560. for (j=0; j<sizeof(decaf_word_t); j++,k++) {
  561. ser[k] = s->limb[i] >> (8*j);
  562. }
  563. }
  564. }
  565. void decaf_448_point_scalarmul (
  566. decaf_448_point_t a,
  567. const decaf_448_point_t b,
  568. const decaf_448_scalar_t scalar
  569. ) {
  570. /* w=2 signed window uses about 1.5 adds per bit.
  571. * I figured a few extra lines was worth the 25% speedup.
  572. */
  573. decaf_448_point_t w,b3,tmp;
  574. decaf_448_point_double(w,b);
  575. /* b3 = b*3 */
  576. decaf_448_point_add(b3,w,b);
  577. int i;
  578. for (i=DECAF_448_SCALAR_BITS &~ 1; i>0; i-=2) {
  579. decaf_word_t bits = scalar->limb[i/WBITS]>>(i%WBITS);
  580. decaf_448_cond_sel(tmp,b,b3,((bits^(bits>>1))&1)-1);
  581. decaf_448_point_double(w,w);
  582. decaf_448_point_add_sub(w,w,tmp,((bits>>1)&1)-1);
  583. decaf_448_point_double(w,w);
  584. }
  585. decaf_448_point_add_sub(w,w,b,((scalar->limb[0]>>1)&1)-1);
  586. /* low bit is special because fo signed window */
  587. decaf_448_cond_sel(tmp,b,decaf_448_point_identity,-(scalar->limb[0]&1));
  588. decaf_448_point_sub(a,w,tmp);
  589. }
  590. void decaf_448_point_double_scalarmul (
  591. decaf_448_point_t a,
  592. const decaf_448_point_t b,
  593. const decaf_448_scalar_t scalarb,
  594. const decaf_448_point_t c,
  595. const decaf_448_scalar_t scalarc
  596. ) {
  597. /* w=2 signed window uses about 1.5 adds per bit.
  598. * I figured a few extra lines was worth the 25% speedup.
  599. * NB: if adapting this function to scalarmul by a
  600. * possibly-odd number of unmasked bits, may need to mask.
  601. */
  602. decaf_448_point_t w,b3,c3,tmp;
  603. decaf_448_point_double(w,b);
  604. decaf_448_point_double(tmp,c);
  605. /* b3 = b*3 */
  606. decaf_448_point_add(b3,w,b);
  607. decaf_448_point_add(c3,tmp,c);
  608. decaf_448_point_add(w,w,tmp);
  609. int i;
  610. for (i=DECAF_448_SCALAR_BITS &~ 1; i>0; i-=2) {
  611. decaf_448_point_double(w,w);
  612. decaf_word_t bits = scalarb->limb[i/WBITS]>>(i%WBITS);
  613. decaf_448_cond_sel(tmp,b,b3,((bits^(bits>>1))&1)-1);
  614. decaf_448_point_add_sub(w,w,tmp,((bits>>1)&1)-1);
  615. bits = scalarc->limb[i/WBITS]>>(i%WBITS);
  616. decaf_448_cond_sel(tmp,c,c3,((bits^(bits>>1))&1)-1);
  617. decaf_448_point_add_sub(w,w,tmp,((bits>>1)&1)-1);
  618. decaf_448_point_double(w,w);
  619. }
  620. decaf_448_point_add_sub(w,w,b,((scalarb->limb[0]>>1)&1)-1);
  621. decaf_448_point_add_sub(w,w,c,((scalarc->limb[0]>>1)&1)-1);
  622. /* low bit is special because of signed window */
  623. decaf_448_cond_sel(tmp,b,decaf_448_point_identity,-(scalarb->limb[0]&1));
  624. decaf_448_point_sub(w,w,tmp);
  625. decaf_448_cond_sel(tmp,c,decaf_448_point_identity,-(scalarc->limb[0]&1));
  626. decaf_448_point_sub(a,w,tmp);
  627. }
  628. decaf_bool_t decaf_448_point_eq ( const decaf_448_point_t p, const decaf_448_point_t q ) {
  629. /* equality mod 2-torsion compares x/y */
  630. gf a, b;
  631. gf_mul ( a, p->y, q->x );
  632. gf_mul ( b, q->y, p->x );
  633. return gf_eq(a,b);
  634. }
  635. /** Inverse square root using addition chain. */
  636. static decaf_bool_t gf_isqrt_chk(gf y, const gf x, decaf_bool_t allow_zero) {
  637. gf tmp0, tmp1;
  638. gf_isqrt(y,x);
  639. gf_sqr(tmp0,y);
  640. gf_mul(tmp1,tmp0,x);
  641. return gf_eq(tmp1,ONE) | (allow_zero & gf_eq(tmp1,ZERO));
  642. }
  643. unsigned char decaf_448_point_from_hash_nonuniform (
  644. decaf_448_point_t p,
  645. const unsigned char ser[DECAF_448_SER_BYTES]
  646. ) {
  647. gf r0,r,a,b,c,dee,D,N,rN,e;
  648. decaf_bool_t over = ~gf_deser(r0,ser);
  649. decaf_bool_t sgn_r0 = hibit(r0);
  650. gf_canon(r0);
  651. gf_sqr(a,r0);
  652. gf_sub(r,ZERO,a); /*gf_mlw(r,a,QUADRATIC_NONRESIDUE);*/
  653. gf_mlw(dee,ONE,EDWARDS_D);
  654. gf_mlw(c,r,EDWARDS_D);
  655. /* Compute D := (dr+a-d)(dr-ar-d) with a=1 */
  656. gf_sub(a,c,dee);
  657. gf_add(a,a,ONE);
  658. decaf_bool_t special_identity_case = gf_eq(a,ZERO);
  659. gf_sub(b,c,r);
  660. gf_sub(b,b,dee);
  661. gf_mul(D,a,b);
  662. /* compute N := (r+1)(a-2d) */
  663. gf_add(a,r,ONE);
  664. gf_mlw(N,a,1-2*EDWARDS_D);
  665. /* e = +-1/sqrt(+-ND) */
  666. gf_mul(rN,r,N);
  667. gf_mul(a,rN,D);
  668. decaf_bool_t square = gf_isqrt_chk(e,a,DECAF_FALSE);
  669. decaf_bool_t r_is_zero = gf_eq(r,ZERO);
  670. square |= r_is_zero;
  671. square |= special_identity_case;
  672. /* b <- t/s */
  673. cond_sel(c,r0,r,square); /* r? = sqr ? r : 1 */
  674. /* In two steps to avoid overflow on 32-bit arch */
  675. gf_mlw(a,c,1-2*EDWARDS_D);
  676. gf_mlw(b,a,1-2*EDWARDS_D);
  677. gf_sub(c,r,ONE);
  678. gf_mul(a,b,c); /* = r? * (r-1) * (a-2d)^2 with a=1 */
  679. gf_mul(b,a,e);
  680. cond_neg(b,~square);
  681. cond_sel(c,r0,ONE,square);
  682. gf_mul(a,e,c);
  683. gf_mul(c,a,D); /* 1/s except for sign. FUTURE: simplify using this. */
  684. gf_sub(b,b,c);
  685. /* a <- s = e * N * (sqr ? r : r0)
  686. * e^2 r N D = 1
  687. * 1/s = 1/(e * N * (sqr ? r : r0)) = e * D * (sqr ? 1 : r0)
  688. */
  689. gf_mul(a,N,r0);
  690. cond_sel(rN,a,rN,square);
  691. gf_mul(a,rN,e);
  692. gf_mul(c,a,b);
  693. /* Normalize/negate */
  694. decaf_bool_t neg_s = hibit(a)^~square;
  695. cond_neg(a,neg_s); /* ends up negative if ~square */
  696. decaf_bool_t sgn_t_over_s = hibit(b)^neg_s;
  697. sgn_t_over_s &= ~gf_eq(N,ZERO);
  698. sgn_t_over_s |= gf_eq(D,ZERO);
  699. /* b <- t */
  700. cond_sel(b,c,ONE,gf_eq(c,ZERO)); /* 0,0 -> 1,0 */
  701. /* isogenize */
  702. gf_sqr(c,a); /* s^2 */
  703. gf_add(a,a,a); /* 2s */
  704. gf_add(e,c,ONE);
  705. gf_mul(p->t,a,e); /* 2s(1+s^2) */
  706. gf_mul(p->x,a,b); /* 2st */
  707. gf_sub(a,ONE,c);
  708. gf_mul(p->y,e,a); /* (1+s^2)(1-s^2) */
  709. gf_mul(p->z,a,b); /* (1-s^2)t */
  710. return (~square & 1) | (sgn_t_over_s & 2) | (sgn_r0 & 4) | (over & 8);
  711. }
  712. /* TODO: source these impls instead of copy-pasting them */
  713. decaf_bool_t
  714. decaf_448_invert_elligator_nonuniform (
  715. unsigned char recovered_hash[DECAF_448_SER_BYTES],
  716. const decaf_448_point_t p,
  717. unsigned char hint
  718. ) {
  719. decaf_bool_t sgn_s = -(hint & 1),
  720. sgn_t_over_s = -(hint>>1 & 1),
  721. sgn_r0 = -(hint>>2 & 1);
  722. gf a, b, c, d;
  723. gf_mlw ( a, p->y, 1-EDWARDS_D );
  724. gf_mul ( c, a, p->t );
  725. gf_mul ( a, p->x, p->z );
  726. gf_sub ( d, c, a );
  727. gf_add ( a, p->z, p->y );
  728. gf_sub ( b, p->z, p->y );
  729. gf_mul ( c, b, a );
  730. gf_mlw ( b, c, -EDWARDS_D );
  731. gf_isqrt ( a, b );
  732. gf_mlw ( b, a, -EDWARDS_D );
  733. gf_mul ( c, b, a );
  734. gf_mul ( a, c, d );
  735. gf_add ( d, b, b );
  736. gf_mul ( c, d, p->z );
  737. cond_neg ( b, sgn_t_over_s^~hibit(c) );
  738. cond_neg ( c, sgn_t_over_s^~hibit(c) );
  739. gf_mul ( d, b, p->y );
  740. gf_add ( a, a, d );
  741. cond_neg( a, hibit(a)^sgn_s);
  742. /* ok, s = a; c = -t/s */
  743. gf_mul(b,c,a);
  744. gf_sub(b,ONE,b); /* t+1 */
  745. gf_sqr(c,a); /* s^2 */
  746. { /* identity adjustments */
  747. /* in case of identity, currently c=0, t=0, b=1, will encode to 1 */
  748. /* if hint is 0, -> 0 */
  749. /* if hint is to neg t/s, then go to infinity, effectively set s to 1 */
  750. decaf_bool_t is_identity = gf_eq(p->x,ZERO);
  751. cond_sel(c,c,ONE,is_identity & sgn_t_over_s);
  752. cond_sel(b,b,ZERO,is_identity & ~sgn_t_over_s & ~sgn_s); /* identity adjust */
  753. }
  754. gf_mlw(d,c,2*EDWARDS_D-1); /* $d = (2d-a)s^2 */
  755. gf_add(a,b,d); /* num? */
  756. gf_sub(d,b,d); /* den? */
  757. gf_mul(b,a,d); /* n*d */
  758. cond_sel(a,d,a,sgn_s);
  759. decaf_bool_t succ = gf_isqrt_chk(c,b,DECAF_TRUE);
  760. gf_mul(b,a,c);
  761. cond_neg(b, sgn_r0^hibit(b));
  762. succ &= ~(gf_eq(b,ZERO) & sgn_r0);
  763. gf_canon(b);
  764. int k=0, bits=0;
  765. decaf_dword_t buf=0;
  766. FOR_LIMB(i, {
  767. buf |= (decaf_dword_t)b->limb[i]<<bits;
  768. for (bits += LBITS; (bits>=8 || i==DECAF_448_LIMBS-1) && k<DECAF_448_SER_BYTES; bits-=8, buf>>=8) {
  769. recovered_hash[k++]=buf;
  770. }
  771. });
  772. return succ;
  773. }
  774. void decaf_448_point_debugging_torque (
  775. decaf_448_point_t q,
  776. const decaf_448_point_t p
  777. ) {
  778. gf_sub(q->x,ZERO,p->x);
  779. gf_sub(q->y,ZERO,p->y);
  780. gf_cpy(q->z,p->z);
  781. gf_cpy(q->t,p->t);
  782. }
  783. unsigned char decaf_448_point_from_hash_uniform (
  784. decaf_448_point_t pt,
  785. const unsigned char hashed_data[2*DECAF_448_SER_BYTES]
  786. ) {
  787. decaf_448_point_t pt2;
  788. unsigned char ret1 =
  789. decaf_448_point_from_hash_nonuniform(pt,hashed_data);
  790. unsigned char ret2 =
  791. decaf_448_point_from_hash_nonuniform(pt2,&hashed_data[DECAF_448_SER_BYTES]);
  792. decaf_448_point_add(pt,pt,pt2);
  793. return ret1 | (ret2<<4);
  794. }
  795. decaf_bool_t decaf_448_invert_elligator_uniform (
  796. unsigned char partial_hash[2*DECAF_448_SER_BYTES],
  797. const decaf_448_point_t p,
  798. unsigned char hint
  799. ) {
  800. decaf_448_point_t pt2;
  801. decaf_448_point_from_hash_nonuniform(pt2,&partial_hash[DECAF_448_SER_BYTES]);
  802. decaf_448_point_sub(pt2,p,pt2);
  803. return decaf_448_invert_elligator_nonuniform(partial_hash,pt2,hint);
  804. }
  805. decaf_bool_t decaf_448_point_valid (
  806. const decaf_448_point_t p
  807. ) {
  808. gf a,b,c;
  809. gf_mul(a,p->x,p->y);
  810. gf_mul(b,p->z,p->t);
  811. decaf_bool_t out = gf_eq(a,b);
  812. gf_sqr(a,p->x);
  813. gf_sqr(b,p->y);
  814. gf_sub(a,b,a);
  815. gf_sqr(b,p->t);
  816. gf_mlw(c,b,1-EDWARDS_D);
  817. gf_sqr(b,p->z);
  818. gf_sub(b,b,c);
  819. out &= gf_eq(a,b);
  820. out &= ~gf_eq(p->z,ZERO);
  821. return out;
  822. }
  823. void decaf_448_precompute (
  824. decaf_448_precomputed_s *a,
  825. const decaf_448_point_t b
  826. ) {
  827. decaf_448_point_copy(a->p[0],b);
  828. }
  829. decaf_bool_t decaf_448_direct_scalarmul (
  830. uint8_t scaled[DECAF_448_SER_BYTES],
  831. const uint8_t base[DECAF_448_SER_BYTES],
  832. const decaf_448_scalar_t scalar,
  833. decaf_bool_t allow_identity,
  834. decaf_bool_t short_circuit
  835. ) {
  836. decaf_448_point_t basep;
  837. decaf_bool_t succ = decaf_448_point_decode(basep, base, allow_identity);
  838. if (short_circuit & ~succ) return succ;
  839. decaf_448_point_scalarmul(basep, basep, scalar);
  840. decaf_448_point_encode(scaled, basep);
  841. return succ;
  842. }
  843. void decaf_448_precomputed_scalarmul (
  844. decaf_448_point_t a,
  845. const decaf_448_precomputed_s *b,
  846. const decaf_448_scalar_t scalar
  847. ) {
  848. decaf_448_point_scalarmul(a,b->p[0],scalar);
  849. }
  850. void decaf_448_base_double_scalarmul_non_secret (
  851. decaf_448_point_t combo,
  852. const decaf_448_scalar_t scalar1,
  853. const decaf_448_point_t base2,
  854. const decaf_448_scalar_t scalar2
  855. ) {
  856. decaf_448_point_double_scalarmul(combo, decaf_448_point_base, scalar1, base2, scalar2);
  857. }
  858. void decaf_448_point_destroy (
  859. decaf_448_point_t point
  860. ) {
  861. decaf_bzero(point, sizeof(decaf_448_point_t));
  862. }
  863. decaf_bool_t decaf_memeq (
  864. const void *data1_,
  865. const void *data2_,
  866. size_t size
  867. ) {
  868. const unsigned char *data1 = (const unsigned char *)data1_;
  869. const unsigned char *data2 = (const unsigned char *)data2_;
  870. unsigned char ret = 0;
  871. for (; size; size--, data1++, data2++) {
  872. ret |= *data1 ^ *data2;
  873. }
  874. return (((decaf_dword_t)ret) - 1) >> 8;
  875. }
  876. void decaf_448_precomputed_destroy (
  877. decaf_448_precomputed_s *pre
  878. ) {
  879. decaf_bzero(pre, sizeof_decaf_448_precomputed_s);
  880. }