gcm.c 33 KB

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