gcm.c 34 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050
  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. /* NXP added for HW accelerators support */
  377. #if !defined(MBEDTLS_GCM_CRYPT_ALT)
  378. int mbedtls_gcm_crypt_and_tag( mbedtls_gcm_context *ctx,
  379. int mode,
  380. size_t length,
  381. const unsigned char *iv,
  382. size_t iv_len,
  383. const unsigned char *add,
  384. size_t add_len,
  385. const unsigned char *input,
  386. unsigned char *output,
  387. size_t tag_len,
  388. unsigned char *tag )
  389. {
  390. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  391. GCM_VALIDATE_RET( ctx != NULL );
  392. GCM_VALIDATE_RET( iv != NULL );
  393. GCM_VALIDATE_RET( add_len == 0 || add != NULL );
  394. GCM_VALIDATE_RET( length == 0 || input != NULL );
  395. GCM_VALIDATE_RET( length == 0 || output != NULL );
  396. GCM_VALIDATE_RET( tag != NULL );
  397. if( ( ret = mbedtls_gcm_starts( ctx, mode, iv, iv_len, add, add_len ) ) != 0 )
  398. return( ret );
  399. if( ( ret = mbedtls_gcm_update( ctx, length, input, output ) ) != 0 )
  400. return( ret );
  401. if( ( ret = mbedtls_gcm_finish( ctx, tag, tag_len ) ) != 0 )
  402. return( ret );
  403. return( 0 );
  404. }
  405. int mbedtls_gcm_auth_decrypt( mbedtls_gcm_context *ctx,
  406. size_t length,
  407. const unsigned char *iv,
  408. size_t iv_len,
  409. const unsigned char *add,
  410. size_t add_len,
  411. const unsigned char *tag,
  412. size_t tag_len,
  413. const unsigned char *input,
  414. unsigned char *output )
  415. {
  416. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  417. unsigned char check_tag[16];
  418. size_t i;
  419. int diff;
  420. GCM_VALIDATE_RET( ctx != NULL );
  421. GCM_VALIDATE_RET( iv != NULL );
  422. GCM_VALIDATE_RET( add_len == 0 || add != NULL );
  423. GCM_VALIDATE_RET( tag != NULL );
  424. GCM_VALIDATE_RET( length == 0 || input != NULL );
  425. GCM_VALIDATE_RET( length == 0 || output != NULL );
  426. if( ( ret = mbedtls_gcm_crypt_and_tag( ctx, MBEDTLS_GCM_DECRYPT, length,
  427. iv, iv_len, add, add_len,
  428. input, output, tag_len, check_tag ) ) != 0 )
  429. {
  430. return( ret );
  431. }
  432. /* Check tag in "constant-time" */
  433. for( diff = 0, i = 0; i < tag_len; i++ )
  434. diff |= tag[i] ^ check_tag[i];
  435. if( diff != 0 )
  436. {
  437. mbedtls_platform_zeroize( output, length );
  438. return( MBEDTLS_ERR_GCM_AUTH_FAILED );
  439. }
  440. return( 0 );
  441. }
  442. #endif /* !MBEDTLS_GCM_CRYPT_ALT */
  443. /* NXP added for HW accelerators support */
  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_test_data[MAX_TESTS] =
  460. { 0, 0, 1, 1, 1, 1 };
  461. #ifndef AT_NONCACHEABLE_SECTION_ALIGN_INIT
  462. #define AT_NONCACHEABLE_SECTION_ALIGN_INIT(var,alignbytes) var
  463. #endif // AT_NONCACHEABLE_SECTION_ALIGN_INIT
  464. #ifndef AT_NONCACHEABLE_SECTION_INIT
  465. #define AT_NONCACHEABLE_SECTION_INIT(var) var
  466. #endif // AT_NONCACHEABLE_SECTION_INIT
  467. /* NXP: AT_NONCACHEABLE_SECTION for DCACHE compatibility */
  468. AT_NONCACHEABLE_SECTION_ALIGN_INIT(static unsigned char key_test_data[MAX_TESTS][32],8U) =
  469. {
  470. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  471. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  472. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  473. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
  474. { 0xfe, 0xff, 0xe9, 0x92, 0x86, 0x65, 0x73, 0x1c,
  475. 0x6d, 0x6a, 0x8f, 0x94, 0x67, 0x30, 0x83, 0x08,
  476. 0xfe, 0xff, 0xe9, 0x92, 0x86, 0x65, 0x73, 0x1c,
  477. 0x6d, 0x6a, 0x8f, 0x94, 0x67, 0x30, 0x83, 0x08 },
  478. };
  479. static const size_t iv_len_test_data[MAX_TESTS] =
  480. { 12, 12, 12, 12, 8, 60 };
  481. static const int iv_index_test_data[MAX_TESTS] =
  482. { 0, 0, 1, 1, 1, 2 };
  483. AT_NONCACHEABLE_SECTION_INIT(static unsigned char iv_test_data[MAX_TESTS][64]) =
  484. {
  485. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  486. 0x00, 0x00, 0x00, 0x00 },
  487. { 0xca, 0xfe, 0xba, 0xbe, 0xfa, 0xce, 0xdb, 0xad,
  488. 0xde, 0xca, 0xf8, 0x88 },
  489. { 0x93, 0x13, 0x22, 0x5d, 0xf8, 0x84, 0x06, 0xe5,
  490. 0x55, 0x90, 0x9c, 0x5a, 0xff, 0x52, 0x69, 0xaa,
  491. 0x6a, 0x7a, 0x95, 0x38, 0x53, 0x4f, 0x7d, 0xa1,
  492. 0xe4, 0xc3, 0x03, 0xd2, 0xa3, 0x18, 0xa7, 0x28,
  493. 0xc3, 0xc0, 0xc9, 0x51, 0x56, 0x80, 0x95, 0x39,
  494. 0xfc, 0xf0, 0xe2, 0x42, 0x9a, 0x6b, 0x52, 0x54,
  495. 0x16, 0xae, 0xdb, 0xf5, 0xa0, 0xde, 0x6a, 0x57,
  496. 0xa6, 0x37, 0xb3, 0x9b },
  497. };
  498. static const size_t add_len_test_data[MAX_TESTS] =
  499. { 0, 0, 0, 20, 20, 20 };
  500. static const int add_index_test_data[MAX_TESTS] =
  501. { 0, 0, 0, 1, 1, 1 };
  502. AT_NONCACHEABLE_SECTION_INIT(static unsigned char additional_test_data[MAX_TESTS][64]) =
  503. {
  504. { 0x00 },
  505. { 0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef,
  506. 0xfe, 0xed, 0xfa, 0xce, 0xde, 0xad, 0xbe, 0xef,
  507. 0xab, 0xad, 0xda, 0xd2 },
  508. };
  509. static const size_t pt_len_test_data[MAX_TESTS] =
  510. { 0, 16, 64, 60, 60, 60 };
  511. static const int pt_index_test_data[MAX_TESTS] =
  512. { 0, 0, 1, 1, 1, 1 };
  513. AT_NONCACHEABLE_SECTION_INIT(static unsigned char pt_test_data[MAX_TESTS][64]) =
  514. {
  515. { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00,
  516. 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 },
  517. { 0xd9, 0x31, 0x32, 0x25, 0xf8, 0x84, 0x06, 0xe5,
  518. 0xa5, 0x59, 0x09, 0xc5, 0xaf, 0xf5, 0x26, 0x9a,
  519. 0x86, 0xa7, 0xa9, 0x53, 0x15, 0x34, 0xf7, 0xda,
  520. 0x2e, 0x4c, 0x30, 0x3d, 0x8a, 0x31, 0x8a, 0x72,
  521. 0x1c, 0x3c, 0x0c, 0x95, 0x95, 0x68, 0x09, 0x53,
  522. 0x2f, 0xcf, 0x0e, 0x24, 0x49, 0xa6, 0xb5, 0x25,
  523. 0xb1, 0x6a, 0xed, 0xf5, 0xaa, 0x0d, 0xe6, 0x57,
  524. 0xba, 0x63, 0x7b, 0x39, 0x1a, 0xaf, 0xd2, 0x55 },
  525. };
  526. AT_NONCACHEABLE_SECTION_INIT(static unsigned char ct_test_data[MAX_TESTS * 3][64]) =
  527. {
  528. { 0x00 },
  529. { 0x03, 0x88, 0xda, 0xce, 0x60, 0xb6, 0xa3, 0x92,
  530. 0xf3, 0x28, 0xc2, 0xb9, 0x71, 0xb2, 0xfe, 0x78 },
  531. { 0x42, 0x83, 0x1e, 0xc2, 0x21, 0x77, 0x74, 0x24,
  532. 0x4b, 0x72, 0x21, 0xb7, 0x84, 0xd0, 0xd4, 0x9c,
  533. 0xe3, 0xaa, 0x21, 0x2f, 0x2c, 0x02, 0xa4, 0xe0,
  534. 0x35, 0xc1, 0x7e, 0x23, 0x29, 0xac, 0xa1, 0x2e,
  535. 0x21, 0xd5, 0x14, 0xb2, 0x54, 0x66, 0x93, 0x1c,
  536. 0x7d, 0x8f, 0x6a, 0x5a, 0xac, 0x84, 0xaa, 0x05,
  537. 0x1b, 0xa3, 0x0b, 0x39, 0x6a, 0x0a, 0xac, 0x97,
  538. 0x3d, 0x58, 0xe0, 0x91, 0x47, 0x3f, 0x59, 0x85 },
  539. { 0x42, 0x83, 0x1e, 0xc2, 0x21, 0x77, 0x74, 0x24,
  540. 0x4b, 0x72, 0x21, 0xb7, 0x84, 0xd0, 0xd4, 0x9c,
  541. 0xe3, 0xaa, 0x21, 0x2f, 0x2c, 0x02, 0xa4, 0xe0,
  542. 0x35, 0xc1, 0x7e, 0x23, 0x29, 0xac, 0xa1, 0x2e,
  543. 0x21, 0xd5, 0x14, 0xb2, 0x54, 0x66, 0x93, 0x1c,
  544. 0x7d, 0x8f, 0x6a, 0x5a, 0xac, 0x84, 0xaa, 0x05,
  545. 0x1b, 0xa3, 0x0b, 0x39, 0x6a, 0x0a, 0xac, 0x97,
  546. 0x3d, 0x58, 0xe0, 0x91 },
  547. { 0x61, 0x35, 0x3b, 0x4c, 0x28, 0x06, 0x93, 0x4a,
  548. 0x77, 0x7f, 0xf5, 0x1f, 0xa2, 0x2a, 0x47, 0x55,
  549. 0x69, 0x9b, 0x2a, 0x71, 0x4f, 0xcd, 0xc6, 0xf8,
  550. 0x37, 0x66, 0xe5, 0xf9, 0x7b, 0x6c, 0x74, 0x23,
  551. 0x73, 0x80, 0x69, 0x00, 0xe4, 0x9f, 0x24, 0xb2,
  552. 0x2b, 0x09, 0x75, 0x44, 0xd4, 0x89, 0x6b, 0x42,
  553. 0x49, 0x89, 0xb5, 0xe1, 0xeb, 0xac, 0x0f, 0x07,
  554. 0xc2, 0x3f, 0x45, 0x98 },
  555. { 0x8c, 0xe2, 0x49, 0x98, 0x62, 0x56, 0x15, 0xb6,
  556. 0x03, 0xa0, 0x33, 0xac, 0xa1, 0x3f, 0xb8, 0x94,
  557. 0xbe, 0x91, 0x12, 0xa5, 0xc3, 0xa2, 0x11, 0xa8,
  558. 0xba, 0x26, 0x2a, 0x3c, 0xca, 0x7e, 0x2c, 0xa7,
  559. 0x01, 0xe4, 0xa9, 0xa4, 0xfb, 0xa4, 0x3c, 0x90,
  560. 0xcc, 0xdc, 0xb2, 0x81, 0xd4, 0x8c, 0x7c, 0x6f,
  561. 0xd6, 0x28, 0x75, 0xd2, 0xac, 0xa4, 0x17, 0x03,
  562. 0x4c, 0x34, 0xae, 0xe5 },
  563. { 0x00 },
  564. { 0x98, 0xe7, 0x24, 0x7c, 0x07, 0xf0, 0xfe, 0x41,
  565. 0x1c, 0x26, 0x7e, 0x43, 0x84, 0xb0, 0xf6, 0x00 },
  566. { 0x39, 0x80, 0xca, 0x0b, 0x3c, 0x00, 0xe8, 0x41,
  567. 0xeb, 0x06, 0xfa, 0xc4, 0x87, 0x2a, 0x27, 0x57,
  568. 0x85, 0x9e, 0x1c, 0xea, 0xa6, 0xef, 0xd9, 0x84,
  569. 0x62, 0x85, 0x93, 0xb4, 0x0c, 0xa1, 0xe1, 0x9c,
  570. 0x7d, 0x77, 0x3d, 0x00, 0xc1, 0x44, 0xc5, 0x25,
  571. 0xac, 0x61, 0x9d, 0x18, 0xc8, 0x4a, 0x3f, 0x47,
  572. 0x18, 0xe2, 0x44, 0x8b, 0x2f, 0xe3, 0x24, 0xd9,
  573. 0xcc, 0xda, 0x27, 0x10, 0xac, 0xad, 0xe2, 0x56 },
  574. { 0x39, 0x80, 0xca, 0x0b, 0x3c, 0x00, 0xe8, 0x41,
  575. 0xeb, 0x06, 0xfa, 0xc4, 0x87, 0x2a, 0x27, 0x57,
  576. 0x85, 0x9e, 0x1c, 0xea, 0xa6, 0xef, 0xd9, 0x84,
  577. 0x62, 0x85, 0x93, 0xb4, 0x0c, 0xa1, 0xe1, 0x9c,
  578. 0x7d, 0x77, 0x3d, 0x00, 0xc1, 0x44, 0xc5, 0x25,
  579. 0xac, 0x61, 0x9d, 0x18, 0xc8, 0x4a, 0x3f, 0x47,
  580. 0x18, 0xe2, 0x44, 0x8b, 0x2f, 0xe3, 0x24, 0xd9,
  581. 0xcc, 0xda, 0x27, 0x10 },
  582. { 0x0f, 0x10, 0xf5, 0x99, 0xae, 0x14, 0xa1, 0x54,
  583. 0xed, 0x24, 0xb3, 0x6e, 0x25, 0x32, 0x4d, 0xb8,
  584. 0xc5, 0x66, 0x63, 0x2e, 0xf2, 0xbb, 0xb3, 0x4f,
  585. 0x83, 0x47, 0x28, 0x0f, 0xc4, 0x50, 0x70, 0x57,
  586. 0xfd, 0xdc, 0x29, 0xdf, 0x9a, 0x47, 0x1f, 0x75,
  587. 0xc6, 0x65, 0x41, 0xd4, 0xd4, 0xda, 0xd1, 0xc9,
  588. 0xe9, 0x3a, 0x19, 0xa5, 0x8e, 0x8b, 0x47, 0x3f,
  589. 0xa0, 0xf0, 0x62, 0xf7 },
  590. { 0xd2, 0x7e, 0x88, 0x68, 0x1c, 0xe3, 0x24, 0x3c,
  591. 0x48, 0x30, 0x16, 0x5a, 0x8f, 0xdc, 0xf9, 0xff,
  592. 0x1d, 0xe9, 0xa1, 0xd8, 0xe6, 0xb4, 0x47, 0xef,
  593. 0x6e, 0xf7, 0xb7, 0x98, 0x28, 0x66, 0x6e, 0x45,
  594. 0x81, 0xe7, 0x90, 0x12, 0xaf, 0x34, 0xdd, 0xd9,
  595. 0xe2, 0xf0, 0x37, 0x58, 0x9b, 0x29, 0x2d, 0xb3,
  596. 0xe6, 0x7c, 0x03, 0x67, 0x45, 0xfa, 0x22, 0xe7,
  597. 0xe9, 0xb7, 0x37, 0x3b },
  598. { 0x00 },
  599. { 0xce, 0xa7, 0x40, 0x3d, 0x4d, 0x60, 0x6b, 0x6e,
  600. 0x07, 0x4e, 0xc5, 0xd3, 0xba, 0xf3, 0x9d, 0x18 },
  601. { 0x52, 0x2d, 0xc1, 0xf0, 0x99, 0x56, 0x7d, 0x07,
  602. 0xf4, 0x7f, 0x37, 0xa3, 0x2a, 0x84, 0x42, 0x7d,
  603. 0x64, 0x3a, 0x8c, 0xdc, 0xbf, 0xe5, 0xc0, 0xc9,
  604. 0x75, 0x98, 0xa2, 0xbd, 0x25, 0x55, 0xd1, 0xaa,
  605. 0x8c, 0xb0, 0x8e, 0x48, 0x59, 0x0d, 0xbb, 0x3d,
  606. 0xa7, 0xb0, 0x8b, 0x10, 0x56, 0x82, 0x88, 0x38,
  607. 0xc5, 0xf6, 0x1e, 0x63, 0x93, 0xba, 0x7a, 0x0a,
  608. 0xbc, 0xc9, 0xf6, 0x62, 0x89, 0x80, 0x15, 0xad },
  609. { 0x52, 0x2d, 0xc1, 0xf0, 0x99, 0x56, 0x7d, 0x07,
  610. 0xf4, 0x7f, 0x37, 0xa3, 0x2a, 0x84, 0x42, 0x7d,
  611. 0x64, 0x3a, 0x8c, 0xdc, 0xbf, 0xe5, 0xc0, 0xc9,
  612. 0x75, 0x98, 0xa2, 0xbd, 0x25, 0x55, 0xd1, 0xaa,
  613. 0x8c, 0xb0, 0x8e, 0x48, 0x59, 0x0d, 0xbb, 0x3d,
  614. 0xa7, 0xb0, 0x8b, 0x10, 0x56, 0x82, 0x88, 0x38,
  615. 0xc5, 0xf6, 0x1e, 0x63, 0x93, 0xba, 0x7a, 0x0a,
  616. 0xbc, 0xc9, 0xf6, 0x62 },
  617. { 0xc3, 0x76, 0x2d, 0xf1, 0xca, 0x78, 0x7d, 0x32,
  618. 0xae, 0x47, 0xc1, 0x3b, 0xf1, 0x98, 0x44, 0xcb,
  619. 0xaf, 0x1a, 0xe1, 0x4d, 0x0b, 0x97, 0x6a, 0xfa,
  620. 0xc5, 0x2f, 0xf7, 0xd7, 0x9b, 0xba, 0x9d, 0xe0,
  621. 0xfe, 0xb5, 0x82, 0xd3, 0x39, 0x34, 0xa4, 0xf0,
  622. 0x95, 0x4c, 0xc2, 0x36, 0x3b, 0xc7, 0x3f, 0x78,
  623. 0x62, 0xac, 0x43, 0x0e, 0x64, 0xab, 0xe4, 0x99,
  624. 0xf4, 0x7c, 0x9b, 0x1f },
  625. { 0x5a, 0x8d, 0xef, 0x2f, 0x0c, 0x9e, 0x53, 0xf1,
  626. 0xf7, 0x5d, 0x78, 0x53, 0x65, 0x9e, 0x2a, 0x20,
  627. 0xee, 0xb2, 0xb2, 0x2a, 0xaf, 0xde, 0x64, 0x19,
  628. 0xa0, 0x58, 0xab, 0x4f, 0x6f, 0x74, 0x6b, 0xf4,
  629. 0x0f, 0xc0, 0xc3, 0xb7, 0x80, 0xf2, 0x44, 0x45,
  630. 0x2d, 0xa3, 0xeb, 0xf1, 0xc5, 0xd8, 0x2c, 0xde,
  631. 0xa2, 0x41, 0x89, 0x97, 0x20, 0x0e, 0xf8, 0x2e,
  632. 0x44, 0xae, 0x7e, 0x3f },
  633. };
  634. AT_NONCACHEABLE_SECTION_INIT(static unsigned char tag_test_data[MAX_TESTS * 3][16]) =
  635. {
  636. { 0x58, 0xe2, 0xfc, 0xce, 0xfa, 0x7e, 0x30, 0x61,
  637. 0x36, 0x7f, 0x1d, 0x57, 0xa4, 0xe7, 0x45, 0x5a },
  638. { 0xab, 0x6e, 0x47, 0xd4, 0x2c, 0xec, 0x13, 0xbd,
  639. 0xf5, 0x3a, 0x67, 0xb2, 0x12, 0x57, 0xbd, 0xdf },
  640. { 0x4d, 0x5c, 0x2a, 0xf3, 0x27, 0xcd, 0x64, 0xa6,
  641. 0x2c, 0xf3, 0x5a, 0xbd, 0x2b, 0xa6, 0xfa, 0xb4 },
  642. { 0x5b, 0xc9, 0x4f, 0xbc, 0x32, 0x21, 0xa5, 0xdb,
  643. 0x94, 0xfa, 0xe9, 0x5a, 0xe7, 0x12, 0x1a, 0x47 },
  644. { 0x36, 0x12, 0xd2, 0xe7, 0x9e, 0x3b, 0x07, 0x85,
  645. 0x56, 0x1b, 0xe1, 0x4a, 0xac, 0xa2, 0xfc, 0xcb },
  646. { 0x61, 0x9c, 0xc5, 0xae, 0xff, 0xfe, 0x0b, 0xfa,
  647. 0x46, 0x2a, 0xf4, 0x3c, 0x16, 0x99, 0xd0, 0x50 },
  648. { 0xcd, 0x33, 0xb2, 0x8a, 0xc7, 0x73, 0xf7, 0x4b,
  649. 0xa0, 0x0e, 0xd1, 0xf3, 0x12, 0x57, 0x24, 0x35 },
  650. { 0x2f, 0xf5, 0x8d, 0x80, 0x03, 0x39, 0x27, 0xab,
  651. 0x8e, 0xf4, 0xd4, 0x58, 0x75, 0x14, 0xf0, 0xfb },
  652. { 0x99, 0x24, 0xa7, 0xc8, 0x58, 0x73, 0x36, 0xbf,
  653. 0xb1, 0x18, 0x02, 0x4d, 0xb8, 0x67, 0x4a, 0x14 },
  654. { 0x25, 0x19, 0x49, 0x8e, 0x80, 0xf1, 0x47, 0x8f,
  655. 0x37, 0xba, 0x55, 0xbd, 0x6d, 0x27, 0x61, 0x8c },
  656. { 0x65, 0xdc, 0xc5, 0x7f, 0xcf, 0x62, 0x3a, 0x24,
  657. 0x09, 0x4f, 0xcc, 0xa4, 0x0d, 0x35, 0x33, 0xf8 },
  658. { 0xdc, 0xf5, 0x66, 0xff, 0x29, 0x1c, 0x25, 0xbb,
  659. 0xb8, 0x56, 0x8f, 0xc3, 0xd3, 0x76, 0xa6, 0xd9 },
  660. { 0x53, 0x0f, 0x8a, 0xfb, 0xc7, 0x45, 0x36, 0xb9,
  661. 0xa9, 0x63, 0xb4, 0xf1, 0xc4, 0xcb, 0x73, 0x8b },
  662. { 0xd0, 0xd1, 0xc8, 0xa7, 0x99, 0x99, 0x6b, 0xf0,
  663. 0x26, 0x5b, 0x98, 0xb5, 0xd4, 0x8a, 0xb9, 0x19 },
  664. { 0xb0, 0x94, 0xda, 0xc5, 0xd9, 0x34, 0x71, 0xbd,
  665. 0xec, 0x1a, 0x50, 0x22, 0x70, 0xe3, 0xcc, 0x6c },
  666. { 0x76, 0xfc, 0x6e, 0xce, 0x0f, 0x4e, 0x17, 0x68,
  667. 0xcd, 0xdf, 0x88, 0x53, 0xbb, 0x2d, 0x55, 0x1b },
  668. { 0x3a, 0x33, 0x7d, 0xbf, 0x46, 0xa7, 0x92, 0xc4,
  669. 0x5e, 0x45, 0x49, 0x13, 0xfe, 0x2e, 0xa8, 0xf2 },
  670. { 0xa4, 0x4a, 0x82, 0x66, 0xee, 0x1c, 0x8e, 0xb0,
  671. 0xc8, 0xb5, 0xd4, 0xcf, 0x5a, 0xe9, 0xf1, 0x9a },
  672. };
  673. int mbedtls_gcm_self_test( int verbose )
  674. {
  675. mbedtls_gcm_context ctx;
  676. unsigned char buf[64];
  677. unsigned char tag_buf[16];
  678. int i, j, ret;
  679. mbedtls_cipher_id_t cipher = MBEDTLS_CIPHER_ID_AES;
  680. for( j = 0; j < 3; j++ )
  681. {
  682. int key_len = 128 + 64 * j;
  683. #if defined(MBEDTLS_AES_ALT_NO_192) && !defined(MBEDTLS_AES192_ALT_SW)
  684. if (j == 1)
  685. {
  686. continue;
  687. }
  688. #endif
  689. #if defined(MBEDTLS_AES_ALT_NO_256) && !defined(MBEDTLS_AES256_ALT_SW)
  690. if (j == 2)
  691. {
  692. continue;
  693. }
  694. #endif
  695. for( i = 0; i < MAX_TESTS; i++ )
  696. {
  697. mbedtls_gcm_init( &ctx );
  698. if( verbose != 0 )
  699. mbedtls_printf( " AES-GCM-%3d #%d (%s): ",
  700. key_len, i, "enc" );
  701. ret = mbedtls_gcm_setkey( &ctx, cipher,
  702. key_test_data[key_index_test_data[i]],
  703. key_len );
  704. /*
  705. * AES-192 is an optional feature that may be unavailable when
  706. * there is an alternative underlying implementation i.e. when
  707. * MBEDTLS_AES_ALT is defined.
  708. */
  709. if( ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED && key_len == 192 )
  710. {
  711. mbedtls_printf( "skipped\n" );
  712. break;
  713. }
  714. else if( ret != 0 )
  715. {
  716. goto exit;
  717. }
  718. ret = mbedtls_gcm_crypt_and_tag( &ctx, MBEDTLS_GCM_ENCRYPT,
  719. pt_len_test_data[i],
  720. iv_test_data[iv_index_test_data[i]],
  721. iv_len_test_data[i],
  722. additional_test_data[add_index_test_data[i]],
  723. add_len_test_data[i],
  724. pt_test_data[pt_index_test_data[i]],
  725. buf, 16, tag_buf );
  726. #if defined(MBEDTLS_GCM_ALT)
  727. /* Allow alternative implementations to only support 12-byte nonces. */
  728. if( ret == MBEDTLS_ERR_PLATFORM_FEATURE_UNSUPPORTED &&
  729. iv_len_test_data[i] != 12 )
  730. {
  731. mbedtls_printf( "skipped\n" );
  732. break;
  733. }
  734. #endif /* defined(MBEDTLS_GCM_ALT) */
  735. if( ret != 0 )
  736. goto exit;
  737. if ( memcmp( buf, ct_test_data[j * 6 + i],
  738. pt_len_test_data[i] ) != 0 ||
  739. memcmp( tag_buf, tag_test_data[j * 6 + i], 16 ) != 0 )
  740. {
  741. ret = 1;
  742. goto exit;
  743. }
  744. mbedtls_gcm_free( &ctx );
  745. if( verbose != 0 )
  746. mbedtls_printf( "passed\n" );
  747. mbedtls_gcm_init( &ctx );
  748. if( verbose != 0 )
  749. mbedtls_printf( " AES-GCM-%3d #%d (%s): ",
  750. key_len, i, "dec" );
  751. ret = mbedtls_gcm_setkey( &ctx, cipher,
  752. key_test_data[key_index_test_data[i]],
  753. key_len );
  754. if( ret != 0 )
  755. goto exit;
  756. ret = mbedtls_gcm_crypt_and_tag( &ctx, MBEDTLS_GCM_DECRYPT,
  757. pt_len_test_data[i],
  758. iv_test_data[iv_index_test_data[i]],
  759. iv_len_test_data[i],
  760. additional_test_data[add_index_test_data[i]],
  761. add_len_test_data[i],
  762. ct_test_data[j * 6 + i], buf, 16, tag_buf );
  763. if( ret != 0 )
  764. goto exit;
  765. if( memcmp( buf, pt_test_data[pt_index_test_data[i]],
  766. pt_len_test_data[i] ) != 0 ||
  767. memcmp( tag_buf, tag_test_data[j * 6 + i], 16 ) != 0 )
  768. {
  769. ret = 1;
  770. goto exit;
  771. }
  772. mbedtls_gcm_free( &ctx );
  773. if( verbose != 0 )
  774. mbedtls_printf( "passed\n" );
  775. mbedtls_gcm_init( &ctx );
  776. if( verbose != 0 )
  777. mbedtls_printf( " AES-GCM-%3d #%d split (%s): ",
  778. key_len, i, "enc" );
  779. ret = mbedtls_gcm_setkey( &ctx, cipher,
  780. key_test_data[key_index_test_data[i]],
  781. key_len );
  782. if( ret != 0 )
  783. goto exit;
  784. ret = mbedtls_gcm_starts( &ctx, MBEDTLS_GCM_ENCRYPT,
  785. iv_test_data[iv_index_test_data[i]],
  786. iv_len_test_data[i],
  787. additional_test_data[add_index_test_data[i]],
  788. add_len_test_data[i] );
  789. if( ret != 0 )
  790. goto exit;
  791. if( pt_len_test_data[i] > 32 )
  792. {
  793. size_t rest_len = pt_len_test_data[i] - 32;
  794. ret = mbedtls_gcm_update( &ctx, 32,
  795. pt_test_data[pt_index_test_data[i]],
  796. buf );
  797. if( ret != 0 )
  798. goto exit;
  799. ret = mbedtls_gcm_update( &ctx, rest_len,
  800. pt_test_data[pt_index_test_data[i]] + 32,
  801. buf + 32 );
  802. if( ret != 0 )
  803. goto exit;
  804. }
  805. else
  806. {
  807. ret = mbedtls_gcm_update( &ctx, pt_len_test_data[i],
  808. pt_test_data[pt_index_test_data[i]],
  809. buf );
  810. if( ret != 0 )
  811. goto exit;
  812. }
  813. ret = mbedtls_gcm_finish( &ctx, tag_buf, 16 );
  814. if( ret != 0 )
  815. goto exit;
  816. if( memcmp( buf, ct_test_data[j * 6 + i],
  817. pt_len_test_data[i] ) != 0 ||
  818. memcmp( tag_buf, tag_test_data[j * 6 + i], 16 ) != 0 )
  819. {
  820. ret = 1;
  821. goto exit;
  822. }
  823. mbedtls_gcm_free( &ctx );
  824. if( verbose != 0 )
  825. mbedtls_printf( "passed\n" );
  826. mbedtls_gcm_init( &ctx );
  827. if( verbose != 0 )
  828. mbedtls_printf( " AES-GCM-%3d #%d split (%s): ",
  829. key_len, i, "dec" );
  830. ret = mbedtls_gcm_setkey( &ctx, cipher,
  831. key_test_data[key_index_test_data[i]],
  832. key_len );
  833. if( ret != 0 )
  834. goto exit;
  835. ret = mbedtls_gcm_starts( &ctx, MBEDTLS_GCM_DECRYPT,
  836. iv_test_data[iv_index_test_data[i]],
  837. iv_len_test_data[i],
  838. additional_test_data[add_index_test_data[i]],
  839. add_len_test_data[i] );
  840. if( ret != 0 )
  841. goto exit;
  842. if( pt_len_test_data[i] > 32 )
  843. {
  844. size_t rest_len = pt_len_test_data[i] - 32;
  845. ret = mbedtls_gcm_update( &ctx, 32, ct_test_data[j * 6 + i],
  846. buf );
  847. if( ret != 0 )
  848. goto exit;
  849. ret = mbedtls_gcm_update( &ctx, rest_len,
  850. ct_test_data[j * 6 + i] + 32,
  851. buf + 32 );
  852. if( ret != 0 )
  853. goto exit;
  854. }
  855. else
  856. {
  857. ret = mbedtls_gcm_update( &ctx, pt_len_test_data[i],
  858. ct_test_data[j * 6 + i],
  859. buf );
  860. if( ret != 0 )
  861. goto exit;
  862. }
  863. ret = mbedtls_gcm_finish( &ctx, tag_buf, 16 );
  864. if( ret != 0 )
  865. goto exit;
  866. if( memcmp( buf, pt_test_data[pt_index_test_data[i]],
  867. pt_len_test_data[i] ) != 0 ||
  868. memcmp( tag_buf, tag_test_data[j * 6 + i], 16 ) != 0 )
  869. {
  870. ret = 1;
  871. goto exit;
  872. }
  873. mbedtls_gcm_free( &ctx );
  874. if( verbose != 0 )
  875. mbedtls_printf( "passed\n" );
  876. }
  877. }
  878. if( verbose != 0 )
  879. mbedtls_printf( "\n" );
  880. ret = 0;
  881. exit:
  882. if( ret != 0 )
  883. {
  884. if( verbose != 0 )
  885. mbedtls_printf( "failed\n" );
  886. mbedtls_gcm_free( &ctx );
  887. }
  888. return( ret );
  889. }
  890. #endif /* MBEDTLS_SELF_TEST && MBEDTLS_AES_C */
  891. #endif /* MBEDTLS_GCM_C */