gcm.c 30 KB

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