gcm.c 33 KB

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