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).
56 #include "../crypto/constant_time_locl.h"
59 #include <openssl/md5.h>
60 #include <openssl/sha.h>
62 /* MAX_HASH_BIT_COUNT_BYTES is the maximum number of bytes in the hash's length
63 * field. (SHA-384/512 have 128-bit length.) */
64 #define MAX_HASH_BIT_COUNT_BYTES 16
66 /* MAX_HASH_BLOCK_SIZE is the maximum hash block size that we'll support.
67 * Currently SHA-384/512 has a 128-byte block size and that's the largest
68 * supported by TLS.) */
69 #define MAX_HASH_BLOCK_SIZE 128
72 * ssl3_cbc_remove_padding removes padding from the decrypted, SSLv3, CBC
73 * record in |rec| by updating |rec->length| in constant time.
75 * block_size: the block size of the cipher used to encrypt the record.
77 * 0: (in non-constant time) if the record is publicly invalid.
78 * 1: if the padding was valid
81 int ssl3_cbc_remove_padding(const SSL* s,
86 unsigned padding_length, good;
87 const unsigned overhead = 1 /* padding length byte */ + mac_size;
89 /* These lengths are all public so we can test them in non-constant
91 if (overhead > rec->length)
94 padding_length = rec->data[rec->length-1];
95 good = constant_time_ge(rec->length, padding_length+overhead);
96 /* SSLv3 requires that the padding is minimal. */
97 good &= constant_time_ge(block_size, padding_length+1);
98 rec->length -= good & (padding_length+1);
99 return constant_time_select_int(good, 1, -1);
103 * tls1_cbc_remove_padding removes the CBC padding from the decrypted, TLS, CBC
104 * record in |rec| in constant time and returns 1 if the padding is valid and
105 * -1 otherwise. It also removes any explicit IV from the start of the record
106 * without leaking any timing about whether there was enough space after the
107 * padding was removed.
109 * block_size: the block size of the cipher used to encrypt the record.
111 * 0: (in non-constant time) if the record is publicly invalid.
112 * 1: if the padding was valid
115 int tls1_cbc_remove_padding(const SSL* s,
120 unsigned padding_length, good, to_check, i;
121 const unsigned overhead = 1 /* padding length byte */ + mac_size;
122 /* Check if version requires explicit IV */
123 if (SSL_USE_EXPLICIT_IV(s))
125 /* These lengths are all public so we can test them in
128 if (overhead + block_size > rec->length)
130 /* We can now safely skip explicit IV */
131 rec->data += block_size;
132 rec->input += block_size;
133 rec->length -= block_size;
134 rec->orig_len -= block_size;
136 else if (overhead > rec->length)
139 padding_length = rec->data[rec->length-1];
141 /* NB: if compression is in operation the first packet may not be of
142 * even length so the padding bug check cannot be performed. This bug
143 * workaround has been around since SSLeay so hopefully it is either
144 * fixed now or no buggy implementation supports compression [steve]
146 if ( (s->options&SSL_OP_TLS_BLOCK_PADDING_BUG) && !s->expand)
148 /* First packet is even in size, so check */
149 if ((memcmp(s->s3->read_sequence, "\0\0\0\0\0\0\0\0",8) == 0) &&
150 !(padding_length & 1))
152 s->s3->flags|=TLS1_FLAGS_TLS_PADDING_BUG;
154 if ((s->s3->flags & TLS1_FLAGS_TLS_PADDING_BUG) &&
161 if (EVP_CIPHER_flags(s->enc_read_ctx->cipher)&EVP_CIPH_FLAG_AEAD_CIPHER)
163 /* padding is already verified */
164 rec->length -= padding_length + 1;
168 good = constant_time_ge(rec->length, overhead+padding_length);
169 /* The padding consists of a length byte at the end of the record and
170 * then that many bytes of padding, all with the same value as the
171 * length byte. Thus, with the length byte included, there are i+1
174 * We can't check just |padding_length+1| bytes because that leaks
175 * decrypted information. Therefore we always have to check the maximum
176 * amount of padding possible. (Again, the length of the record is
177 * public information so we can use it.) */
178 to_check = 255; /* maximum amount of padding. */
179 if (to_check > rec->length-1)
180 to_check = rec->length-1;
182 for (i = 0; i < to_check; i++)
184 unsigned char mask = constant_time_ge_8(padding_length, i);
185 unsigned char b = rec->data[rec->length-1-i];
186 /* The final |padding_length+1| bytes should all have the value
187 * |padding_length|. Therefore the XOR should be zero. */
188 good &= ~(mask&(padding_length ^ b));
191 /* If any of the final |padding_length+1| bytes had the wrong value,
192 * one or more of the lower eight bits of |good| will be cleared.
194 good = constant_time_eq(0xff, good & 0xff);
195 rec->length -= good & (padding_length+1);
197 return constant_time_select_int(good, 1, -1);
201 * ssl3_cbc_copy_mac copies |md_size| bytes from the end of |rec| to |out| in
202 * constant time (independent of the concrete value of rec->length, which may
203 * vary within a 256-byte window).
205 * ssl3_cbc_remove_padding or tls1_cbc_remove_padding must be called prior to
209 * rec->orig_len >= md_size
210 * md_size <= EVP_MAX_MD_SIZE
212 * If CBC_MAC_ROTATE_IN_PLACE is defined then the rotation is performed with
213 * variable accesses in a 64-byte-aligned buffer. Assuming that this fits into
214 * a single or pair of cache-lines, then the variable memory accesses don't
215 * actually affect the timing. CPUs with smaller cache-lines [if any] are
216 * not multi-core and are not considered vulnerable to cache-timing attacks.
218 #define CBC_MAC_ROTATE_IN_PLACE
220 void ssl3_cbc_copy_mac(unsigned char* out,
221 const SSL3_RECORD *rec,
224 #if defined(CBC_MAC_ROTATE_IN_PLACE)
225 unsigned char rotated_mac_buf[64+EVP_MAX_MD_SIZE];
226 unsigned char *rotated_mac;
228 unsigned char rotated_mac[EVP_MAX_MD_SIZE];
231 /* mac_end is the index of |rec->data| just after the end of the MAC. */
232 unsigned mac_end = rec->length;
233 unsigned mac_start = mac_end - md_size;
234 /* scan_start contains the number of bytes that we can ignore because
235 * the MAC's position can only vary by 255 bytes. */
236 unsigned scan_start = 0;
238 unsigned div_spoiler;
239 unsigned rotate_offset;
241 OPENSSL_assert(rec->orig_len >= md_size);
242 OPENSSL_assert(md_size <= EVP_MAX_MD_SIZE);
244 #if defined(CBC_MAC_ROTATE_IN_PLACE)
245 rotated_mac = rotated_mac_buf + ((0-(size_t)rotated_mac_buf)&63);
248 /* This information is public so it's safe to branch based on it. */
249 if (rec->orig_len > md_size + 255 + 1)
250 scan_start = rec->orig_len - (md_size + 255 + 1);
251 /* div_spoiler contains a multiple of md_size that is used to cause the
252 * modulo operation to be constant time. Without this, the time varies
253 * based on the amount of padding when running on Intel chips at least.
255 * The aim of right-shifting md_size is so that the compiler doesn't
256 * figure out that it can remove div_spoiler as that would require it
257 * to prove that md_size is always even, which I hope is beyond it. */
258 div_spoiler = md_size >> 1;
259 div_spoiler <<= (sizeof(div_spoiler)-1)*8;
260 rotate_offset = (div_spoiler + mac_start - scan_start) % md_size;
262 memset(rotated_mac, 0, md_size);
263 for (i = scan_start, j = 0; i < rec->orig_len; i++)
265 unsigned char mac_started = constant_time_ge_8(i, mac_start);
266 unsigned char mac_ended = constant_time_ge_8(i, mac_end);
267 unsigned char b = rec->data[i];
268 rotated_mac[j++] |= b & mac_started & ~mac_ended;
269 j &= constant_time_lt(j,md_size);
272 /* Now rotate the MAC */
273 #if defined(CBC_MAC_ROTATE_IN_PLACE)
275 for (i = 0; i < md_size; i++)
277 /* in case cache-line is 32 bytes, touch second line */
278 ((volatile unsigned char *)rotated_mac)[rotate_offset^32];
279 out[j++] = rotated_mac[rotate_offset++];
280 rotate_offset &= constant_time_lt(rotate_offset,md_size);
283 memset(out, 0, md_size);
284 rotate_offset = md_size - rotate_offset;
285 rotate_offset &= constant_time_lt(rotate_offset,md_size);
286 for (i = 0; i < md_size; i++)
288 for (j = 0; j < md_size; j++)
289 out[j] |= rotated_mac[i] & constant_time_eq_8(j, rotate_offset);
291 rotate_offset &= constant_time_lt(rotate_offset,md_size);
296 /* u32toLE serialises an unsigned, 32-bit number (n) as four bytes at (p) in
297 * little-endian order. The value of p is advanced by four. */
298 #define u32toLE(n, p) \
299 (*((p)++)=(unsigned char)(n), \
300 *((p)++)=(unsigned char)(n>>8), \
301 *((p)++)=(unsigned char)(n>>16), \
302 *((p)++)=(unsigned char)(n>>24))
304 /* These functions serialize the state of a hash and thus perform the standard
305 * "final" operation without adding the padding and length that such a function
307 static void tls1_md5_final_raw(void* ctx, unsigned char *md_out)
310 u32toLE(md5->A, md_out);
311 u32toLE(md5->B, md_out);
312 u32toLE(md5->C, md_out);
313 u32toLE(md5->D, md_out);
316 static void tls1_sha1_final_raw(void* ctx, unsigned char *md_out)
319 l2n(sha1->h0, md_out);
320 l2n(sha1->h1, md_out);
321 l2n(sha1->h2, md_out);
322 l2n(sha1->h3, md_out);
323 l2n(sha1->h4, md_out);
325 #define LARGEST_DIGEST_CTX SHA_CTX
327 #ifndef OPENSSL_NO_SHA256
328 static void tls1_sha256_final_raw(void* ctx, unsigned char *md_out)
330 SHA256_CTX *sha256 = ctx;
333 for (i = 0; i < 8; i++)
335 l2n(sha256->h[i], md_out);
338 #undef LARGEST_DIGEST_CTX
339 #define LARGEST_DIGEST_CTX SHA256_CTX
342 #ifndef OPENSSL_NO_SHA512
343 static void tls1_sha512_final_raw(void* ctx, unsigned char *md_out)
345 SHA512_CTX *sha512 = ctx;
348 for (i = 0; i < 8; i++)
350 l2n8(sha512->h[i], md_out);
353 #undef LARGEST_DIGEST_CTX
354 #define LARGEST_DIGEST_CTX SHA512_CTX
357 /* ssl3_cbc_record_digest_supported returns 1 iff |ctx| uses a hash function
358 * which ssl3_cbc_digest_record supports. */
359 char ssl3_cbc_record_digest_supported(const EVP_MD_CTX *ctx)
363 switch (EVP_MD_CTX_type(ctx))
367 #ifndef OPENSSL_NO_SHA256
371 #ifndef OPENSSL_NO_SHA512
382 * ssl3_cbc_digest_record computes the MAC of a decrypted, padded SSLv3/TLS
385 * ctx: the EVP_MD_CTX from which we take the hash function.
386 * ssl3_cbc_record_digest_supported must return true for this EVP_MD_CTX.
387 * md_out: the digest output. At most EVP_MAX_MD_SIZE bytes will be written.
388 * md_out_size: if non-NULL, the number of output bytes is written here.
389 * header: the 13-byte, TLS record header.
390 * data: the record data itself, less any preceding explicit IV.
391 * data_plus_mac_size: the secret, reported length of the data and MAC
392 * once the padding has been removed.
393 * data_plus_mac_plus_padding_size: the public length of the whole
394 * record, including padding.
395 * is_sslv3: non-zero if we are to use SSLv3. Otherwise, TLS.
397 * On entry: by virtue of having been through one of the remove_padding
398 * functions, above, we know that data_plus_mac_size is large enough to contain
399 * a padding byte and MAC. (If the padding was invalid, it might contain the
402 void ssl3_cbc_digest_record(
403 const EVP_MD_CTX *ctx,
404 unsigned char* md_out,
406 const unsigned char header[13],
407 const unsigned char *data,
408 size_t data_plus_mac_size,
409 size_t data_plus_mac_plus_padding_size,
410 const unsigned char *mac_secret,
411 unsigned mac_secret_length,
414 union { double align;
415 unsigned char c[sizeof(LARGEST_DIGEST_CTX)]; } md_state;
416 void (*md_final_raw)(void *ctx, unsigned char *md_out);
417 void (*md_transform)(void *ctx, const unsigned char *block);
418 unsigned md_size, md_block_size = 64;
419 unsigned sslv3_pad_length = 40, header_length, variance_blocks,
420 len, max_mac_bytes, num_blocks,
421 num_starting_blocks, k, mac_end_offset, c, index_a, index_b;
422 unsigned int bits; /* at most 18 bits */
423 unsigned char length_bytes[MAX_HASH_BIT_COUNT_BYTES];
424 /* hmac_pad is the masked HMAC key. */
425 unsigned char hmac_pad[MAX_HASH_BLOCK_SIZE];
426 unsigned char first_block[MAX_HASH_BLOCK_SIZE];
427 unsigned char mac_out[EVP_MAX_MD_SIZE];
428 unsigned i, j, md_out_size_u;
430 /* mdLengthSize is the number of bytes in the length field that terminates
432 unsigned md_length_size = 8;
433 char length_is_big_endian = 1;
436 /* This is a, hopefully redundant, check that allows us to forget about
437 * many possible overflows later in this function. */
438 OPENSSL_assert(data_plus_mac_plus_padding_size < 1024*1024);
440 switch (EVP_MD_CTX_type(ctx))
443 MD5_Init((MD5_CTX*)md_state.c);
444 md_final_raw = tls1_md5_final_raw;
445 md_transform = (void(*)(void *ctx, const unsigned char *block)) MD5_Transform;
447 sslv3_pad_length = 48;
448 length_is_big_endian = 0;
451 SHA1_Init((SHA_CTX*)md_state.c);
452 md_final_raw = tls1_sha1_final_raw;
453 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA1_Transform;
456 #ifndef OPENSSL_NO_SHA256
458 SHA224_Init((SHA256_CTX*)md_state.c);
459 md_final_raw = tls1_sha256_final_raw;
460 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA256_Transform;
464 SHA256_Init((SHA256_CTX*)md_state.c);
465 md_final_raw = tls1_sha256_final_raw;
466 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA256_Transform;
470 #ifndef OPENSSL_NO_SHA512
472 SHA384_Init((SHA512_CTX*)md_state.c);
473 md_final_raw = tls1_sha512_final_raw;
474 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA512_Transform;
480 SHA512_Init((SHA512_CTX*)md_state.c);
481 md_final_raw = tls1_sha512_final_raw;
482 md_transform = (void(*)(void *ctx, const unsigned char *block)) SHA512_Transform;
489 /* ssl3_cbc_record_digest_supported should have been
490 * called first to check that the hash function is
498 OPENSSL_assert(md_length_size <= MAX_HASH_BIT_COUNT_BYTES);
499 OPENSSL_assert(md_block_size <= MAX_HASH_BLOCK_SIZE);
500 OPENSSL_assert(md_size <= EVP_MAX_MD_SIZE);
508 8 /* sequence number */ +
509 1 /* record type */ +
510 2 /* record length */;
513 /* variance_blocks is the number of blocks of the hash that we have to
514 * calculate in constant time because they could be altered by the
517 * In SSLv3, the padding must be minimal so the end of the plaintext
518 * varies by, at most, 15+20 = 35 bytes. (We conservatively assume that
519 * the MAC size varies from 0..20 bytes.) In case the 9 bytes of hash
520 * termination (0x80 + 64-bit length) don't fit in the final block, we
521 * say that the final two blocks can vary based on the padding.
523 * TLSv1 has MACs up to 48 bytes long (SHA-384) and the padding is not
524 * required to be minimal. Therefore we say that the final six blocks
525 * can vary based on the padding.
527 * Later in the function, if the message is short and there obviously
528 * cannot be this many blocks then variance_blocks can be reduced. */
529 variance_blocks = is_sslv3 ? 2 : 6;
530 /* From now on we're dealing with the MAC, which conceptually has 13
531 * bytes of `header' before the start of the data (TLS) or 71/75 bytes
533 len = data_plus_mac_plus_padding_size + header_length;
534 /* max_mac_bytes contains the maximum bytes of bytes in the MAC, including
535 * |header|, assuming that there's no padding. */
536 max_mac_bytes = len - md_size - 1;
537 /* num_blocks is the maximum number of hash blocks. */
538 num_blocks = (max_mac_bytes + 1 + md_length_size + md_block_size - 1) / md_block_size;
539 /* In order to calculate the MAC in constant time we have to handle
540 * the final blocks specially because the padding value could cause the
541 * end to appear somewhere in the final |variance_blocks| blocks and we
542 * can't leak where. However, |num_starting_blocks| worth of data can
543 * be hashed right away because no padding value can affect whether
544 * they are plaintext. */
545 num_starting_blocks = 0;
546 /* k is the starting byte offset into the conceptual header||data where
547 * we start processing. */
549 /* mac_end_offset is the index just past the end of the data to be
551 mac_end_offset = data_plus_mac_size + header_length - md_size;
552 /* c is the index of the 0x80 byte in the final hash block that
553 * contains application data. */
554 c = mac_end_offset % md_block_size;
555 /* index_a is the hash block number that contains the 0x80 terminating
557 index_a = mac_end_offset / md_block_size;
558 /* index_b is the hash block number that contains the 64-bit hash
559 * length, in bits. */
560 index_b = (mac_end_offset + md_length_size) / md_block_size;
561 /* bits is the hash-length in bits. It includes the additional hash
562 * block for the masked HMAC key, or whole of |header| in the case of
565 /* For SSLv3, if we're going to have any starting blocks then we need
566 * at least two because the header is larger than a single block. */
567 if (num_blocks > variance_blocks + (is_sslv3 ? 1 : 0))
569 num_starting_blocks = num_blocks - variance_blocks;
570 k = md_block_size*num_starting_blocks;
573 bits = 8*mac_end_offset;
576 /* Compute the initial HMAC block. For SSLv3, the padding and
577 * secret bytes are included in |header| because they take more
578 * than a single block. */
579 bits += 8*md_block_size;
580 memset(hmac_pad, 0, md_block_size);
581 OPENSSL_assert(mac_secret_length <= sizeof(hmac_pad));
582 memcpy(hmac_pad, mac_secret, mac_secret_length);
583 for (i = 0; i < md_block_size; i++)
586 md_transform(md_state.c, hmac_pad);
589 if (length_is_big_endian)
591 memset(length_bytes,0,md_length_size-4);
592 length_bytes[md_length_size-4] = (unsigned char)(bits>>24);
593 length_bytes[md_length_size-3] = (unsigned char)(bits>>16);
594 length_bytes[md_length_size-2] = (unsigned char)(bits>>8);
595 length_bytes[md_length_size-1] = (unsigned char)bits;
599 memset(length_bytes,0,md_length_size);
600 length_bytes[md_length_size-5] = (unsigned char)(bits>>24);
601 length_bytes[md_length_size-6] = (unsigned char)(bits>>16);
602 length_bytes[md_length_size-7] = (unsigned char)(bits>>8);
603 length_bytes[md_length_size-8] = (unsigned char)bits;
610 /* The SSLv3 header is larger than a single block.
611 * overhang is the number of bytes beyond a single
612 * block that the header consumes: either 7 bytes
613 * (SHA1) or 11 bytes (MD5). */
614 unsigned overhang = header_length-md_block_size;
615 md_transform(md_state.c, header);
616 memcpy(first_block, header + md_block_size, overhang);
617 memcpy(first_block + overhang, data, md_block_size-overhang);
618 md_transform(md_state.c, first_block);
619 for (i = 1; i < k/md_block_size - 1; i++)
620 md_transform(md_state.c, data + md_block_size*i - overhang);
624 /* k is a multiple of md_block_size. */
625 memcpy(first_block, header, 13);
626 memcpy(first_block+13, data, md_block_size-13);
627 md_transform(md_state.c, first_block);
628 for (i = 1; i < k/md_block_size; i++)
629 md_transform(md_state.c, data + md_block_size*i - 13);
633 memset(mac_out, 0, sizeof(mac_out));
635 /* We now process the final hash blocks. For each block, we construct
636 * it in constant time. If the |i==index_a| then we'll include the 0x80
637 * bytes and zero pad etc. For each block we selectively copy it, in
638 * constant time, to |mac_out|. */
639 for (i = num_starting_blocks; i <= num_starting_blocks+variance_blocks; i++)
641 unsigned char block[MAX_HASH_BLOCK_SIZE];
642 unsigned char is_block_a = constant_time_eq_8(i, index_a);
643 unsigned char is_block_b = constant_time_eq_8(i, index_b);
644 for (j = 0; j < md_block_size; j++)
646 unsigned char b = 0, is_past_c, is_past_cp1;
647 if (k < header_length)
649 else if (k < data_plus_mac_plus_padding_size + header_length)
650 b = data[k-header_length];
653 is_past_c = is_block_a & constant_time_ge_8(j, c);
654 is_past_cp1 = is_block_a & constant_time_ge_8(j, c+1);
655 /* If this is the block containing the end of the
656 * application data, and we are at the offset for the
657 * 0x80 value, then overwrite b with 0x80. */
658 b = constant_time_select_8(is_past_c, 0x80, b);
659 /* If this the the block containing the end of the
660 * application data and we're past the 0x80 value then
661 * just write zero. */
663 /* If this is index_b (the final block), but not
664 * index_a (the end of the data), then the 64-bit
665 * length didn't fit into index_a and we're having to
666 * add an extra block of zeros. */
667 b &= ~is_block_b | is_block_a;
669 /* The final bytes of one of the blocks contains the
671 if (j >= md_block_size - md_length_size)
673 /* If this is index_b, write a length byte. */
674 b = constant_time_select_8(
675 is_block_b, length_bytes[j-(md_block_size-md_length_size)], b);
680 md_transform(md_state.c, block);
681 md_final_raw(md_state.c, block);
682 /* If this is index_b, copy the hash value to |mac_out|. */
683 for (j = 0; j < md_size; j++)
684 mac_out[j] |= block[j]&is_block_b;
687 EVP_MD_CTX_init(&md_ctx);
688 EVP_DigestInit_ex(&md_ctx, ctx->digest, NULL /* engine */);
691 /* We repurpose |hmac_pad| to contain the SSLv3 pad2 block. */
692 memset(hmac_pad, 0x5c, sslv3_pad_length);
694 EVP_DigestUpdate(&md_ctx, mac_secret, mac_secret_length);
695 EVP_DigestUpdate(&md_ctx, hmac_pad, sslv3_pad_length);
696 EVP_DigestUpdate(&md_ctx, mac_out, md_size);
700 /* Complete the HMAC in the standard manner. */
701 for (i = 0; i < md_block_size; i++)
704 EVP_DigestUpdate(&md_ctx, hmac_pad, md_block_size);
705 EVP_DigestUpdate(&md_ctx, mac_out, md_size);
707 ret = EVP_DigestFinal(&md_ctx, md_out, &md_out_size_u);
708 if (ret && md_out_size)
709 *md_out_size = md_out_size_u;
710 EVP_MD_CTX_cleanup(&md_ctx);
713 /* Due to the need to use EVP in FIPS mode we can't reimplement digests but
714 * we can ensure the number of blocks processed is equal for all cases
715 * by digesting additional data.
718 void tls_fips_digest_extra(
719 const EVP_CIPHER_CTX *cipher_ctx, EVP_MD_CTX *mac_ctx,
720 const unsigned char *data, size_t data_len, size_t orig_len)
722 size_t block_size, digest_pad, blocks_data, blocks_orig;
723 if (EVP_CIPHER_CTX_mode(cipher_ctx) != EVP_CIPH_CBC_MODE)
725 block_size = EVP_MD_CTX_block_size(mac_ctx);
727 * We are in FIPS mode if we get this far so we know we have only SHA*
728 * digests and TLS to deal with.
729 * Minimum digest padding length is 17 for SHA384/SHA512 and 9
731 * Additional header is 13 bytes. To get the number of digest blocks
732 * processed round up the amount of data plus padding to the nearest
733 * block length. Block length is 128 for SHA384/SHA512 and 64 otherwise.
735 * blocks = (payload_len + digest_pad + 13 + block_size - 1)/block_size
737 * blocks = (payload_len + digest_pad + 12)/block_size + 1
738 * HMAC adds a constant overhead.
739 * We're ultimately only interested in differences so this becomes
740 * blocks = (payload_len + 29)/128
741 * for SHA384/SHA512 and
742 * blocks = (payload_len + 21)/64
745 digest_pad = block_size == 64 ? 21 : 29;
746 blocks_orig = (orig_len + digest_pad)/block_size;
747 blocks_data = (data_len + digest_pad)/block_size;
748 /* MAC enough blocks to make up the difference between the original
749 * and actual lengths plus one extra block to ensure this is never a
750 * no op. The "data" pointer should always have enough space to
751 * perform this operation as it is large enough for a maximum
754 EVP_DigestSignUpdate(mac_ctx, data,
755 (blocks_orig - blocks_data + 1) * block_size);