Poly1305.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601
  1. /*
  2. 20080912
  3. D. J. Bernstein
  4. Public domain.
  5. */
  6. #include "Poly1305.hpp"
  7. #include "Constants.hpp"
  8. #include <stdint.h>
  9. #include <stdio.h>
  10. #include <stdlib.h>
  11. #include <string.h>
  12. #ifdef __WINDOWS__
  13. #pragma warning(disable : 4146)
  14. #endif
  15. namespace ZeroTier {
  16. namespace {
  17. typedef struct poly1305_context {
  18. size_t aligner;
  19. unsigned char opaque[136];
  20. } poly1305_context;
  21. #if (defined(_MSC_VER) || defined(__GNUC__)) && (defined(__amd64) || defined(__amd64__) || defined(__x86_64) || defined(__x86_64__) || defined(__AMD64) || defined(__AMD64__) || defined(_M_X64))
  22. //////////////////////////////////////////////////////////////////////////////
  23. // 128-bit implementation for MSC and GCC from Poly1305-donna
  24. #if defined(_MSC_VER)
  25. #include <intrin.h>
  26. typedef struct uint128_t {
  27. unsigned long long lo;
  28. unsigned long long hi;
  29. } uint128_t;
  30. #define MUL(out, x, y) out.lo = _umul128((x), (y), &out.hi)
  31. #define ADD(out, in) \
  32. { \
  33. unsigned long long t = out.lo; \
  34. out.lo += in.lo; \
  35. out.hi += (out.lo < t) + in.hi; \
  36. }
  37. #define ADDLO(out, in) \
  38. { \
  39. unsigned long long t = out.lo; \
  40. out.lo += in; \
  41. out.hi += (out.lo < t); \
  42. }
  43. #define SHR(in, shift) (__shiftright128(in.lo, in.hi, (shift)))
  44. #define LO(in) (in.lo)
  45. // #define POLY1305_NOINLINE __declspec(noinline)
  46. #elif defined(__GNUC__)
  47. #if defined(__SIZEOF_INT128__)
  48. typedef unsigned __int128 uint128_t;
  49. #else
  50. typedef unsigned uint128_t __attribute__((mode(TI)));
  51. #endif
  52. #define MUL(out, x, y) out = ((uint128_t)x * y)
  53. #define ADD(out, in) out += in
  54. #define ADDLO(out, in) out += in
  55. #define SHR(in, shift) (unsigned long long)(in >> (shift))
  56. #define LO(in) (unsigned long long)(in)
  57. // #define POLY1305_NOINLINE __attribute__((noinline))
  58. #endif
  59. #define poly1305_block_size 16
  60. /* 17 + sizeof(size_t) + 8*sizeof(unsigned long long) */
  61. typedef struct poly1305_state_internal_t {
  62. unsigned long long r[3];
  63. unsigned long long h[3];
  64. unsigned long long pad[2];
  65. size_t leftover;
  66. unsigned char buffer[poly1305_block_size];
  67. unsigned char final;
  68. } poly1305_state_internal_t;
  69. #if defined(ZT_NO_TYPE_PUNNING) || (__BYTE_ORDER != __LITTLE_ENDIAN)
  70. static inline unsigned long long U8TO64(const unsigned char* p)
  71. {
  72. return (
  73. ((unsigned long long)(p[0] & 0xff)) | ((unsigned long long)(p[1] & 0xff) << 8) | ((unsigned long long)(p[2] & 0xff) << 16) | ((unsigned long long)(p[3] & 0xff) << 24) | ((unsigned long long)(p[4] & 0xff) << 32)
  74. | ((unsigned long long)(p[5] & 0xff) << 40) | ((unsigned long long)(p[6] & 0xff) << 48) | ((unsigned long long)(p[7] & 0xff) << 56));
  75. }
  76. #else
  77. #define U8TO64(p) (*reinterpret_cast<const unsigned long long*>(p))
  78. #endif
  79. #if defined(ZT_NO_TYPE_PUNNING) || (__BYTE_ORDER != __LITTLE_ENDIAN)
  80. static inline void U64TO8(unsigned char* p, unsigned long long v)
  81. {
  82. p[0] = (v) & 0xff;
  83. p[1] = (v >> 8) & 0xff;
  84. p[2] = (v >> 16) & 0xff;
  85. p[3] = (v >> 24) & 0xff;
  86. p[4] = (v >> 32) & 0xff;
  87. p[5] = (v >> 40) & 0xff;
  88. p[6] = (v >> 48) & 0xff;
  89. p[7] = (v >> 56) & 0xff;
  90. }
  91. #else
  92. #define U64TO8(p, v) ((*reinterpret_cast<unsigned long long*>(p)) = (v))
  93. #endif
  94. static inline void poly1305_init(poly1305_context* ctx, const unsigned char key[32])
  95. {
  96. poly1305_state_internal_t* st = (poly1305_state_internal_t*)ctx;
  97. unsigned long long t0, t1;
  98. /* r &= 0xffffffc0ffffffc0ffffffc0fffffff */
  99. t0 = U8TO64(&key[0]);
  100. t1 = U8TO64(&key[8]);
  101. st->r[0] = (t0) & 0xffc0fffffff;
  102. st->r[1] = ((t0 >> 44) | (t1 << 20)) & 0xfffffc0ffff;
  103. st->r[2] = ((t1 >> 24)) & 0x00ffffffc0f;
  104. /* h = 0 */
  105. st->h[0] = 0;
  106. st->h[1] = 0;
  107. st->h[2] = 0;
  108. /* save pad for later */
  109. st->pad[0] = U8TO64(&key[16]);
  110. st->pad[1] = U8TO64(&key[24]);
  111. st->leftover = 0;
  112. st->final = 0;
  113. }
  114. static inline void poly1305_blocks(poly1305_state_internal_t* st, const unsigned char* m, size_t bytes)
  115. {
  116. const unsigned long long hibit = (st->final) ? 0 : ((unsigned long long)1 << 40); /* 1 << 128 */
  117. unsigned long long r0, r1, r2;
  118. unsigned long long s1, s2;
  119. unsigned long long h0, h1, h2;
  120. unsigned long long c;
  121. uint128_t d0, d1, d2, d;
  122. r0 = st->r[0];
  123. r1 = st->r[1];
  124. r2 = st->r[2];
  125. h0 = st->h[0];
  126. h1 = st->h[1];
  127. h2 = st->h[2];
  128. s1 = r1 * (5 << 2);
  129. s2 = r2 * (5 << 2);
  130. while (bytes >= poly1305_block_size) {
  131. unsigned long long t0, t1;
  132. /* h += m[i] */
  133. t0 = U8TO64(&m[0]);
  134. t1 = U8TO64(&m[8]);
  135. h0 += ((t0) & 0xfffffffffff);
  136. h1 += (((t0 >> 44) | (t1 << 20)) & 0xfffffffffff);
  137. h2 += (((t1 >> 24)) & 0x3ffffffffff) | hibit;
  138. /* h *= r */
  139. MUL(d0, h0, r0);
  140. MUL(d, h1, s2);
  141. ADD(d0, d);
  142. MUL(d, h2, s1);
  143. ADD(d0, d);
  144. MUL(d1, h0, r1);
  145. MUL(d, h1, r0);
  146. ADD(d1, d);
  147. MUL(d, h2, s2);
  148. ADD(d1, d);
  149. MUL(d2, h0, r2);
  150. MUL(d, h1, r1);
  151. ADD(d2, d);
  152. MUL(d, h2, r0);
  153. ADD(d2, d);
  154. /* (partial) h %= p */
  155. c = SHR(d0, 44);
  156. h0 = LO(d0) & 0xfffffffffff;
  157. ADDLO(d1, c);
  158. c = SHR(d1, 44);
  159. h1 = LO(d1) & 0xfffffffffff;
  160. ADDLO(d2, c);
  161. c = SHR(d2, 42);
  162. h2 = LO(d2) & 0x3ffffffffff;
  163. h0 += c * 5;
  164. c = (h0 >> 44);
  165. h0 = h0 & 0xfffffffffff;
  166. h1 += c;
  167. m += poly1305_block_size;
  168. bytes -= poly1305_block_size;
  169. }
  170. st->h[0] = h0;
  171. st->h[1] = h1;
  172. st->h[2] = h2;
  173. }
  174. static inline void poly1305_finish(poly1305_context* ctx, unsigned char mac[16])
  175. {
  176. poly1305_state_internal_t* st = (poly1305_state_internal_t*)ctx;
  177. unsigned long long h0, h1, h2, c;
  178. unsigned long long g0, g1, g2;
  179. unsigned long long t0, t1;
  180. /* process the remaining block */
  181. if (st->leftover) {
  182. size_t i = st->leftover;
  183. st->buffer[i] = 1;
  184. for (i = i + 1; i < poly1305_block_size; i++) {
  185. st->buffer[i] = 0;
  186. }
  187. st->final = 1;
  188. poly1305_blocks(st, st->buffer, poly1305_block_size);
  189. }
  190. /* fully carry h */
  191. h0 = st->h[0];
  192. h1 = st->h[1];
  193. h2 = st->h[2];
  194. c = (h1 >> 44);
  195. h1 &= 0xfffffffffff;
  196. h2 += c;
  197. c = (h2 >> 42);
  198. h2 &= 0x3ffffffffff;
  199. h0 += c * 5;
  200. c = (h0 >> 44);
  201. h0 &= 0xfffffffffff;
  202. h1 += c;
  203. c = (h1 >> 44);
  204. h1 &= 0xfffffffffff;
  205. h2 += c;
  206. c = (h2 >> 42);
  207. h2 &= 0x3ffffffffff;
  208. h0 += c * 5;
  209. c = (h0 >> 44);
  210. h0 &= 0xfffffffffff;
  211. h1 += c;
  212. /* compute h + -p */
  213. g0 = h0 + 5;
  214. c = (g0 >> 44);
  215. g0 &= 0xfffffffffff;
  216. g1 = h1 + c;
  217. c = (g1 >> 44);
  218. g1 &= 0xfffffffffff;
  219. g2 = h2 + c - ((unsigned long long)1 << 42);
  220. /* select h if h < p, or h + -p if h >= p */
  221. c = (g2 >> ((sizeof(unsigned long long) * 8) - 1)) - 1;
  222. g0 &= c;
  223. g1 &= c;
  224. g2 &= c;
  225. c = ~c;
  226. h0 = (h0 & c) | g0;
  227. h1 = (h1 & c) | g1;
  228. h2 = (h2 & c) | g2;
  229. /* h = (h + pad) */
  230. t0 = st->pad[0];
  231. t1 = st->pad[1];
  232. h0 += ((t0) & 0xfffffffffff);
  233. c = (h0 >> 44);
  234. h0 &= 0xfffffffffff;
  235. h1 += (((t0 >> 44) | (t1 << 20)) & 0xfffffffffff) + c;
  236. c = (h1 >> 44);
  237. h1 &= 0xfffffffffff;
  238. h2 += (((t1 >> 24)) & 0x3ffffffffff) + c;
  239. h2 &= 0x3ffffffffff;
  240. /* mac = h % (2^128) */
  241. h0 = ((h0) | (h1 << 44));
  242. h1 = ((h1 >> 20) | (h2 << 24));
  243. U64TO8(&mac[0], h0);
  244. U64TO8(&mac[8], h1);
  245. /* zero out the state */
  246. st->h[0] = 0;
  247. st->h[1] = 0;
  248. st->h[2] = 0;
  249. st->r[0] = 0;
  250. st->r[1] = 0;
  251. st->r[2] = 0;
  252. st->pad[0] = 0;
  253. st->pad[1] = 0;
  254. }
  255. //////////////////////////////////////////////////////////////////////////////
  256. #else
  257. //////////////////////////////////////////////////////////////////////////////
  258. // More portable 64-bit implementation
  259. #define poly1305_block_size 16
  260. /* 17 + sizeof(size_t) + 14*sizeof(unsigned long) */
  261. typedef struct poly1305_state_internal_t {
  262. unsigned long r[5];
  263. unsigned long h[5];
  264. unsigned long pad[4];
  265. size_t leftover;
  266. unsigned char buffer[poly1305_block_size];
  267. unsigned char final;
  268. } poly1305_state_internal_t;
  269. /* interpret four 8 bit unsigned integers as a 32 bit unsigned integer in little endian */
  270. static unsigned long U8TO32(const unsigned char* p)
  271. {
  272. return (((unsigned long)(p[0] & 0xff)) | ((unsigned long)(p[1] & 0xff) << 8) | ((unsigned long)(p[2] & 0xff) << 16) | ((unsigned long)(p[3] & 0xff) << 24));
  273. }
  274. /* store a 32 bit unsigned integer as four 8 bit unsigned integers in little endian */
  275. static void U32TO8(unsigned char* p, unsigned long v)
  276. {
  277. p[0] = (v) & 0xff;
  278. p[1] = (v >> 8) & 0xff;
  279. p[2] = (v >> 16) & 0xff;
  280. p[3] = (v >> 24) & 0xff;
  281. }
  282. static inline void poly1305_init(poly1305_context* ctx, const unsigned char key[32])
  283. {
  284. poly1305_state_internal_t* st = (poly1305_state_internal_t*)ctx;
  285. /* r &= 0xffffffc0ffffffc0ffffffc0fffffff */
  286. st->r[0] = (U8TO32(&key[0])) & 0x3ffffff;
  287. st->r[1] = (U8TO32(&key[3]) >> 2) & 0x3ffff03;
  288. st->r[2] = (U8TO32(&key[6]) >> 4) & 0x3ffc0ff;
  289. st->r[3] = (U8TO32(&key[9]) >> 6) & 0x3f03fff;
  290. st->r[4] = (U8TO32(&key[12]) >> 8) & 0x00fffff;
  291. /* h = 0 */
  292. st->h[0] = 0;
  293. st->h[1] = 0;
  294. st->h[2] = 0;
  295. st->h[3] = 0;
  296. st->h[4] = 0;
  297. /* save pad for later */
  298. st->pad[0] = U8TO32(&key[16]);
  299. st->pad[1] = U8TO32(&key[20]);
  300. st->pad[2] = U8TO32(&key[24]);
  301. st->pad[3] = U8TO32(&key[28]);
  302. st->leftover = 0;
  303. st->final = 0;
  304. }
  305. static inline void poly1305_blocks(poly1305_state_internal_t* st, const unsigned char* m, size_t bytes)
  306. {
  307. const unsigned long hibit = (st->final) ? 0 : (1 << 24); /* 1 << 128 */
  308. unsigned long r0, r1, r2, r3, r4;
  309. unsigned long s1, s2, s3, s4;
  310. unsigned long h0, h1, h2, h3, h4;
  311. unsigned long long d0, d1, d2, d3, d4;
  312. unsigned long c;
  313. r0 = st->r[0];
  314. r1 = st->r[1];
  315. r2 = st->r[2];
  316. r3 = st->r[3];
  317. r4 = st->r[4];
  318. s1 = r1 * 5;
  319. s2 = r2 * 5;
  320. s3 = r3 * 5;
  321. s4 = r4 * 5;
  322. h0 = st->h[0];
  323. h1 = st->h[1];
  324. h2 = st->h[2];
  325. h3 = st->h[3];
  326. h4 = st->h[4];
  327. while (bytes >= poly1305_block_size) {
  328. /* h += m[i] */
  329. h0 += (U8TO32(m + 0)) & 0x3ffffff;
  330. h1 += (U8TO32(m + 3) >> 2) & 0x3ffffff;
  331. h2 += (U8TO32(m + 6) >> 4) & 0x3ffffff;
  332. h3 += (U8TO32(m + 9) >> 6) & 0x3ffffff;
  333. h4 += (U8TO32(m + 12) >> 8) | hibit;
  334. /* h *= r */
  335. d0 = ((unsigned long long)h0 * r0) + ((unsigned long long)h1 * s4) + ((unsigned long long)h2 * s3) + ((unsigned long long)h3 * s2) + ((unsigned long long)h4 * s1);
  336. d1 = ((unsigned long long)h0 * r1) + ((unsigned long long)h1 * r0) + ((unsigned long long)h2 * s4) + ((unsigned long long)h3 * s3) + ((unsigned long long)h4 * s2);
  337. d2 = ((unsigned long long)h0 * r2) + ((unsigned long long)h1 * r1) + ((unsigned long long)h2 * r0) + ((unsigned long long)h3 * s4) + ((unsigned long long)h4 * s3);
  338. d3 = ((unsigned long long)h0 * r3) + ((unsigned long long)h1 * r2) + ((unsigned long long)h2 * r1) + ((unsigned long long)h3 * r0) + ((unsigned long long)h4 * s4);
  339. d4 = ((unsigned long long)h0 * r4) + ((unsigned long long)h1 * r3) + ((unsigned long long)h2 * r2) + ((unsigned long long)h3 * r1) + ((unsigned long long)h4 * r0);
  340. /* (partial) h %= p */
  341. c = (unsigned long)(d0 >> 26);
  342. h0 = (unsigned long)d0 & 0x3ffffff;
  343. d1 += c;
  344. c = (unsigned long)(d1 >> 26);
  345. h1 = (unsigned long)d1 & 0x3ffffff;
  346. d2 += c;
  347. c = (unsigned long)(d2 >> 26);
  348. h2 = (unsigned long)d2 & 0x3ffffff;
  349. d3 += c;
  350. c = (unsigned long)(d3 >> 26);
  351. h3 = (unsigned long)d3 & 0x3ffffff;
  352. d4 += c;
  353. c = (unsigned long)(d4 >> 26);
  354. h4 = (unsigned long)d4 & 0x3ffffff;
  355. h0 += c * 5;
  356. c = (h0 >> 26);
  357. h0 = h0 & 0x3ffffff;
  358. h1 += c;
  359. m += poly1305_block_size;
  360. bytes -= poly1305_block_size;
  361. }
  362. st->h[0] = h0;
  363. st->h[1] = h1;
  364. st->h[2] = h2;
  365. st->h[3] = h3;
  366. st->h[4] = h4;
  367. }
  368. static inline void poly1305_finish(poly1305_context* ctx, unsigned char mac[16])
  369. {
  370. poly1305_state_internal_t* st = (poly1305_state_internal_t*)ctx;
  371. unsigned long h0, h1, h2, h3, h4, c;
  372. unsigned long g0, g1, g2, g3, g4;
  373. unsigned long long f;
  374. unsigned long mask;
  375. /* process the remaining block */
  376. if (st->leftover) {
  377. size_t i = st->leftover;
  378. st->buffer[i++] = 1;
  379. for (; i < poly1305_block_size; i++) {
  380. st->buffer[i] = 0;
  381. }
  382. st->final = 1;
  383. poly1305_blocks(st, st->buffer, poly1305_block_size);
  384. }
  385. /* fully carry h */
  386. h0 = st->h[0];
  387. h1 = st->h[1];
  388. h2 = st->h[2];
  389. h3 = st->h[3];
  390. h4 = st->h[4];
  391. c = h1 >> 26;
  392. h1 = h1 & 0x3ffffff;
  393. h2 += c;
  394. c = h2 >> 26;
  395. h2 = h2 & 0x3ffffff;
  396. h3 += c;
  397. c = h3 >> 26;
  398. h3 = h3 & 0x3ffffff;
  399. h4 += c;
  400. c = h4 >> 26;
  401. h4 = h4 & 0x3ffffff;
  402. h0 += c * 5;
  403. c = h0 >> 26;
  404. h0 = h0 & 0x3ffffff;
  405. h1 += c;
  406. /* compute h + -p */
  407. g0 = h0 + 5;
  408. c = g0 >> 26;
  409. g0 &= 0x3ffffff;
  410. g1 = h1 + c;
  411. c = g1 >> 26;
  412. g1 &= 0x3ffffff;
  413. g2 = h2 + c;
  414. c = g2 >> 26;
  415. g2 &= 0x3ffffff;
  416. g3 = h3 + c;
  417. c = g3 >> 26;
  418. g3 &= 0x3ffffff;
  419. g4 = h4 + c - (1 << 26);
  420. /* select h if h < p, or h + -p if h >= p */
  421. mask = (g4 >> ((sizeof(unsigned long) * 8) - 1)) - 1;
  422. g0 &= mask;
  423. g1 &= mask;
  424. g2 &= mask;
  425. g3 &= mask;
  426. g4 &= mask;
  427. mask = ~mask;
  428. h0 = (h0 & mask) | g0;
  429. h1 = (h1 & mask) | g1;
  430. h2 = (h2 & mask) | g2;
  431. h3 = (h3 & mask) | g3;
  432. h4 = (h4 & mask) | g4;
  433. /* h = h % (2^128) */
  434. h0 = ((h0) | (h1 << 26)) & 0xffffffff;
  435. h1 = ((h1 >> 6) | (h2 << 20)) & 0xffffffff;
  436. h2 = ((h2 >> 12) | (h3 << 14)) & 0xffffffff;
  437. h3 = ((h3 >> 18) | (h4 << 8)) & 0xffffffff;
  438. /* mac = (h + pad) % (2^128) */
  439. f = (unsigned long long)h0 + st->pad[0];
  440. h0 = (unsigned long)f;
  441. f = (unsigned long long)h1 + st->pad[1] + (f >> 32);
  442. h1 = (unsigned long)f;
  443. f = (unsigned long long)h2 + st->pad[2] + (f >> 32);
  444. h2 = (unsigned long)f;
  445. f = (unsigned long long)h3 + st->pad[3] + (f >> 32);
  446. h3 = (unsigned long)f;
  447. U32TO8(mac + 0, h0);
  448. U32TO8(mac + 4, h1);
  449. U32TO8(mac + 8, h2);
  450. U32TO8(mac + 12, h3);
  451. /* zero out the state */
  452. st->h[0] = 0;
  453. st->h[1] = 0;
  454. st->h[2] = 0;
  455. st->h[3] = 0;
  456. st->h[4] = 0;
  457. st->r[0] = 0;
  458. st->r[1] = 0;
  459. st->r[2] = 0;
  460. st->r[3] = 0;
  461. st->r[4] = 0;
  462. st->pad[0] = 0;
  463. st->pad[1] = 0;
  464. st->pad[2] = 0;
  465. st->pad[3] = 0;
  466. }
  467. //////////////////////////////////////////////////////////////////////////////
  468. #endif // MSC/GCC or not
  469. static inline void poly1305_update(poly1305_context* ctx, const unsigned char* m, size_t bytes)
  470. {
  471. poly1305_state_internal_t* st = (poly1305_state_internal_t*)ctx;
  472. size_t i;
  473. /* handle leftover */
  474. if (st->leftover) {
  475. size_t want = (poly1305_block_size - st->leftover);
  476. if (want > bytes) {
  477. want = bytes;
  478. }
  479. for (i = 0; i < want; i++) {
  480. st->buffer[st->leftover + i] = m[i];
  481. }
  482. bytes -= want;
  483. m += want;
  484. st->leftover += want;
  485. if (st->leftover < poly1305_block_size) {
  486. return;
  487. }
  488. poly1305_blocks(st, st->buffer, poly1305_block_size);
  489. st->leftover = 0;
  490. }
  491. /* process full blocks */
  492. if (bytes >= poly1305_block_size) {
  493. size_t want = (bytes & ~(poly1305_block_size - 1));
  494. poly1305_blocks(st, m, want);
  495. m += want;
  496. bytes -= want;
  497. }
  498. /* store leftover */
  499. if (bytes) {
  500. for (i = 0; i < bytes; i++) {
  501. st->buffer[st->leftover + i] = m[i];
  502. }
  503. st->leftover += bytes;
  504. }
  505. }
  506. } // anonymous namespace
  507. void Poly1305::compute(void* auth, const void* data, unsigned int len, const void* key)
  508. {
  509. poly1305_context ctx;
  510. poly1305_init(&ctx, reinterpret_cast<const unsigned char*>(key));
  511. poly1305_update(&ctx, reinterpret_cast<const unsigned char*>(data), (size_t)len);
  512. poly1305_finish(&ctx, reinterpret_cast<unsigned char*>(auth));
  513. }
  514. } // namespace ZeroTier