poly1305.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492
  1. /**
  2. * \file poly1305.c
  3. *
  4. * \brief Poly1305 authentication algorithm.
  5. *
  6. * Copyright The Mbed TLS Contributors
  7. * SPDX-License-Identifier: Apache-2.0 OR GPL-2.0-or-later
  8. */
  9. #include "common.h"
  10. #if defined(MBEDTLS_POLY1305_C)
  11. #include "mbedtls/poly1305.h"
  12. #include "mbedtls/platform_util.h"
  13. #include "mbedtls/error.h"
  14. #include <string.h>
  15. #include "mbedtls/platform.h"
  16. #if !defined(MBEDTLS_POLY1305_ALT)
  17. #define POLY1305_BLOCK_SIZE_BYTES (16U)
  18. /*
  19. * Our implementation is tuned for 32-bit platforms with a 64-bit multiplier.
  20. * However we provided an alternative for platforms without such a multiplier.
  21. */
  22. #if defined(MBEDTLS_NO_64BIT_MULTIPLICATION)
  23. static uint64_t mul64(uint32_t a, uint32_t b)
  24. {
  25. /* a = al + 2**16 ah, b = bl + 2**16 bh */
  26. const uint16_t al = (uint16_t) a;
  27. const uint16_t bl = (uint16_t) b;
  28. const uint16_t ah = a >> 16;
  29. const uint16_t bh = b >> 16;
  30. /* ab = al*bl + 2**16 (ah*bl + bl*bh) + 2**32 ah*bh */
  31. const uint32_t lo = (uint32_t) al * bl;
  32. const uint64_t me = (uint64_t) ((uint32_t) ah * bl) + (uint32_t) al * bh;
  33. const uint32_t hi = (uint32_t) ah * bh;
  34. return lo + (me << 16) + ((uint64_t) hi << 32);
  35. }
  36. #else
  37. static inline uint64_t mul64(uint32_t a, uint32_t b)
  38. {
  39. return (uint64_t) a * b;
  40. }
  41. #endif
  42. /**
  43. * \brief Process blocks with Poly1305.
  44. *
  45. * \param ctx The Poly1305 context.
  46. * \param nblocks Number of blocks to process. Note that this
  47. * function only processes full blocks.
  48. * \param input Buffer containing the input block(s).
  49. * \param needs_padding Set to 0 if the padding bit has already been
  50. * applied to the input data before calling this
  51. * function. Otherwise, set this parameter to 1.
  52. */
  53. static void poly1305_process(mbedtls_poly1305_context *ctx,
  54. size_t nblocks,
  55. const unsigned char *input,
  56. uint32_t needs_padding)
  57. {
  58. uint64_t d0, d1, d2, d3;
  59. uint32_t acc0, acc1, acc2, acc3, acc4;
  60. uint32_t r0, r1, r2, r3;
  61. uint32_t rs1, rs2, rs3;
  62. size_t offset = 0U;
  63. size_t i;
  64. r0 = ctx->r[0];
  65. r1 = ctx->r[1];
  66. r2 = ctx->r[2];
  67. r3 = ctx->r[3];
  68. rs1 = r1 + (r1 >> 2U);
  69. rs2 = r2 + (r2 >> 2U);
  70. rs3 = r3 + (r3 >> 2U);
  71. acc0 = ctx->acc[0];
  72. acc1 = ctx->acc[1];
  73. acc2 = ctx->acc[2];
  74. acc3 = ctx->acc[3];
  75. acc4 = ctx->acc[4];
  76. /* Process full blocks */
  77. for (i = 0U; i < nblocks; i++) {
  78. /* The input block is treated as a 128-bit little-endian integer */
  79. d0 = MBEDTLS_GET_UINT32_LE(input, offset + 0);
  80. d1 = MBEDTLS_GET_UINT32_LE(input, offset + 4);
  81. d2 = MBEDTLS_GET_UINT32_LE(input, offset + 8);
  82. d3 = MBEDTLS_GET_UINT32_LE(input, offset + 12);
  83. /* Compute: acc += (padded) block as a 130-bit integer */
  84. d0 += (uint64_t) acc0;
  85. d1 += (uint64_t) acc1 + (d0 >> 32U);
  86. d2 += (uint64_t) acc2 + (d1 >> 32U);
  87. d3 += (uint64_t) acc3 + (d2 >> 32U);
  88. acc0 = (uint32_t) d0;
  89. acc1 = (uint32_t) d1;
  90. acc2 = (uint32_t) d2;
  91. acc3 = (uint32_t) d3;
  92. acc4 += (uint32_t) (d3 >> 32U) + needs_padding;
  93. /* Compute: acc *= r */
  94. d0 = mul64(acc0, r0) +
  95. mul64(acc1, rs3) +
  96. mul64(acc2, rs2) +
  97. mul64(acc3, rs1);
  98. d1 = mul64(acc0, r1) +
  99. mul64(acc1, r0) +
  100. mul64(acc2, rs3) +
  101. mul64(acc3, rs2) +
  102. mul64(acc4, rs1);
  103. d2 = mul64(acc0, r2) +
  104. mul64(acc1, r1) +
  105. mul64(acc2, r0) +
  106. mul64(acc3, rs3) +
  107. mul64(acc4, rs2);
  108. d3 = mul64(acc0, r3) +
  109. mul64(acc1, r2) +
  110. mul64(acc2, r1) +
  111. mul64(acc3, r0) +
  112. mul64(acc4, rs3);
  113. acc4 *= r0;
  114. /* Compute: acc %= (2^130 - 5) (partial remainder) */
  115. d1 += (d0 >> 32);
  116. d2 += (d1 >> 32);
  117. d3 += (d2 >> 32);
  118. acc0 = (uint32_t) d0;
  119. acc1 = (uint32_t) d1;
  120. acc2 = (uint32_t) d2;
  121. acc3 = (uint32_t) d3;
  122. acc4 = (uint32_t) (d3 >> 32) + acc4;
  123. d0 = (uint64_t) acc0 + (acc4 >> 2) + (acc4 & 0xFFFFFFFCU);
  124. acc4 &= 3U;
  125. acc0 = (uint32_t) d0;
  126. d0 = (uint64_t) acc1 + (d0 >> 32U);
  127. acc1 = (uint32_t) d0;
  128. d0 = (uint64_t) acc2 + (d0 >> 32U);
  129. acc2 = (uint32_t) d0;
  130. d0 = (uint64_t) acc3 + (d0 >> 32U);
  131. acc3 = (uint32_t) d0;
  132. d0 = (uint64_t) acc4 + (d0 >> 32U);
  133. acc4 = (uint32_t) d0;
  134. offset += POLY1305_BLOCK_SIZE_BYTES;
  135. }
  136. ctx->acc[0] = acc0;
  137. ctx->acc[1] = acc1;
  138. ctx->acc[2] = acc2;
  139. ctx->acc[3] = acc3;
  140. ctx->acc[4] = acc4;
  141. }
  142. /**
  143. * \brief Compute the Poly1305 MAC
  144. *
  145. * \param ctx The Poly1305 context.
  146. * \param mac The buffer to where the MAC is written. Must be
  147. * big enough to contain the 16-byte MAC.
  148. */
  149. static void poly1305_compute_mac(const mbedtls_poly1305_context *ctx,
  150. unsigned char mac[16])
  151. {
  152. uint64_t d;
  153. uint32_t g0, g1, g2, g3, g4;
  154. uint32_t acc0, acc1, acc2, acc3, acc4;
  155. uint32_t mask;
  156. uint32_t mask_inv;
  157. acc0 = ctx->acc[0];
  158. acc1 = ctx->acc[1];
  159. acc2 = ctx->acc[2];
  160. acc3 = ctx->acc[3];
  161. acc4 = ctx->acc[4];
  162. /* Before adding 's' we ensure that the accumulator is mod 2^130 - 5.
  163. * We do this by calculating acc - (2^130 - 5), then checking if
  164. * the 131st bit is set. If it is, then reduce: acc -= (2^130 - 5)
  165. */
  166. /* Calculate acc + -(2^130 - 5) */
  167. d = ((uint64_t) acc0 + 5U);
  168. g0 = (uint32_t) d;
  169. d = ((uint64_t) acc1 + (d >> 32));
  170. g1 = (uint32_t) d;
  171. d = ((uint64_t) acc2 + (d >> 32));
  172. g2 = (uint32_t) d;
  173. d = ((uint64_t) acc3 + (d >> 32));
  174. g3 = (uint32_t) d;
  175. g4 = acc4 + (uint32_t) (d >> 32U);
  176. /* mask == 0xFFFFFFFF if 131st bit is set, otherwise mask == 0 */
  177. mask = (uint32_t) 0U - (g4 >> 2U);
  178. mask_inv = ~mask;
  179. /* If 131st bit is set then acc=g, otherwise, acc is unmodified */
  180. acc0 = (acc0 & mask_inv) | (g0 & mask);
  181. acc1 = (acc1 & mask_inv) | (g1 & mask);
  182. acc2 = (acc2 & mask_inv) | (g2 & mask);
  183. acc3 = (acc3 & mask_inv) | (g3 & mask);
  184. /* Add 's' */
  185. d = (uint64_t) acc0 + ctx->s[0];
  186. acc0 = (uint32_t) d;
  187. d = (uint64_t) acc1 + ctx->s[1] + (d >> 32U);
  188. acc1 = (uint32_t) d;
  189. d = (uint64_t) acc2 + ctx->s[2] + (d >> 32U);
  190. acc2 = (uint32_t) d;
  191. acc3 += ctx->s[3] + (uint32_t) (d >> 32U);
  192. /* Compute MAC (128 least significant bits of the accumulator) */
  193. MBEDTLS_PUT_UINT32_LE(acc0, mac, 0);
  194. MBEDTLS_PUT_UINT32_LE(acc1, mac, 4);
  195. MBEDTLS_PUT_UINT32_LE(acc2, mac, 8);
  196. MBEDTLS_PUT_UINT32_LE(acc3, mac, 12);
  197. }
  198. void mbedtls_poly1305_init(mbedtls_poly1305_context *ctx)
  199. {
  200. mbedtls_platform_zeroize(ctx, sizeof(mbedtls_poly1305_context));
  201. }
  202. void mbedtls_poly1305_free(mbedtls_poly1305_context *ctx)
  203. {
  204. if (ctx == NULL) {
  205. return;
  206. }
  207. mbedtls_platform_zeroize(ctx, sizeof(mbedtls_poly1305_context));
  208. }
  209. int mbedtls_poly1305_starts(mbedtls_poly1305_context *ctx,
  210. const unsigned char key[32])
  211. {
  212. /* r &= 0x0ffffffc0ffffffc0ffffffc0fffffff */
  213. ctx->r[0] = MBEDTLS_GET_UINT32_LE(key, 0) & 0x0FFFFFFFU;
  214. ctx->r[1] = MBEDTLS_GET_UINT32_LE(key, 4) & 0x0FFFFFFCU;
  215. ctx->r[2] = MBEDTLS_GET_UINT32_LE(key, 8) & 0x0FFFFFFCU;
  216. ctx->r[3] = MBEDTLS_GET_UINT32_LE(key, 12) & 0x0FFFFFFCU;
  217. ctx->s[0] = MBEDTLS_GET_UINT32_LE(key, 16);
  218. ctx->s[1] = MBEDTLS_GET_UINT32_LE(key, 20);
  219. ctx->s[2] = MBEDTLS_GET_UINT32_LE(key, 24);
  220. ctx->s[3] = MBEDTLS_GET_UINT32_LE(key, 28);
  221. /* Initial accumulator state */
  222. ctx->acc[0] = 0U;
  223. ctx->acc[1] = 0U;
  224. ctx->acc[2] = 0U;
  225. ctx->acc[3] = 0U;
  226. ctx->acc[4] = 0U;
  227. /* Queue initially empty */
  228. mbedtls_platform_zeroize(ctx->queue, sizeof(ctx->queue));
  229. ctx->queue_len = 0U;
  230. return 0;
  231. }
  232. int mbedtls_poly1305_update(mbedtls_poly1305_context *ctx,
  233. const unsigned char *input,
  234. size_t ilen)
  235. {
  236. size_t offset = 0U;
  237. size_t remaining = ilen;
  238. size_t queue_free_len;
  239. size_t nblocks;
  240. if ((remaining > 0U) && (ctx->queue_len > 0U)) {
  241. queue_free_len = (POLY1305_BLOCK_SIZE_BYTES - ctx->queue_len);
  242. if (ilen < queue_free_len) {
  243. /* Not enough data to complete the block.
  244. * Store this data with the other leftovers.
  245. */
  246. memcpy(&ctx->queue[ctx->queue_len],
  247. input,
  248. ilen);
  249. ctx->queue_len += ilen;
  250. remaining = 0U;
  251. } else {
  252. /* Enough data to produce a complete block */
  253. memcpy(&ctx->queue[ctx->queue_len],
  254. input,
  255. queue_free_len);
  256. ctx->queue_len = 0U;
  257. poly1305_process(ctx, 1U, ctx->queue, 1U); /* add padding bit */
  258. offset += queue_free_len;
  259. remaining -= queue_free_len;
  260. }
  261. }
  262. if (remaining >= POLY1305_BLOCK_SIZE_BYTES) {
  263. nblocks = remaining / POLY1305_BLOCK_SIZE_BYTES;
  264. poly1305_process(ctx, nblocks, &input[offset], 1U);
  265. offset += nblocks * POLY1305_BLOCK_SIZE_BYTES;
  266. remaining %= POLY1305_BLOCK_SIZE_BYTES;
  267. }
  268. if (remaining > 0U) {
  269. /* Store partial block */
  270. ctx->queue_len = remaining;
  271. memcpy(ctx->queue, &input[offset], remaining);
  272. }
  273. return 0;
  274. }
  275. int mbedtls_poly1305_finish(mbedtls_poly1305_context *ctx,
  276. unsigned char mac[16])
  277. {
  278. /* Process any leftover data */
  279. if (ctx->queue_len > 0U) {
  280. /* Add padding bit */
  281. ctx->queue[ctx->queue_len] = 1U;
  282. ctx->queue_len++;
  283. /* Pad with zeroes */
  284. memset(&ctx->queue[ctx->queue_len],
  285. 0,
  286. POLY1305_BLOCK_SIZE_BYTES - ctx->queue_len);
  287. poly1305_process(ctx, 1U, /* Process 1 block */
  288. ctx->queue, 0U); /* Already padded above */
  289. }
  290. poly1305_compute_mac(ctx, mac);
  291. return 0;
  292. }
  293. int mbedtls_poly1305_mac(const unsigned char key[32],
  294. const unsigned char *input,
  295. size_t ilen,
  296. unsigned char mac[16])
  297. {
  298. mbedtls_poly1305_context ctx;
  299. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  300. mbedtls_poly1305_init(&ctx);
  301. ret = mbedtls_poly1305_starts(&ctx, key);
  302. if (ret != 0) {
  303. goto cleanup;
  304. }
  305. ret = mbedtls_poly1305_update(&ctx, input, ilen);
  306. if (ret != 0) {
  307. goto cleanup;
  308. }
  309. ret = mbedtls_poly1305_finish(&ctx, mac);
  310. cleanup:
  311. mbedtls_poly1305_free(&ctx);
  312. return ret;
  313. }
  314. #endif /* MBEDTLS_POLY1305_ALT */
  315. #if defined(MBEDTLS_SELF_TEST)
  316. static const unsigned char test_keys[2][32] =
  317. {
  318. {
  319. 0x85, 0xd6, 0xbe, 0x78, 0x57, 0x55, 0x6d, 0x33,
  320. 0x7f, 0x44, 0x52, 0xfe, 0x42, 0xd5, 0x06, 0xa8,
  321. 0x01, 0x03, 0x80, 0x8a, 0xfb, 0x0d, 0xb2, 0xfd,
  322. 0x4a, 0xbf, 0xf6, 0xaf, 0x41, 0x49, 0xf5, 0x1b
  323. },
  324. {
  325. 0x1c, 0x92, 0x40, 0xa5, 0xeb, 0x55, 0xd3, 0x8a,
  326. 0xf3, 0x33, 0x88, 0x86, 0x04, 0xf6, 0xb5, 0xf0,
  327. 0x47, 0x39, 0x17, 0xc1, 0x40, 0x2b, 0x80, 0x09,
  328. 0x9d, 0xca, 0x5c, 0xbc, 0x20, 0x70, 0x75, 0xc0
  329. }
  330. };
  331. static const unsigned char test_data[2][127] =
  332. {
  333. {
  334. 0x43, 0x72, 0x79, 0x70, 0x74, 0x6f, 0x67, 0x72,
  335. 0x61, 0x70, 0x68, 0x69, 0x63, 0x20, 0x46, 0x6f,
  336. 0x72, 0x75, 0x6d, 0x20, 0x52, 0x65, 0x73, 0x65,
  337. 0x61, 0x72, 0x63, 0x68, 0x20, 0x47, 0x72, 0x6f,
  338. 0x75, 0x70
  339. },
  340. {
  341. 0x27, 0x54, 0x77, 0x61, 0x73, 0x20, 0x62, 0x72,
  342. 0x69, 0x6c, 0x6c, 0x69, 0x67, 0x2c, 0x20, 0x61,
  343. 0x6e, 0x64, 0x20, 0x74, 0x68, 0x65, 0x20, 0x73,
  344. 0x6c, 0x69, 0x74, 0x68, 0x79, 0x20, 0x74, 0x6f,
  345. 0x76, 0x65, 0x73, 0x0a, 0x44, 0x69, 0x64, 0x20,
  346. 0x67, 0x79, 0x72, 0x65, 0x20, 0x61, 0x6e, 0x64,
  347. 0x20, 0x67, 0x69, 0x6d, 0x62, 0x6c, 0x65, 0x20,
  348. 0x69, 0x6e, 0x20, 0x74, 0x68, 0x65, 0x20, 0x77,
  349. 0x61, 0x62, 0x65, 0x3a, 0x0a, 0x41, 0x6c, 0x6c,
  350. 0x20, 0x6d, 0x69, 0x6d, 0x73, 0x79, 0x20, 0x77,
  351. 0x65, 0x72, 0x65, 0x20, 0x74, 0x68, 0x65, 0x20,
  352. 0x62, 0x6f, 0x72, 0x6f, 0x67, 0x6f, 0x76, 0x65,
  353. 0x73, 0x2c, 0x0a, 0x41, 0x6e, 0x64, 0x20, 0x74,
  354. 0x68, 0x65, 0x20, 0x6d, 0x6f, 0x6d, 0x65, 0x20,
  355. 0x72, 0x61, 0x74, 0x68, 0x73, 0x20, 0x6f, 0x75,
  356. 0x74, 0x67, 0x72, 0x61, 0x62, 0x65, 0x2e
  357. }
  358. };
  359. static const size_t test_data_len[2] =
  360. {
  361. 34U,
  362. 127U
  363. };
  364. static const unsigned char test_mac[2][16] =
  365. {
  366. {
  367. 0xa8, 0x06, 0x1d, 0xc1, 0x30, 0x51, 0x36, 0xc6,
  368. 0xc2, 0x2b, 0x8b, 0xaf, 0x0c, 0x01, 0x27, 0xa9
  369. },
  370. {
  371. 0x45, 0x41, 0x66, 0x9a, 0x7e, 0xaa, 0xee, 0x61,
  372. 0xe7, 0x08, 0xdc, 0x7c, 0xbc, 0xc5, 0xeb, 0x62
  373. }
  374. };
  375. /* Make sure no other definition is already present. */
  376. #undef ASSERT
  377. #define ASSERT(cond, args) \
  378. do \
  379. { \
  380. if (!(cond)) \
  381. { \
  382. if (verbose != 0) \
  383. mbedtls_printf args; \
  384. \
  385. return -1; \
  386. } \
  387. } \
  388. while (0)
  389. int mbedtls_poly1305_self_test(int verbose)
  390. {
  391. unsigned char mac[16];
  392. unsigned i;
  393. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  394. for (i = 0U; i < 2U; i++) {
  395. if (verbose != 0) {
  396. mbedtls_printf(" Poly1305 test %u ", i);
  397. }
  398. ret = mbedtls_poly1305_mac(test_keys[i],
  399. test_data[i],
  400. test_data_len[i],
  401. mac);
  402. ASSERT(0 == ret, ("error code: %i\n", ret));
  403. ASSERT(0 == memcmp(mac, test_mac[i], 16U), ("failed (mac)\n"));
  404. if (verbose != 0) {
  405. mbedtls_printf("passed\n");
  406. }
  407. }
  408. if (verbose != 0) {
  409. mbedtls_printf("\n");
  410. }
  411. return 0;
  412. }
  413. #endif /* MBEDTLS_SELF_TEST */
  414. #endif /* MBEDTLS_POLY1305_C */