poly1305.c 17 KB

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