2 /* ====================================================================
3 * Copyright (c) 2012 The OpenSSL Project. All rights reserved.
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
9 * 1. Redistributions of source code must retain the above copyright
10 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in
14 * the documentation and/or other materials provided with the
17 * 3. All advertising materials mentioning features or use of this
18 * software must display the following acknowledgment:
19 * "This product includes software developed by the OpenSSL Project
20 * for use in the OpenSSL Toolkit. (http://www.openssl.org/)"
22 * 4. The names "OpenSSL Toolkit" and "OpenSSL Project" must not be used to
23 * endorse or promote products derived from this software without
24 * prior written permission. For written permission, please contact
25 * openssl-core@openssl.org.
27 * 5. Products derived from this software may not be called "OpenSSL"
28 * nor may "OpenSSL" appear in their names without prior written
29 * permission of the OpenSSL Project.
31 * 6. Redistributions of any form whatsoever must retain the following
33 * "This product includes software developed by the OpenSSL Project
34 * for use in the OpenSSL Toolkit (http://www.openssl.org/)"
36 * THIS SOFTWARE IS PROVIDED BY THE OpenSSL PROJECT ``AS IS'' AND ANY
37 * EXPRESSED OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
38 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
39 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE OpenSSL PROJECT OR
40 * ITS CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
41 * SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
42 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
43 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
44 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
45 * STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
46 * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
47 * OF THE POSSIBILITY OF SUCH DAMAGE.
48 * ====================================================================
50 * This product includes cryptographic software written by Eric Young
51 * (eay@cryptsoft.com). This product includes software written by Tim
52 * Hudson (tjh@cryptsoft.com).
60 #include <openssl/md5.h>
61 #include <openssl/sha.h>
63 /* MAX_HASH_BIT_COUNT_BYTES is the maximum number of bytes in the hash's length
64 * field. (SHA-384/512 have 128-bit length.) */
65 #define MAX_HASH_BIT_COUNT_BYTES 16
67 /* MAX_HASH_BLOCK_SIZE is the maximum hash block size that we'll support.
68 * Currently SHA-384/512 has a 128-byte block size and that's the largest
69 * supported by TLS.) */
70 #define MAX_HASH_BLOCK_SIZE 128
72 /* Some utility functions are needed:
74 * These macros return the given value with the MSB copied to all the other
75 * bits. They use the fact that arithmetic shift shifts-in the sign bit.
76 * However, this is not ensured by the C standard so you may need to replace
77 * them with something else on odd CPUs. */
78 #define DUPLICATE_MSB_TO_ALL(x) ( (unsigned)( (int)(x) >> (sizeof(int)*8-1) ) )
79 #define DUPLICATE_MSB_TO_ALL_8(x) ((unsigned char)(DUPLICATE_MSB_TO_ALL(x)))
81 /* constant_time_ge returns 0xff if a>=b and 0x00 otherwise. */
82 static unsigned constant_time_ge(unsigned a, unsigned b)
85 return DUPLICATE_MSB_TO_ALL(~a);
88 /* constant_time_eq_8 returns 0xff if a==b and 0x00 otherwise. */
89 static unsigned char constant_time_eq_8(unsigned char a, unsigned char b)
93 return DUPLICATE_MSB_TO_ALL_8(c);
96 /* ssl3_cbc_remove_padding removes padding from the decrypted, SSLv3, CBC
97 * record in |rec| by updating |rec->length| in constant time.
99 * block_size: the block size of the cipher used to encrypt the record.
101 * 0: (in non-constant time) if the record is publicly invalid.
102 * 1: if the padding was valid
104 int ssl3_cbc_remove_padding(const SSL* s,
109 unsigned padding_length, good;
110 const unsigned overhead = 1 /* padding length byte */ + mac_size;
112 /* These lengths are all public so we can test them in non-constant
114 if (overhead > rec->length)
117 padding_length = rec->data[rec->length-1];
118 good = constant_time_ge(rec->length, padding_length+overhead);
119 /* SSLv3 requires that the padding is minimal. */
120 good &= constant_time_ge(block_size, padding_length+1);
121 rec->length -= good & (padding_length+1);
122 return (int)((good & 1) | (~good & -1));
125 /* tls1_cbc_remove_padding removes the CBC padding from the decrypted, TLS, CBC
126 * record in |rec| in constant time and returns 1 if the padding is valid and
127 * -1 otherwise. It also removes any explicit IV from the start of the record
128 * without leaking any timing about whether there was enough space after the
129 * padding was removed.
131 * block_size: the block size of the cipher used to encrypt the record.
133 * 0: (in non-constant time) if the record is publicly invalid.
134 * 1: if the padding was valid
136 int tls1_cbc_remove_padding(const SSL* s,
141 unsigned padding_length, good, to_check, i;
142 const char has_explicit_iv =
143 s->version >= TLS1_1_VERSION || s->version == DTLS1_VERSION;
144 const unsigned overhead = 1 /* padding length byte */ +
146 (has_explicit_iv ? block_size : 0);
148 /* These lengths are all public so we can test them in non-constant
150 if (overhead > rec->length)
153 padding_length = rec->data[rec->length-1];
155 /* NB: if compression is in operation the first packet may not be of
156 * even length so the padding bug check cannot be performed. This bug
157 * workaround has been around since SSLeay so hopefully it is either
158 * fixed now or no buggy implementation supports compression [steve]
160 if ( (s->options&SSL_OP_TLS_BLOCK_PADDING_BUG) && !s->expand)
162 /* First packet is even in size, so check */
163 if ((memcmp(s->s3->read_sequence, "\0\0\0\0\0\0\0\0",8) == 0) &&
164 !(padding_length & 1))
166 s->s3->flags|=TLS1_FLAGS_TLS_PADDING_BUG;
168 if ((s->s3->flags & TLS1_FLAGS_TLS_PADDING_BUG) &&
175 good = constant_time_ge(rec->length, overhead+padding_length);
176 /* The padding consists of a length byte at the end of the record and
177 * then that many bytes of padding, all with the same value as the
178 * length byte. Thus, with the length byte included, there are i+1
181 * We can't check just |padding_length+1| bytes because that leaks
182 * decrypted information. Therefore we always have to check the maximum
183 * amount of padding possible. (Again, the length of the record is
184 * public information so we can use it.) */
185 to_check = 255; /* maximum amount of padding. */
186 if (to_check > rec->length-1)
187 to_check = rec->length-1;
189 for (i = 0; i < to_check; i++)
191 unsigned char mask = constant_time_ge(padding_length, i);
192 unsigned char b = rec->data[rec->length-1-i];
193 /* The final |padding_length+1| bytes should all have the value
194 * |padding_length|. Therefore the XOR should be zero. */
195 good &= ~(mask&(padding_length ^ b));
198 /* If any of the final |padding_length+1| bytes had the wrong value,
199 * one or more of the lower eight bits of |good| will be cleared. We
200 * AND the bottom 8 bits together and duplicate the result to all the
205 good <<= sizeof(good)*8-1;
206 good = DUPLICATE_MSB_TO_ALL(good);
208 rec->length -= good & (padding_length+1);
210 /* We can always safely skip the explicit IV. We check at the beginning
211 * of this function that the record has at least enough space for the
212 * IV, MAC and padding length byte. (These can be checked in
213 * non-constant time because it's all public information.) So, if the
214 * padding was invalid, then we didn't change |rec->length| and this is
215 * safe. If the padding was valid then we know that we have at least
216 * overhead+padding_length bytes of space and so this is still safe
217 * because overhead accounts for the explicit IV. */
220 rec->data += block_size;
221 rec->input += block_size;
222 rec->length -= block_size;
223 rec->orig_len -= block_size;
226 return (int)((good & 1) | (~good & -1));
229 #if defined(_M_AMD64) || defined(__x86_64__)
230 #define CBC_MAC_ROTATE_IN_PLACE
233 /* ssl3_cbc_copy_mac copies |md_size| bytes from the end of |rec| to |out| in
234 * constant time (independent of the concrete value of rec->length, which may
235 * vary within a 256-byte window).
237 * ssl3_cbc_remove_padding or tls1_cbc_remove_padding must be called prior to
241 * rec->orig_len >= md_size
242 * md_size <= EVP_MAX_MD_SIZE
244 * If CBC_MAC_ROTATE_IN_PLACE is defined then the rotation is performed with
245 * variable accesses in a 64-byte-aligned buffer. Assuming that this fits into
246 * a single cache-line, then the variable memory accesses don't actually affect
247 * the timing. This has been tested to be true on Intel amd64 chips.
249 void ssl3_cbc_copy_mac(unsigned char* out,
250 const SSL3_RECORD *rec,
253 #if defined(CBC_MAC_ROTATE_IN_PLACE)
254 unsigned char rotated_mac_buf[EVP_MAX_MD_SIZE*2];
255 unsigned char *rotated_mac;
257 unsigned char rotated_mac[EVP_MAX_MD_SIZE];
260 /* mac_end is the index of |rec->data| just after the end of the MAC. */
261 unsigned mac_end = rec->length;
262 unsigned mac_start = mac_end - md_size;
263 /* scan_start contains the number of bytes that we can ignore because
264 * the MAC's position can only vary by 255 bytes. */
265 unsigned scan_start = 0;
267 unsigned div_spoiler;
268 unsigned rotate_offset;
270 OPENSSL_assert(rec->orig_len >= md_size);
271 OPENSSL_assert(md_size <= EVP_MAX_MD_SIZE);
273 #if defined(CBC_MAC_ROTATE_IN_PLACE)
274 rotated_mac = (unsigned char*) (((intptr_t)(rotated_mac_buf + 64)) & ~63);
277 /* This information is public so it's safe to branch based on it. */
278 if (rec->orig_len > md_size + 255 + 1)
279 scan_start = rec->orig_len - (md_size + 255 + 1);
280 /* div_spoiler contains a multiple of md_size that is used to cause the
281 * modulo operation to be constant time. Without this, the time varies
282 * based on the amount of padding when running on Intel chips at least.
284 * The aim of right-shifting md_size is so that the compiler doesn't
285 * figure out that it can remove div_spoiler as that would require it
286 * to prove that md_size is always even, which I hope is beyond it. */
287 div_spoiler = md_size >> 1;
288 div_spoiler <<= (sizeof(div_spoiler)-1)*8;
289 rotate_offset = (div_spoiler + mac_start - scan_start) % md_size;
291 memset(rotated_mac, 0, md_size);
292 for (i = scan_start; i < rec->orig_len;)
294 for (j = 0; j < md_size && i < rec->orig_len; i++, j++)
296 unsigned char mac_started = constant_time_ge(i, mac_start);
297 unsigned char mac_ended = constant_time_ge(i, mac_end);
300 rotated_mac[j] |= b & mac_started & ~mac_ended;
304 /* Now rotate the MAC */
305 #if defined(CBC_MAC_ROTATE_IN_PLACE)
307 for (i = 0; i < md_size; i++)
309 unsigned char offset = (div_spoiler + rotate_offset + i) % md_size;
310 out[j++] = rotated_mac[offset];
313 memset(out, 0, md_size);
314 for (i = 0; i < md_size; i++)
316 unsigned char offset = (div_spoiler + md_size - rotate_offset + i) % md_size;
317 for (j = 0; j < md_size; j++)
318 out[j] |= rotated_mac[i] & constant_time_eq_8(j, offset);
323 /* These functions serialize the state of a hash and thus perform the standard
324 * "final" operation without adding the padding and length that such a function
326 static void tls1_md5_final_raw(void* ctx, unsigned char *md_out)
335 static void tls1_sha1_final_raw(void* ctx, unsigned char *md_out)
338 l2n(sha1->h0, md_out);
339 l2n(sha1->h1, md_out);
340 l2n(sha1->h2, md_out);
341 l2n(sha1->h3, md_out);
342 l2n(sha1->h4, md_out);
345 static void tls1_sha256_final_raw(void* ctx, unsigned char *md_out)
347 SHA256_CTX *sha256 = ctx;
350 for (i = 0; i < 8; i++)
352 l2n(sha256->h[i], md_out);
356 static void tls1_sha512_final_raw(void* ctx, unsigned char *md_out)
358 SHA512_CTX *sha512 = ctx;
361 for (i = 0; i < 8; i++)
363 l2n8(sha512->h[i], md_out);
367 /* ssl3_cbc_record_digest_supported returns 1 iff |ctx| uses a hash function
368 * which ssl3_cbc_digest_record supports. */
369 char ssl3_cbc_record_digest_supported(const EVP_MD_CTX *ctx)
375 switch (ctx->digest->type)
389 /* ssl3_cbc_digest_record computes the MAC of a decrypted, padded SSLv3/TLS
392 * ctx: the EVP_MD_CTX from which we take the hash function.
393 * ssl3_cbc_record_digest_supported must return true for this EVP_MD_CTX.
394 * md_out: the digest output. At most EVP_MAX_MD_SIZE bytes will be written.
395 * md_out_size: if non-NULL, the number of output bytes is written here.
396 * header: the 13-byte, TLS record header.
397 * data: the record data itself, less any preceeding explicit IV.
398 * data_plus_mac_size: the secret, reported length of the data and MAC
399 * once the padding has been removed.
400 * data_plus_mac_plus_padding_size: the public length of the whole
401 * record, including padding.
402 * is_sslv3: non-zero if we are to use SSLv3. Otherwise, TLS.
404 * On entry: by virtue of having been through one of the remove_padding
405 * functions, above, we know that data_plus_mac_size is large enough to contain
406 * a padding byte and MAC. (If the padding was invalid, it might contain the
408 void ssl3_cbc_digest_record(
409 const EVP_MD_CTX *ctx,
410 unsigned char* md_out,
412 const unsigned char header[13],
413 const unsigned char *data,
414 size_t data_plus_mac_size,
415 size_t data_plus_mac_plus_padding_size,
416 const unsigned char *mac_secret,
417 unsigned mac_secret_length,
420 unsigned char md_state[sizeof(SHA512_CTX)];
421 void (*md_final_raw)(void *ctx, unsigned char *md_out);
422 void (*md_transform)(void *ctx, const unsigned char *block);
423 unsigned md_size, md_block_size = 64;
424 unsigned sslv3_pad_length = 40, header_length, variance_blocks,
425 len, max_mac_bytes, num_blocks,
426 num_starting_blocks, k, mac_end_offset, c, index_a, index_b;
428 unsigned char length_bytes[MAX_HASH_BIT_COUNT_BYTES];
429 /* hmac_pad is the masked HMAC key. */
430 unsigned char hmac_pad[MAX_HASH_BLOCK_SIZE];
431 unsigned char first_block[MAX_HASH_BLOCK_SIZE];
432 unsigned char mac_out[EVP_MAX_MD_SIZE];
433 unsigned i, j, md_out_size_u;
435 /* mdLengthSize is the number of bytes in the length field that terminates
437 unsigned md_length_size = 8;
439 /* This is a, hopefully redundant, check that allows us to forget about
440 * many possible overflows later in this function. */
441 OPENSSL_assert(data_plus_mac_plus_padding_size < 1024*1024);
443 switch (ctx->digest->type)
446 MD5_Init((MD5_CTX*)md_state);
447 md_final_raw = tls1_md5_final_raw;
448 md_transform = (void(*)(void *ctx, const unsigned char *block)) MD5_Transform;
450 sslv3_pad_length = 48;
453 SHA1_Init((SHA_CTX*)md_state);
454 md_final_raw = tls1_sha1_final_raw;
455 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA1_Transform;
459 SHA224_Init((SHA256_CTX*)md_state);
460 md_final_raw = tls1_sha256_final_raw;
461 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA256_Transform;
465 SHA256_Init((SHA256_CTX*)md_state);
466 md_final_raw = tls1_sha256_final_raw;
467 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA256_Transform;
471 SHA384_Init((SHA512_CTX*)md_state);
472 md_final_raw = tls1_sha512_final_raw;
473 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA512_Transform;
479 SHA512_Init((SHA512_CTX*)md_state);
480 md_final_raw = tls1_sha512_final_raw;
481 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA512_Transform;
487 /* ssl3_cbc_record_digest_supported should have been
488 * called first to check that the hash function is
496 OPENSSL_assert(md_length_size <= MAX_HASH_BIT_COUNT_BYTES);
497 OPENSSL_assert(md_block_size <= MAX_HASH_BLOCK_SIZE);
498 OPENSSL_assert(md_size <= EVP_MAX_MD_SIZE);
506 8 /* sequence number */ +
507 1 /* record type */ +
508 2 /* record length */;
511 /* variance_blocks is the number of blocks of the hash that we have to
512 * calculate in constant time because they could be altered by the
515 * In SSLv3, the padding must be minimal so the end of the plaintext
516 * varies by, at most, 15+20 = 35 bytes. (We conservatively assume that
517 * the MAC size varies from 0..20 bytes.) In case the 9 bytes of hash
518 * termination (0x80 + 64-bit length) don't fit in the final block, we
519 * say that the final two blocks can vary based on the padding.
521 * TLSv1 has MACs up to 48 bytes long (SHA-384) and the padding is not
522 * required to be minimal. Therefore we say that the final six blocks
523 * can vary based on the padding.
525 * Later in the function, if the message is short and there obviously
526 * cannot be this many blocks then variance_blocks can be reduced. */
527 variance_blocks = is_sslv3 ? 2 : 6;
528 /* From now on we're dealing with the MAC, which conceptually has 13
529 * bytes of `header' before the start of the data (TLS) or 71/75 bytes
531 len = data_plus_mac_plus_padding_size + header_length;
532 /* max_mac_bytes contains the maximum bytes of bytes in the MAC, including
533 * |header|, assuming that there's no padding. */
534 max_mac_bytes = len - md_size - 1;
535 /* num_blocks is the maximum number of hash blocks. */
536 num_blocks = (max_mac_bytes + 1 + md_length_size + md_block_size - 1) / md_block_size;
537 /* In order to calculate the MAC in constant time we have to handle
538 * the final blocks specially because the padding value could cause the
539 * end to appear somewhere in the final |variance_blocks| blocks and we
540 * can't leak where. However, |num_starting_blocks| worth of data can
541 * be hashed right away because no padding value can affect whether
542 * they are plaintext. */
543 num_starting_blocks = 0;
544 /* k is the starting byte offset into the conceptual header||data where
545 * we start processing. */
547 /* mac_end_offset is the index just past the end of the data to be
549 mac_end_offset = data_plus_mac_size + header_length - md_size;
550 /* c is the index of the 0x80 byte in the final hash block that
551 * contains application data. */
552 c = mac_end_offset % md_block_size;
553 /* index_a is the hash block number that contains the 0x80 terminating
555 index_a = mac_end_offset / md_block_size;
556 /* index_b is the hash block number that contains the 64-bit hash
557 * length, in bits. */
558 index_b = (mac_end_offset + md_length_size) / md_block_size;
559 /* bits is the hash-length in bits. It includes the additional hash
560 * block for the masked HMAC key, or whole of |header| in the case of
563 /* For SSLv3, if we're going to have any starting blocks then we need
564 * at least two because the header is larger than a single block. */
565 if (num_blocks > variance_blocks + (is_sslv3 ? 1 : 0))
567 num_starting_blocks = num_blocks - variance_blocks;
568 k = md_block_size*num_starting_blocks;
571 bits = 8*mac_end_offset;
574 /* Compute the initial HMAC block. For SSLv3, the padding and
575 * secret bytes are included in |header| because they take more
576 * than a single block. */
577 bits += 8*md_block_size;
578 memset(hmac_pad, 0, md_block_size);
579 OPENSSL_assert(mac_secret_length <= sizeof(hmac_pad));
580 memcpy(hmac_pad, mac_secret, mac_secret_length);
581 for (i = 0; i < md_block_size; i++)
584 md_transform(md_state, hmac_pad);
588 if (md_length_size == 16)
590 memset(length_bytes, 0, 8);
593 for (i = 0; i < 8; i++)
594 length_bytes[i+j] = bits >> (8*(7-i));
600 /* The SSLv3 header is larger than a single block.
601 * overhang is the number of bytes beyond a single
602 * block that the header consumes: either 7 bytes
603 * (SHA1) or 11 bytes (MD5). */
604 unsigned overhang = header_length-md_block_size;
605 md_transform(md_state, header);
606 memcpy(first_block, header + md_block_size, overhang);
607 memcpy(first_block + overhang, data, md_block_size-overhang);
608 md_transform(md_state, first_block);
609 for (i = 1; i < k/md_block_size - 1; i++)
610 md_transform(md_state, data + md_block_size*i - overhang);
614 /* k is a multiple of md_block_size. */
615 memcpy(first_block, header, 13);
616 memcpy(first_block+13, data, md_block_size-13);
617 md_transform(md_state, first_block);
618 for (i = 1; i < k/md_block_size; i++)
619 md_transform(md_state, data + md_block_size*i - 13);
623 memset(mac_out, 0, sizeof(mac_out));
625 /* We now process the final hash blocks. For each block, we construct
626 * it in constant time. If the |i==index_a| then we'll include the 0x80
627 * bytes and zero pad etc. For each block we selectively copy it, in
628 * constant time, to |mac_out|. */
629 for (i = num_starting_blocks; i <= num_starting_blocks+variance_blocks; i++)
631 unsigned char block[MAX_HASH_BLOCK_SIZE];
632 unsigned char is_block_a = constant_time_eq_8(i, index_a);
633 unsigned char is_block_b = constant_time_eq_8(i, index_b);
634 for (j = 0; j < md_block_size; j++)
636 unsigned char b = 0, is_past_c, is_past_cp1;
637 if (k < header_length)
639 else if (k < data_plus_mac_plus_padding_size + header_length)
640 b = data[k-header_length];
643 is_past_c = is_block_a & constant_time_ge(j, c);
644 is_past_cp1 = is_block_a & constant_time_ge(j, c+1);
645 /* If this is the block containing the end of the
646 * application data, and we are at the offset for the
647 * 0x80 value, then overwrite b with 0x80. */
648 b = (b&~is_past_c) | (0x80&is_past_c);
649 /* If this the the block containing the end of the
650 * application data and we're past the 0x80 value then
651 * just write zero. */
653 /* If this is index_b (the final block), but not
654 * index_a (the end of the data), then the 64-bit
655 * length didn't fit into index_a and we're having to
656 * add an extra block of zeros. */
657 b &= ~is_block_b | is_block_a;
659 /* The final bytes of one of the blocks contains the
661 if (j >= md_block_size - md_length_size)
663 /* If this is index_b, write a length byte. */
664 b = (b&~is_block_b) | (is_block_b&length_bytes[j-(md_block_size-md_length_size)]);
669 md_transform(md_state, block);
670 md_final_raw(md_state, block);
671 /* If this is index_b, copy the hash value to |mac_out|. */
672 for (j = 0; j < md_size; j++)
673 mac_out[j] |= block[j]&is_block_b;
676 EVP_MD_CTX_init(&md_ctx);
677 EVP_DigestInit_ex(&md_ctx, ctx->digest, NULL /* engine */);
680 /* We repurpose |hmac_pad| to contain the SSLv3 pad2 block. */
681 memset(hmac_pad, 0x5c, sslv3_pad_length);
683 EVP_DigestUpdate(&md_ctx, mac_secret, mac_secret_length);
684 EVP_DigestUpdate(&md_ctx, hmac_pad, sslv3_pad_length);
685 EVP_DigestUpdate(&md_ctx, mac_out, md_size);
689 /* Complete the HMAC in the standard manner. */
690 for (i = 0; i < md_block_size; i++)
693 EVP_DigestUpdate(&md_ctx, hmac_pad, md_block_size);
694 EVP_DigestUpdate(&md_ctx, mac_out, md_size);
696 EVP_DigestFinal(&md_ctx, md_out, &md_out_size_u);
698 *md_out_size = md_out_size_u;
699 EVP_MD_CTX_cleanup(&md_ctx);
704 /* Due to the need to use EVP in FIPS mode we can't reimplement digests but
705 * we can ensure the number of blocks processed is equal for all cases
706 * by digesting additional data.
709 void tls_fips_digest_extra(
710 const EVP_CIPHER_CTX *cipher_ctx, EVP_MD_CTX *mac_ctx,
711 const unsigned char *data, size_t data_len, size_t orig_len)
713 size_t block_size, digest_pad, blocks_data, blocks_orig;
714 if (EVP_CIPHER_CTX_mode(cipher_ctx) != EVP_CIPH_CBC_MODE)
716 block_size = EVP_MD_CTX_block_size(mac_ctx);
717 /* We are in FIPS mode if we get this far so we know we have only SHA*
718 * digests and TLS to deal with.
719 * Minimum digest padding length is 17 for SHA384/SHA512 and 9
721 * Additional header is 13 bytes. To get the number of digest blocks
722 * processed round up the amount of data plus padding to the nearest
723 * block length. Block length is 128 for SHA384/SHA512 and 64 otherwise.
725 * blocks = (payload_len + digest_pad + 13 + block_size - 1)/block_size
727 * blocks = (payload_len + digest_pad + 12)/block_size + 1
728 * HMAC adds a constant overhead.
729 * We're ultimately only interested in differences so this becomes
730 * blocks = (payload_len + 29)/128
731 * for SHA384/SHA512 and
732 * blocks = (payload_len + 21)/64
735 digest_pad = block_size == 64 ? 21 : 29;
736 blocks_orig = (orig_len + digest_pad)/block_size;
737 blocks_data = (data_len + digest_pad)/block_size;
738 /* MAC enough blocks to make up the difference between the original
739 * and actual lengths plus one extra block to ensure this is never a
740 * no op. The "data" pointer should always have enough space to
741 * perform this operation as it is large enough for a maximum
744 EVP_DigestSignUpdate(mac_ctx, data,
745 (blocks_orig - blocks_data + 1) * block_size);