gcm.c 31 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994
  1. /*
  2. * NIST SP800-38D compliant GCM implementation
  3. *
  4. * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
  5. * SPDX-License-Identifier: Apache-2.0
  6. *
  7. * Licensed under the Apache License, Version 2.0 (the "License"); you may
  8. * not use this file except in compliance with the License.
  9. * You may obtain a copy of the License at
  10. *
  11. * http://www.apache.org/licenses/LICENSE-2.0
  12. *
  13. * Unless required by applicable law or agreed to in writing, software
  14. * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
  15. * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  16. * See the License for the specific language governing permissions and
  17. * limitations under the License.
  18. *
  19. * This file is part of mbed TLS (https://tls.mbed.org)
  20. */
  21. /*
  22. * http://csrc.nist.gov/publications/nistpubs/800-38D/SP-800-38D.pdf
  23. *
  24. * See also:
  25. * [MGV] http://csrc.nist.gov/groups/ST/toolkit/BCM/documents/proposedmodes/gcm/gcm-revised-spec.pdf
  26. *
  27. * We use the algorithm described as Shoup's method with 4-bit tables in
  28. * [MGV] 4.1, pp. 12-13, to enhance speed without using too much memory.
  29. */
  30. #if !defined(MBEDTLS_CONFIG_FILE)
  31. #include "mbedtls/config.h"
  32. #else
  33. #include MBEDTLS_CONFIG_FILE
  34. #endif
  35. #if defined(MBEDTLS_GCM_C)
  36. #include "mbedtls/gcm.h"
  37. #include "mbedtls/platform_util.h"
  38. #include <string.h>
  39. #if defined(MBEDTLS_AESNI_C)
  40. #include "mbedtls/aesni.h"
  41. #endif
  42. #if defined(MBEDTLS_SELF_TEST) && defined(MBEDTLS_AES_C)
  43. #include "mbedtls/aes.h"
  44. #include "mbedtls/platform.h"
  45. #if !defined(MBEDTLS_PLATFORM_C)
  46. #include <stdio.h>
  47. #define mbedtls_printf printf
  48. #endif /* MBEDTLS_PLATFORM_C */
  49. #endif /* MBEDTLS_SELF_TEST && MBEDTLS_AES_C */
  50. #if !defined(MBEDTLS_GCM_ALT)
  51. /* Parameter validation macros */
  52. #define GCM_VALIDATE_RET( cond ) \
  53. MBEDTLS_INTERNAL_VALIDATE_RET( cond, MBEDTLS_ERR_GCM_BAD_INPUT )
  54. #define GCM_VALIDATE( cond ) \
  55. MBEDTLS_INTERNAL_VALIDATE( cond )
  56. /*
  57. * 32-bit integer manipulation macros (big endian)
  58. */
  59. #ifndef GET_UINT32_BE
  60. #define GET_UINT32_BE(n,b,i) \
  61. { \
  62. (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
  63. | ( (uint32_t) (b)[(i) + 1] << 16 ) \
  64. | ( (uint32_t) (b)[(i) + 2] << 8 ) \
  65. | ( (uint32_t) (b)[(i) + 3] ); \
  66. }
  67. #endif
  68. #ifndef PUT_UINT32_BE
  69. #define PUT_UINT32_BE(n,b,i) \
  70. { \
  71. (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
  72. (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
  73. (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
  74. (b)[(i) + 3] = (unsigned char) ( (n) ); \
  75. }
  76. #endif
  77. /*
  78. * Initialize a context
  79. */
  80. void mbedtls_gcm_init( mbedtls_gcm_context *ctx )
  81. {
  82. GCM_VALIDATE( ctx != NULL );
  83. memset( ctx, 0, sizeof( mbedtls_gcm_context ) );
  84. }
  85. /*
  86. * Precompute small multiples of H, that is set
  87. * HH[i] || HL[i] = H times i,
  88. * where i is seen as a field element as in [MGV], ie high-order bits
  89. * correspond to low powers of P. The result is stored in the same way, that
  90. * is the high-order bit of HH corresponds to P^0 and the low-order bit of HL
  91. * corresponds to P^127.
  92. */
  93. static int gcm_gen_table( mbedtls_gcm_context *ctx )
  94. {
  95. int ret, i, j;
  96. uint64_t hi, lo;
  97. uint64_t vl, vh;
  98. unsigned char h[16];
  99. size_t olen = 0;
  100. memset( h, 0, 16 );
  101. if( ( ret = mbedtls_cipher_update( &ctx->cipher_ctx, h, 16, h, &olen ) ) != 0 )
  102. return( ret );
  103. /* pack h as two 64-bits ints, big-endian */
  104. GET_UINT32_BE( hi, h, 0 );
  105. GET_UINT32_BE( lo, h, 4 );
  106. vh = (uint64_t) hi << 32 | lo;
  107. GET_UINT32_BE( hi, h, 8 );
  108. GET_UINT32_BE( lo, h, 12 );
  109. vl = (uint64_t) hi << 32 | lo;
  110. /* 8 = 1000 corresponds to 1 in GF(2^128) */
  111. ctx->HL[8] = vl;
  112. ctx->HH[8] = vh;
  113. #if defined(MBEDTLS_AESNI_C) && defined(MBEDTLS_HAVE_X86_64)
  114. /* With CLMUL support, we need only h, not the rest of the table */
  115. if( mbedtls_aesni_has_support( MBEDTLS_AESNI_CLMUL ) )
  116. return( 0 );
  117. #endif
  118. /* 0 corresponds to 0 in GF(2^128) */
  119. ctx->HH[0] = 0;
  120. ctx->HL[0] = 0;
  121. for( i = 4; i > 0; i >>= 1 )
  122. {
  123. uint32_t T = ( vl & 1 ) * 0xe1000000U;
  124. vl = ( vh << 63 ) | ( vl >> 1 );
  125. vh = ( vh >> 1 ) ^ ( (uint64_t) T << 32);
  126. ctx->HL[i] = vl;
  127. ctx->HH[i] = vh;
  128. }
  129. for( i = 2; i <= 8; i *= 2 )
  130. {
  131. uint64_t *HiL = ctx->HL + i, *HiH = ctx->HH + i;
  132. vh = *HiH;
  133. vl = *HiL;
  134. for( j = 1; j < i; j++ )
  135. {
  136. HiH[j] = vh ^ ctx->HH[j];
  137. HiL[j] = vl ^ ctx->HL[j];
  138. }
  139. }
  140. return( 0 );
  141. }
  142. int mbedtls_gcm_setkey( mbedtls_gcm_context *ctx,
  143. mbedtls_cipher_id_t cipher,
  144. const unsigned char *key,
  145. unsigned int keybits )
  146. {
  147. int ret;
  148. const mbedtls_cipher_info_t *cipher_info;
  149. GCM_VALIDATE_RET( ctx != NULL );
  150. GCM_VALIDATE_RET( key != NULL );
  151. GCM_VALIDATE_RET( keybits == 128 || keybits == 192 || keybits == 256 );
  152. cipher_info = mbedtls_cipher_info_from_values( cipher, keybits, MBEDTLS_MODE_ECB );
  153. if( cipher_info == NULL )
  154. return( MBEDTLS_ERR_GCM_BAD_INPUT );
  155. if( cipher_info->block_size != 16 )
  156. return( MBEDTLS_ERR_GCM_BAD_INPUT );
  157. mbedtls_cipher_free( &ctx->cipher_ctx );
  158. if( ( ret = mbedtls_cipher_setup( &ctx->cipher_ctx, cipher_info ) ) != 0 )
  159. return( ret );
  160. if( ( ret = mbedtls_cipher_setkey( &ctx->cipher_ctx, key, keybits,
  161. MBEDTLS_ENCRYPT ) ) != 0 )
  162. {
  163. return( ret );
  164. }
  165. if( ( ret = gcm_gen_table( ctx ) ) != 0 )
  166. return( ret );
  167. return( 0 );
  168. }
  169. /*
  170. * Shoup's method for multiplication use this table with
  171. * last4[x] = x times P^128
  172. * where x and last4[x] are seen as elements of GF(2^128) as in [MGV]
  173. */
  174. static const uint64_t last4[16] =
  175. {
  176. 0x0000, 0x1c20, 0x3840, 0x2460,
  177. 0x7080, 0x6ca0, 0x48c0, 0x54e0,
  178. 0xe100, 0xfd20, 0xd940, 0xc560,
  179. 0x9180, 0x8da0, 0xa9c0, 0xb5e0
  180. };
  181. /*
  182. * Sets output to x times H using the precomputed tables.
  183. * x and output are seen as elements of GF(2^128) as in [MGV].
  184. */
  185. static void gcm_mult( mbedtls_gcm_context *ctx, const unsigned char x[16],
  186. unsigned char output[16] )
  187. {
  188. int i = 0;
  189. unsigned char lo, hi, rem;
  190. uint64_t zh, zl;
  191. #if defined(MBEDTLS_AESNI_C) && defined(MBEDTLS_HAVE_X86_64)
  192. if( mbedtls_aesni_has_support( MBEDTLS_AESNI_CLMUL ) ) {
  193. unsigned char h[16];
  194. PUT_UINT32_BE( ctx->HH[8] >> 32, h, 0 );
  195. PUT_UINT32_BE( ctx->HH[8], h, 4 );
  196. PUT_UINT32_BE( ctx->HL[8] >> 32, h, 8 );
  197. PUT_UINT32_BE( ctx->HL[8], h, 12 );
  198. mbedtls_aesni_gcm_mult( output, x, h );
  199. return;
  200. }
  201. #endif /* MBEDTLS_AESNI_C && MBEDTLS_HAVE_X86_64 */
  202. lo = x[15] & 0xf;
  203. zh = ctx->HH[lo];
  204. zl = ctx->HL[lo];
  205. for( i = 15; i >= 0; i-- )
  206. {
  207. lo = x[i] & 0xf;
  208. hi = x[i] >> 4;
  209. if( i != 15 )
  210. {
  211. rem = (unsigned char) zl & 0xf;
  212. zl = ( zh << 60 ) | ( zl >> 4 );
  213. zh = ( zh >> 4 );
  214. zh ^= (uint64_t) last4[rem] << 48;
  215. zh ^= ctx->HH[lo];
  216. zl ^= ctx->HL[lo];
  217. }
  218. rem = (unsigned char) zl & 0xf;
  219. zl = ( zh << 60 ) | ( zl >> 4 );
  220. zh = ( zh >> 4 );
  221. zh ^= (uint64_t) last4[rem] << 48;
  222. zh ^= ctx->HH[hi];
  223. zl ^= ctx->HL[hi];
  224. }
  225. PUT_UINT32_BE( zh >> 32, output, 0 );
  226. PUT_UINT32_BE( zh, output, 4 );
  227. PUT_UINT32_BE( zl >> 32, output, 8 );
  228. PUT_UINT32_BE( zl, output, 12 );
  229. }
  230. int mbedtls_gcm_starts( mbedtls_gcm_context *ctx,
  231. int mode,
  232. const unsigned char *iv,
  233. size_t iv_len,
  234. const unsigned char *add,
  235. size_t add_len )
  236. {
  237. int ret;
  238. unsigned char work_buf[16];
  239. size_t i;
  240. const unsigned char *p;
  241. size_t use_len, olen = 0;
  242. GCM_VALIDATE_RET( ctx != NULL );
  243. GCM_VALIDATE_RET( iv != NULL );
  244. GCM_VALIDATE_RET( add_len == 0 || add != NULL );
  245. /* IV and AD are limited to 2^64 bits, so 2^61 bytes */
  246. /* IV is not allowed to be zero length */
  247. if( iv_len == 0 ||
  248. ( (uint64_t) iv_len ) >> 61 != 0 ||
  249. ( (uint64_t) add_len ) >> 61 != 0 )
  250. {
  251. return( MBEDTLS_ERR_GCM_BAD_INPUT );
  252. }
  253. memset( ctx->y, 0x00, sizeof(ctx->y) );
  254. memset( ctx->buf, 0x00, sizeof(ctx->buf) );
  255. ctx->mode = mode;
  256. ctx->len = 0;
  257. ctx->add_len = 0;
  258. if( iv_len == 12 )
  259. {
  260. memcpy( ctx->y, iv, iv_len );
  261. ctx->y[15] = 1;
  262. }
  263. else
  264. {
  265. memset( work_buf, 0x00, 16 );
  266. PUT_UINT32_BE( iv_len * 8, work_buf, 12 );
  267. p = iv;
  268. while( iv_len > 0 )
  269. {
  270. use_len = ( iv_len < 16 ) ? iv_len : 16;
  271. for( i = 0; i < use_len; i++ )
  272. ctx->y[i] ^= p[i];
  273. gcm_mult( ctx, ctx->y, ctx->y );
  274. iv_len -= use_len;
  275. p += use_len;
  276. }
  277. for( i = 0; i < 16; i++ )
  278. ctx->y[i] ^= work_buf[i];
  279. gcm_mult( ctx, ctx->y, ctx->y );
  280. }
  281. if( ( ret = mbedtls_cipher_update( &ctx->cipher_ctx, ctx->y, 16, ctx->base_ectr,
  282. &olen ) ) != 0 )
  283. {
  284. return( ret );
  285. }
  286. ctx->add_len = add_len;
  287. p = add;
  288. while( add_len > 0 )
  289. {
  290. use_len = ( add_len < 16 ) ? add_len : 16;
  291. for( i = 0; i < use_len; i++ )
  292. ctx->buf[i] ^= p[i];
  293. gcm_mult( ctx, ctx->buf, ctx->buf );
  294. add_len -= use_len;
  295. p += use_len;
  296. }
  297. return( 0 );
  298. }
  299. int mbedtls_gcm_update( mbedtls_gcm_context *ctx,
  300. size_t length,
  301. const unsigned char *input,
  302. unsigned char *output )
  303. {
  304. int ret;
  305. unsigned char ectr[16];
  306. size_t i;
  307. const unsigned char *p;
  308. unsigned char *out_p = output;
  309. size_t use_len, olen = 0;
  310. GCM_VALIDATE_RET( ctx != NULL );
  311. GCM_VALIDATE_RET( length == 0 || input != NULL );
  312. GCM_VALIDATE_RET( length == 0 || output != NULL );
  313. if( output > input && (size_t) ( output - input ) < length )
  314. return( MBEDTLS_ERR_GCM_BAD_INPUT );
  315. /* Total length is restricted to 2^39 - 256 bits, ie 2^36 - 2^5 bytes
  316. * Also check for possible overflow */
  317. if( ctx->len + length < ctx->len ||
  318. (uint64_t) ctx->len + length > 0xFFFFFFFE0ull )
  319. {
  320. return( MBEDTLS_ERR_GCM_BAD_INPUT );
  321. }
  322. ctx->len += length;
  323. p = input;
  324. while( length > 0 )
  325. {
  326. use_len = ( length < 16 ) ? length : 16;
  327. for( i = 16; i > 12; i-- )
  328. if( ++ctx->y[i - 1] != 0 )
  329. break;
  330. if( ( ret = mbedtls_cipher_update( &ctx->cipher_ctx, ctx->y, 16, ectr,
  331. &olen ) ) != 0 )
  332. {
  333. return( ret );
  334. }
  335. for( i = 0; i < use_len; i++ )
  336. {
  337. if( ctx->mode == MBEDTLS_GCM_DECRYPT )
  338. ctx->buf[i] ^= p[i];
  339. out_p[i] = ectr[i] ^ p[i];
  340. if( ctx->mode == MBEDTLS_GCM_ENCRYPT )
  341. ctx->buf[i] ^= out_p[i];
  342. }
  343. gcm_mult( ctx, ctx->buf, ctx->buf );
  344. length -= use_len;
  345. p += use_len;
  346. out_p += use_len;
  347. }
  348. return( 0 );
  349. }
  350. int mbedtls_gcm_finish( mbedtls_gcm_context *ctx,
  351. unsigned char *tag,
  352. size_t tag_len )
  353. {
  354. unsigned char work_buf[16];
  355. size_t i;
  356. uint64_t orig_len;
  357. uint64_t orig_add_len;
  358. GCM_VALIDATE_RET( ctx != NULL );
  359. GCM_VALIDATE_RET( tag != NULL );
  360. orig_len = ctx->len * 8;
  361. orig_add_len = ctx->add_len * 8;
  362. if( tag_len > 16 || tag_len < 4 )
  363. return( MBEDTLS_ERR_GCM_BAD_INPUT );
  364. memcpy( tag, ctx->base_ectr, tag_len );
  365. if( orig_len || orig_add_len )
  366. {
  367. memset( work_buf, 0x00, 16 );
  368. PUT_UINT32_BE( ( orig_add_len >> 32 ), work_buf, 0 );
  369. PUT_UINT32_BE( ( orig_add_len ), work_buf, 4 );
  370. PUT_UINT32_BE( ( orig_len >> 32 ), work_buf, 8 );
  371. PUT_UINT32_BE( ( orig_len ), work_buf, 12 );
  372. for( i = 0; i < 16; i++ )
  373. ctx->buf[i] ^= work_buf[i];
  374. gcm_mult( ctx, ctx->buf, ctx->buf );
  375. for( i = 0; i < tag_len; i++ )
  376. tag[i] ^= ctx->buf[i];
  377. }
  378. return( 0 );
  379. }
  380. int mbedtls_gcm_crypt_and_tag( mbedtls_gcm_context *ctx,
  381. int mode,
  382. size_t length,
  383. const unsigned char *iv,
  384. size_t iv_len,
  385. const unsigned char *add,
  386. size_t add_len,
  387. const unsigned char *input,
  388. unsigned char *output,
  389. size_t tag_len,
  390. unsigned char *tag )
  391. {
  392. int ret;
  393. GCM_VALIDATE_RET( ctx != NULL );
  394. GCM_VALIDATE_RET( iv != NULL );
  395. GCM_VALIDATE_RET( add_len == 0 || add != NULL );
  396. GCM_VALIDATE_RET( length == 0 || input != NULL );
  397. GCM_VALIDATE_RET( length == 0 || output != NULL );
  398. GCM_VALIDATE_RET( tag != NULL );
  399. if( ( ret = mbedtls_gcm_starts( ctx, mode, iv, iv_len, add, add_len ) ) != 0 )
  400. return( ret );
  401. if( ( ret = mbedtls_gcm_update( ctx, length, input, output ) ) != 0 )
  402. return( ret );
  403. if( ( ret = mbedtls_gcm_finish( ctx, tag, tag_len ) ) != 0 )
  404. return( ret );
  405. return( 0 );
  406. }
  407. int mbedtls_gcm_auth_decrypt( mbedtls_gcm_context *ctx,
  408. size_t length,
  409. const unsigned char *iv,
  410. size_t iv_len,
  411. const unsigned char *add,
  412. size_t add_len,
  413. const unsigned char *tag,
  414. size_t tag_len,
  415. const unsigned char *input,
  416. unsigned char *output )
  417. {
  418. int ret;
  419. unsigned char check_tag[16];
  420. size_t i;
  421. int diff;
  422. GCM_VALIDATE_RET( ctx != NULL );
  423. GCM_VALIDATE_RET( iv != NULL );
  424. GCM_VALIDATE_RET( add_len == 0 || add != NULL );
  425. GCM_VALIDATE_RET( tag != NULL );
  426. GCM_VALIDATE_RET( length == 0 || input != NULL );
  427. GCM_VALIDATE_RET( length == 0 || output != NULL );
  428. if( ( ret = mbedtls_gcm_crypt_and_tag( ctx, MBEDTLS_GCM_DECRYPT, length,
  429. iv, iv_len, add, add_len,
  430. input, output, tag_len, check_tag ) ) != 0 )
  431. {
  432. return( ret );
  433. }
  434. /* Check tag in "constant-time" */
  435. for( diff = 0, i = 0; i < tag_len; i++ )
  436. diff |= tag[i] ^ check_tag[i];
  437. if( diff != 0 )
  438. {
  439. mbedtls_platform_zeroize( output, length );
  440. return( MBEDTLS_ERR_GCM_AUTH_FAILED );
  441. }
  442. return( 0 );
  443. }
  444. void mbedtls_gcm_free( mbedtls_gcm_context *ctx )
  445. {
  446. if( ctx == NULL )
  447. return;
  448. mbedtls_cipher_free( &ctx->cipher_ctx );
  449. mbedtls_platform_zeroize( ctx, sizeof( mbedtls_gcm_context ) );
  450. }
  451. #endif /* !MBEDTLS_GCM_ALT */
  452. #if defined(MBEDTLS_SELF_TEST) && defined(MBEDTLS_AES_C)
  453. /*
  454. * AES-GCM test vectors from:
  455. *
  456. * http://csrc.nist.gov/groups/STM/cavp/documents/mac/gcmtestvectors.zip
  457. */
  458. #define MAX_TESTS 6
  459. static const int key_index[MAX_TESTS] =
  460. { 0, 0, 1, 1, 1, 1 };
  461. static const unsigned char key[MAX_TESTS][32] =
  462. {
  463. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  464. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  465. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  466. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
  467. { 0xfe, 0xff, 0xe9, 0x92, 0x86, 0x65, 0x73, 0x1c,
  468. 0x6d, 0x6a, 0x8f, 0x94, 0x67, 0x30, 0x83, 0x08,
  469. 0xfe, 0xff, 0xe9, 0x92, 0x86, 0x65, 0x73, 0x1c,
  470. 0x6d, 0x6a, 0x8f, 0x94, 0x67, 0x30, 0x83, 0x08 },
  471. };
  472. static const size_t iv_len[MAX_TESTS] =
  473. { 12, 12, 12, 12, 8, 60 };
  474. static const int iv_index[MAX_TESTS] =
  475. { 0, 0, 1, 1, 1, 2 };
  476. static const unsigned char iv[MAX_TESTS][64] =
  477. {
  478. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  479. 0x00, 0x00, 0x00, 0x00 },
  480. { 0xca, 0xfe, 0xba, 0xbe, 0xfa, 0xce, 0xdb, 0xad,
  481. 0xde, 0xca, 0xf8, 0x88 },
  482. { 0x93, 0x13, 0x22, 0x5d, 0xf8, 0x84, 0x06, 0xe5,
  483. 0x55, 0x90, 0x9c, 0x5a, 0xff, 0x52, 0x69, 0xaa,
  484. 0x6a, 0x7a, 0x95, 0x38, 0x53, 0x4f, 0x7d, 0xa1,
  485. 0xe4, 0xc3, 0x03, 0xd2, 0xa3, 0x18, 0xa7, 0x28,
  486. 0xc3, 0xc0, 0xc9, 0x51, 0x56, 0x80, 0x95, 0x39,
  487. 0xfc, 0xf0, 0xe2, 0x42, 0x9a, 0x6b, 0x52, 0x54,
  488. 0x16, 0xae, 0xdb, 0xf5, 0xa0, 0xde, 0x6a, 0x57,
  489. 0xa6, 0x37, 0xb3, 0x9b },
  490. };
  491. static const size_t add_len[MAX_TESTS] =
  492. { 0, 0, 0, 20, 20, 20 };
  493. static const int add_index[MAX_TESTS] =
  494. { 0, 0, 0, 1, 1, 1 };
  495. static const unsigned char additional[MAX_TESTS][64] =
  496. {
  497. { 0x00 },
  498. { 0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef,
  499. 0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef,
  500. 0xab, 0xad, 0xda, 0xd2 },
  501. };
  502. static const size_t pt_len[MAX_TESTS] =
  503. { 0, 16, 64, 60, 60, 60 };
  504. static const int pt_index[MAX_TESTS] =
  505. { 0, 0, 1, 1, 1, 1 };
  506. static const unsigned char pt[MAX_TESTS][64] =
  507. {
  508. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  509. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
  510. { 0xd9, 0x31, 0x32, 0x25, 0xf8, 0x84, 0x06, 0xe5,
  511. 0xa5, 0x59, 0x09, 0xc5, 0xaf, 0xf5, 0x26, 0x9a,
  512. 0x86, 0xa7, 0xa9, 0x53, 0x15, 0x34, 0xf7, 0xda,
  513. 0x2e, 0x4c, 0x30, 0x3d, 0x8a, 0x31, 0x8a, 0x72,
  514. 0x1c, 0x3c, 0x0c, 0x95, 0x95, 0x68, 0x09, 0x53,
  515. 0x2f, 0xcf, 0x0e, 0x24, 0x49, 0xa6, 0xb5, 0x25,
  516. 0xb1, 0x6a, 0xed, 0xf5, 0xaa, 0x0d, 0xe6, 0x57,
  517. 0xba, 0x63, 0x7b, 0x39, 0x1a, 0xaf, 0xd2, 0x55 },
  518. };
  519. static const unsigned char ct[MAX_TESTS * 3][64] =
  520. {
  521. { 0x00 },
  522. { 0x03, 0x88, 0xda, 0xce, 0x60, 0xb6, 0xa3, 0x92,
  523. 0xf3, 0x28, 0xc2, 0xb9, 0x71, 0xb2, 0xfe, 0x78 },
  524. { 0x42, 0x83, 0x1e, 0xc2, 0x21, 0x77, 0x74, 0x24,
  525. 0x4b, 0x72, 0x21, 0xb7, 0x84, 0xd0, 0xd4, 0x9c,
  526. 0xe3, 0xaa, 0x21, 0x2f, 0x2c, 0x02, 0xa4, 0xe0,
  527. 0x35, 0xc1, 0x7e, 0x23, 0x29, 0xac, 0xa1, 0x2e,
  528. 0x21, 0xd5, 0x14, 0xb2, 0x54, 0x66, 0x93, 0x1c,
  529. 0x7d, 0x8f, 0x6a, 0x5a, 0xac, 0x84, 0xaa, 0x05,
  530. 0x1b, 0xa3, 0x0b, 0x39, 0x6a, 0x0a, 0xac, 0x97,
  531. 0x3d, 0x58, 0xe0, 0x91, 0x47, 0x3f, 0x59, 0x85 },
  532. { 0x42, 0x83, 0x1e, 0xc2, 0x21, 0x77, 0x74, 0x24,
  533. 0x4b, 0x72, 0x21, 0xb7, 0x84, 0xd0, 0xd4, 0x9c,
  534. 0xe3, 0xaa, 0x21, 0x2f, 0x2c, 0x02, 0xa4, 0xe0,
  535. 0x35, 0xc1, 0x7e, 0x23, 0x29, 0xac, 0xa1, 0x2e,
  536. 0x21, 0xd5, 0x14, 0xb2, 0x54, 0x66, 0x93, 0x1c,
  537. 0x7d, 0x8f, 0x6a, 0x5a, 0xac, 0x84, 0xaa, 0x05,
  538. 0x1b, 0xa3, 0x0b, 0x39, 0x6a, 0x0a, 0xac, 0x97,
  539. 0x3d, 0x58, 0xe0, 0x91 },
  540. { 0x61, 0x35, 0x3b, 0x4c, 0x28, 0x06, 0x93, 0x4a,
  541. 0x77, 0x7f, 0xf5, 0x1f, 0xa2, 0x2a, 0x47, 0x55,
  542. 0x69, 0x9b, 0x2a, 0x71, 0x4f, 0xcd, 0xc6, 0xf8,
  543. 0x37, 0x66, 0xe5, 0xf9, 0x7b, 0x6c, 0x74, 0x23,
  544. 0x73, 0x80, 0x69, 0x00, 0xe4, 0x9f, 0x24, 0xb2,
  545. 0x2b, 0x09, 0x75, 0x44, 0xd4, 0x89, 0x6b, 0x42,
  546. 0x49, 0x89, 0xb5, 0xe1, 0xeb, 0xac, 0x0f, 0x07,
  547. 0xc2, 0x3f, 0x45, 0x98 },
  548. { 0x8c, 0xe2, 0x49, 0x98, 0x62, 0x56, 0x15, 0xb6,
  549. 0x03, 0xa0, 0x33, 0xac, 0xa1, 0x3f, 0xb8, 0x94,
  550. 0xbe, 0x91, 0x12, 0xa5, 0xc3, 0xa2, 0x11, 0xa8,
  551. 0xba, 0x26, 0x2a, 0x3c, 0xca, 0x7e, 0x2c, 0xa7,
  552. 0x01, 0xe4, 0xa9, 0xa4, 0xfb, 0xa4, 0x3c, 0x90,
  553. 0xcc, 0xdc, 0xb2, 0x81, 0xd4, 0x8c, 0x7c, 0x6f,
  554. 0xd6, 0x28, 0x75, 0xd2, 0xac, 0xa4, 0x17, 0x03,
  555. 0x4c, 0x34, 0xae, 0xe5 },
  556. { 0x00 },
  557. { 0x98, 0xe7, 0x24, 0x7c, 0x07, 0xf0, 0xfe, 0x41,
  558. 0x1c, 0x26, 0x7e, 0x43, 0x84, 0xb0, 0xf6, 0x00 },
  559. { 0x39, 0x80, 0xca, 0x0b, 0x3c, 0x00, 0xe8, 0x41,
  560. 0xeb, 0x06, 0xfa, 0xc4, 0x87, 0x2a, 0x27, 0x57,
  561. 0x85, 0x9e, 0x1c, 0xea, 0xa6, 0xef, 0xd9, 0x84,
  562. 0x62, 0x85, 0x93, 0xb4, 0x0c, 0xa1, 0xe1, 0x9c,
  563. 0x7d, 0x77, 0x3d, 0x00, 0xc1, 0x44, 0xc5, 0x25,
  564. 0xac, 0x61, 0x9d, 0x18, 0xc8, 0x4a, 0x3f, 0x47,
  565. 0x18, 0xe2, 0x44, 0x8b, 0x2f, 0xe3, 0x24, 0xd9,
  566. 0xcc, 0xda, 0x27, 0x10, 0xac, 0xad, 0xe2, 0x56 },
  567. { 0x39, 0x80, 0xca, 0x0b, 0x3c, 0x00, 0xe8, 0x41,
  568. 0xeb, 0x06, 0xfa, 0xc4, 0x87, 0x2a, 0x27, 0x57,
  569. 0x85, 0x9e, 0x1c, 0xea, 0xa6, 0xef, 0xd9, 0x84,
  570. 0x62, 0x85, 0x93, 0xb4, 0x0c, 0xa1, 0xe1, 0x9c,
  571. 0x7d, 0x77, 0x3d, 0x00, 0xc1, 0x44, 0xc5, 0x25,
  572. 0xac, 0x61, 0x9d, 0x18, 0xc8, 0x4a, 0x3f, 0x47,
  573. 0x18, 0xe2, 0x44, 0x8b, 0x2f, 0xe3, 0x24, 0xd9,
  574. 0xcc, 0xda, 0x27, 0x10 },
  575. { 0x0f, 0x10, 0xf5, 0x99, 0xae, 0x14, 0xa1, 0x54,
  576. 0xed, 0x24, 0xb3, 0x6e, 0x25, 0x32, 0x4d, 0xb8,
  577. 0xc5, 0x66, 0x63, 0x2e, 0xf2, 0xbb, 0xb3, 0x4f,
  578. 0x83, 0x47, 0x28, 0x0f, 0xc4, 0x50, 0x70, 0x57,
  579. 0xfd, 0xdc, 0x29, 0xdf, 0x9a, 0x47, 0x1f, 0x75,
  580. 0xc6, 0x65, 0x41, 0xd4, 0xd4, 0xda, 0xd1, 0xc9,
  581. 0xe9, 0x3a, 0x19, 0xa5, 0x8e, 0x8b, 0x47, 0x3f,
  582. 0xa0, 0xf0, 0x62, 0xf7 },
  583. { 0xd2, 0x7e, 0x88, 0x68, 0x1c, 0xe3, 0x24, 0x3c,
  584. 0x48, 0x30, 0x16, 0x5a, 0x8f, 0xdc, 0xf9, 0xff,
  585. 0x1d, 0xe9, 0xa1, 0xd8, 0xe6, 0xb4, 0x47, 0xef,
  586. 0x6e, 0xf7, 0xb7, 0x98, 0x28, 0x66, 0x6e, 0x45,
  587. 0x81, 0xe7, 0x90, 0x12, 0xaf, 0x34, 0xdd, 0xd9,
  588. 0xe2, 0xf0, 0x37, 0x58, 0x9b, 0x29, 0x2d, 0xb3,
  589. 0xe6, 0x7c, 0x03, 0x67, 0x45, 0xfa, 0x22, 0xe7,
  590. 0xe9, 0xb7, 0x37, 0x3b },
  591. { 0x00 },
  592. { 0xce, 0xa7, 0x40, 0x3d, 0x4d, 0x60, 0x6b, 0x6e,
  593. 0x07, 0x4e, 0xc5, 0xd3, 0xba, 0xf3, 0x9d, 0x18 },
  594. { 0x52, 0x2d, 0xc1, 0xf0, 0x99, 0x56, 0x7d, 0x07,
  595. 0xf4, 0x7f, 0x37, 0xa3, 0x2a, 0x84, 0x42, 0x7d,
  596. 0x64, 0x3a, 0x8c, 0xdc, 0xbf, 0xe5, 0xc0, 0xc9,
  597. 0x75, 0x98, 0xa2, 0xbd, 0x25, 0x55, 0xd1, 0xaa,
  598. 0x8c, 0xb0, 0x8e, 0x48, 0x59, 0x0d, 0xbb, 0x3d,
  599. 0xa7, 0xb0, 0x8b, 0x10, 0x56, 0x82, 0x88, 0x38,
  600. 0xc5, 0xf6, 0x1e, 0x63, 0x93, 0xba, 0x7a, 0x0a,
  601. 0xbc, 0xc9, 0xf6, 0x62, 0x89, 0x80, 0x15, 0xad },
  602. { 0x52, 0x2d, 0xc1, 0xf0, 0x99, 0x56, 0x7d, 0x07,
  603. 0xf4, 0x7f, 0x37, 0xa3, 0x2a, 0x84, 0x42, 0x7d,
  604. 0x64, 0x3a, 0x8c, 0xdc, 0xbf, 0xe5, 0xc0, 0xc9,
  605. 0x75, 0x98, 0xa2, 0xbd, 0x25, 0x55, 0xd1, 0xaa,
  606. 0x8c, 0xb0, 0x8e, 0x48, 0x59, 0x0d, 0xbb, 0x3d,
  607. 0xa7, 0xb0, 0x8b, 0x10, 0x56, 0x82, 0x88, 0x38,
  608. 0xc5, 0xf6, 0x1e, 0x63, 0x93, 0xba, 0x7a, 0x0a,
  609. 0xbc, 0xc9, 0xf6, 0x62 },
  610. { 0xc3, 0x76, 0x2d, 0xf1, 0xca, 0x78, 0x7d, 0x32,
  611. 0xae, 0x47, 0xc1, 0x3b, 0xf1, 0x98, 0x44, 0xcb,
  612. 0xaf, 0x1a, 0xe1, 0x4d, 0x0b, 0x97, 0x6a, 0xfa,
  613. 0xc5, 0x2f, 0xf7, 0xd7, 0x9b, 0xba, 0x9d, 0xe0,
  614. 0xfe, 0xb5, 0x82, 0xd3, 0x39, 0x34, 0xa4, 0xf0,
  615. 0x95, 0x4c, 0xc2, 0x36, 0x3b, 0xc7, 0x3f, 0x78,
  616. 0x62, 0xac, 0x43, 0x0e, 0x64, 0xab, 0xe4, 0x99,
  617. 0xf4, 0x7c, 0x9b, 0x1f },
  618. { 0x5a, 0x8d, 0xef, 0x2f, 0x0c, 0x9e, 0x53, 0xf1,
  619. 0xf7, 0x5d, 0x78, 0x53, 0x65, 0x9e, 0x2a, 0x20,
  620. 0xee, 0xb2, 0xb2, 0x2a, 0xaf, 0xde, 0x64, 0x19,
  621. 0xa0, 0x58, 0xab, 0x4f, 0x6f, 0x74, 0x6b, 0xf4,
  622. 0x0f, 0xc0, 0xc3, 0xb7, 0x80, 0xf2, 0x44, 0x45,
  623. 0x2d, 0xa3, 0xeb, 0xf1, 0xc5, 0xd8, 0x2c, 0xde,
  624. 0xa2, 0x41, 0x89, 0x97, 0x20, 0x0e, 0xf8, 0x2e,
  625. 0x44, 0xae, 0x7e, 0x3f },
  626. };
  627. static const unsigned char tag[MAX_TESTS * 3][16] =
  628. {
  629. { 0x58, 0xe2, 0xfc, 0xce, 0xfa, 0x7e, 0x30, 0x61,
  630. 0x36, 0x7f, 0x1d, 0x57, 0xa4, 0xe7, 0x45, 0x5a },
  631. { 0xab, 0x6e, 0x47, 0xd4, 0x2c, 0xec, 0x13, 0xbd,
  632. 0xf5, 0x3a, 0x67, 0xb2, 0x12, 0x57, 0xbd, 0xdf },
  633. { 0x4d, 0x5c, 0x2a, 0xf3, 0x27, 0xcd, 0x64, 0xa6,
  634. 0x2c, 0xf3, 0x5a, 0xbd, 0x2b, 0xa6, 0xfa, 0xb4 },
  635. { 0x5b, 0xc9, 0x4f, 0xbc, 0x32, 0x21, 0xa5, 0xdb,
  636. 0x94, 0xfa, 0xe9, 0x5a, 0xe7, 0x12, 0x1a, 0x47 },
  637. { 0x36, 0x12, 0xd2, 0xe7, 0x9e, 0x3b, 0x07, 0x85,
  638. 0x56, 0x1b, 0xe1, 0x4a, 0xac, 0xa2, 0xfc, 0xcb },
  639. { 0x61, 0x9c, 0xc5, 0xae, 0xff, 0xfe, 0x0b, 0xfa,
  640. 0x46, 0x2a, 0xf4, 0x3c, 0x16, 0x99, 0xd0, 0x50 },
  641. { 0xcd, 0x33, 0xb2, 0x8a, 0xc7, 0x73, 0xf7, 0x4b,
  642. 0xa0, 0x0e, 0xd1, 0xf3, 0x12, 0x57, 0x24, 0x35 },
  643. { 0x2f, 0xf5, 0x8d, 0x80, 0x03, 0x39, 0x27, 0xab,
  644. 0x8e, 0xf4, 0xd4, 0x58, 0x75, 0x14, 0xf0, 0xfb },
  645. { 0x99, 0x24, 0xa7, 0xc8, 0x58, 0x73, 0x36, 0xbf,
  646. 0xb1, 0x18, 0x02, 0x4d, 0xb8, 0x67, 0x4a, 0x14 },
  647. { 0x25, 0x19, 0x49, 0x8e, 0x80, 0xf1, 0x47, 0x8f,
  648. 0x37, 0xba, 0x55, 0xbd, 0x6d, 0x27, 0x61, 0x8c },
  649. { 0x65, 0xdc, 0xc5, 0x7f, 0xcf, 0x62, 0x3a, 0x24,
  650. 0x09, 0x4f, 0xcc, 0xa4, 0x0d, 0x35, 0x33, 0xf8 },
  651. { 0xdc, 0xf5, 0x66, 0xff, 0x29, 0x1c, 0x25, 0xbb,
  652. 0xb8, 0x56, 0x8f, 0xc3, 0xd3, 0x76, 0xa6, 0xd9 },
  653. { 0x53, 0x0f, 0x8a, 0xfb, 0xc7, 0x45, 0x36, 0xb9,
  654. 0xa9, 0x63, 0xb4, 0xf1, 0xc4, 0xcb, 0x73, 0x8b },
  655. { 0xd0, 0xd1, 0xc8, 0xa7, 0x99, 0x99, 0x6b, 0xf0,
  656. 0x26, 0x5b, 0x98, 0xb5, 0xd4, 0x8a, 0xb9, 0x19 },
  657. { 0xb0, 0x94, 0xda, 0xc5, 0xd9, 0x34, 0x71, 0xbd,
  658. 0xec, 0x1a, 0x50, 0x22, 0x70, 0xe3, 0xcc, 0x6c },
  659. { 0x76, 0xfc, 0x6e, 0xce, 0x0f, 0x4e, 0x17, 0x68,
  660. 0xcd, 0xdf, 0x88, 0x53, 0xbb, 0x2d, 0x55, 0x1b },
  661. { 0x3a, 0x33, 0x7d, 0xbf, 0x46, 0xa7, 0x92, 0xc4,
  662. 0x5e, 0x45, 0x49, 0x13, 0xfe, 0x2e, 0xa8, 0xf2 },
  663. { 0xa4, 0x4a, 0x82, 0x66, 0xee, 0x1c, 0x8e, 0xb0,
  664. 0xc8, 0xb5, 0xd4, 0xcf, 0x5a, 0xe9, 0xf1, 0x9a },
  665. };
  666. int mbedtls_gcm_self_test( int verbose )
  667. {
  668. mbedtls_gcm_context ctx;
  669. unsigned char buf[64];
  670. unsigned char tag_buf[16];
  671. int i, j, ret;
  672. mbedtls_cipher_id_t cipher = MBEDTLS_CIPHER_ID_AES;
  673. for( j = 0; j < 3; j++ )
  674. {
  675. int key_len = 128 + 64 * j;
  676. for( i = 0; i < MAX_TESTS; i++ )
  677. {
  678. mbedtls_gcm_init( &ctx );
  679. if( verbose != 0 )
  680. mbedtls_printf( " AES-GCM-%3d #%d (%s): ",
  681. key_len, i, "enc" );
  682. ret = mbedtls_gcm_setkey( &ctx, cipher, key[key_index[i]],
  683. key_len );
  684. /*
  685. * AES-192 is an optional feature that may be unavailable when
  686. * there is an alternative underlying implementation i.e. when
  687. * MBEDTLS_AES_ALT is defined.
  688. */
  689. if( ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && key_len == 192 )
  690. {
  691. mbedtls_printf( "skipped\n" );
  692. break;
  693. }
  694. else if( ret != 0 )
  695. {
  696. goto exit;
  697. }
  698. ret = mbedtls_gcm_crypt_and_tag( &ctx, MBEDTLS_GCM_ENCRYPT,
  699. pt_len[i],
  700. iv[iv_index[i]], iv_len[i],
  701. additional[add_index[i]], add_len[i],
  702. pt[pt_index[i]], buf, 16, tag_buf );
  703. if( ret != 0 )
  704. goto exit;
  705. if ( memcmp( buf, ct[j * 6 + i], pt_len[i] ) != 0 ||
  706. memcmp( tag_buf, tag[j * 6 + i], 16 ) != 0 )
  707. {
  708. ret = 1;
  709. goto exit;
  710. }
  711. mbedtls_gcm_free( &ctx );
  712. if( verbose != 0 )
  713. mbedtls_printf( "passed\n" );
  714. mbedtls_gcm_init( &ctx );
  715. if( verbose != 0 )
  716. mbedtls_printf( " AES-GCM-%3d #%d (%s): ",
  717. key_len, i, "dec" );
  718. ret = mbedtls_gcm_setkey( &ctx, cipher, key[key_index[i]],
  719. key_len );
  720. if( ret != 0 )
  721. goto exit;
  722. ret = mbedtls_gcm_crypt_and_tag( &ctx, MBEDTLS_GCM_DECRYPT,
  723. pt_len[i],
  724. iv[iv_index[i]], iv_len[i],
  725. additional[add_index[i]], add_len[i],
  726. ct[j * 6 + i], buf, 16, tag_buf );
  727. if( ret != 0 )
  728. goto exit;
  729. if( memcmp( buf, pt[pt_index[i]], pt_len[i] ) != 0 ||
  730. memcmp( tag_buf, tag[j * 6 + i], 16 ) != 0 )
  731. {
  732. ret = 1;
  733. goto exit;
  734. }
  735. mbedtls_gcm_free( &ctx );
  736. if( verbose != 0 )
  737. mbedtls_printf( "passed\n" );
  738. mbedtls_gcm_init( &ctx );
  739. if( verbose != 0 )
  740. mbedtls_printf( " AES-GCM-%3d #%d split (%s): ",
  741. key_len, i, "enc" );
  742. ret = mbedtls_gcm_setkey( &ctx, cipher, key[key_index[i]],
  743. key_len );
  744. if( ret != 0 )
  745. goto exit;
  746. ret = mbedtls_gcm_starts( &ctx, MBEDTLS_GCM_ENCRYPT,
  747. iv[iv_index[i]], iv_len[i],
  748. additional[add_index[i]], add_len[i] );
  749. if( ret != 0 )
  750. goto exit;
  751. if( pt_len[i] > 32 )
  752. {
  753. size_t rest_len = pt_len[i] - 32;
  754. ret = mbedtls_gcm_update( &ctx, 32, pt[pt_index[i]], buf );
  755. if( ret != 0 )
  756. goto exit;
  757. ret = mbedtls_gcm_update( &ctx, rest_len, pt[pt_index[i]] + 32,
  758. buf + 32 );
  759. if( ret != 0 )
  760. goto exit;
  761. }
  762. else
  763. {
  764. ret = mbedtls_gcm_update( &ctx, pt_len[i], pt[pt_index[i]], buf );
  765. if( ret != 0 )
  766. goto exit;
  767. }
  768. ret = mbedtls_gcm_finish( &ctx, tag_buf, 16 );
  769. if( ret != 0 )
  770. goto exit;
  771. if( memcmp( buf, ct[j * 6 + i], pt_len[i] ) != 0 ||
  772. memcmp( tag_buf, tag[j * 6 + i], 16 ) != 0 )
  773. {
  774. ret = 1;
  775. goto exit;
  776. }
  777. mbedtls_gcm_free( &ctx );
  778. if( verbose != 0 )
  779. mbedtls_printf( "passed\n" );
  780. mbedtls_gcm_init( &ctx );
  781. if( verbose != 0 )
  782. mbedtls_printf( " AES-GCM-%3d #%d split (%s): ",
  783. key_len, i, "dec" );
  784. ret = mbedtls_gcm_setkey( &ctx, cipher, key[key_index[i]],
  785. key_len );
  786. if( ret != 0 )
  787. goto exit;
  788. ret = mbedtls_gcm_starts( &ctx, MBEDTLS_GCM_DECRYPT,
  789. iv[iv_index[i]], iv_len[i],
  790. additional[add_index[i]], add_len[i] );
  791. if( ret != 0 )
  792. goto exit;
  793. if( pt_len[i] > 32 )
  794. {
  795. size_t rest_len = pt_len[i] - 32;
  796. ret = mbedtls_gcm_update( &ctx, 32, ct[j * 6 + i], buf );
  797. if( ret != 0 )
  798. goto exit;
  799. ret = mbedtls_gcm_update( &ctx, rest_len, ct[j * 6 + i] + 32,
  800. buf + 32 );
  801. if( ret != 0 )
  802. goto exit;
  803. }
  804. else
  805. {
  806. ret = mbedtls_gcm_update( &ctx, pt_len[i], ct[j * 6 + i],
  807. buf );
  808. if( ret != 0 )
  809. goto exit;
  810. }
  811. ret = mbedtls_gcm_finish( &ctx, tag_buf, 16 );
  812. if( ret != 0 )
  813. goto exit;
  814. if( memcmp( buf, pt[pt_index[i]], pt_len[i] ) != 0 ||
  815. memcmp( tag_buf, tag[j * 6 + i], 16 ) != 0 )
  816. {
  817. ret = 1;
  818. goto exit;
  819. }
  820. mbedtls_gcm_free( &ctx );
  821. if( verbose != 0 )
  822. mbedtls_printf( "passed\n" );
  823. }
  824. }
  825. if( verbose != 0 )
  826. mbedtls_printf( "\n" );
  827. ret = 0;
  828. exit:
  829. if( ret != 0 )
  830. {
  831. if( verbose != 0 )
  832. mbedtls_printf( "failed\n" );
  833. mbedtls_gcm_free( &ctx );
  834. }
  835. return( ret );
  836. }
  837. #endif /* MBEDTLS_SELF_TEST && MBEDTLS_AES_C */
  838. #endif /* MBEDTLS_GCM_C */