gcm.c 30 KB

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