poly1305.c 17 KB

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