gcm.c 38 KB

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