Poly1305.cpp 15 KB

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