Latest update.
This commit is contained in:
+124
-1
@@ -10,10 +10,13 @@
|
||||
#include "internal/constant_time.h"
|
||||
|
||||
#include <stdio.h>
|
||||
#include "internal/cryptlib.h"
|
||||
#include <openssl/bn.h>
|
||||
#include <openssl/rsa.h>
|
||||
#include <openssl/rand.h>
|
||||
/* Just for the SSL_MAX_MASTER_KEY_LENGTH value */
|
||||
#include <openssl/ssl.h>
|
||||
#include "internal/cryptlib.h"
|
||||
#include "crypto/rsa.h"
|
||||
|
||||
int RSA_padding_add_PKCS1_type_1(unsigned char *to, int tlen,
|
||||
const unsigned char *from, int flen)
|
||||
@@ -253,3 +256,123 @@ int RSA_padding_check_PKCS1_type_2(unsigned char *to, int tlen,
|
||||
|
||||
return constant_time_select_int(good, mlen, -1);
|
||||
}
|
||||
|
||||
/*
|
||||
* rsa_padding_check_PKCS1_type_2_TLS() checks and removes the PKCS1 type 2
|
||||
* padding from a decrypted RSA message in a TLS signature. The result is stored
|
||||
* in the buffer pointed to by |to| which should be |tlen| bytes long. |tlen|
|
||||
* must be at least SSL_MAX_MASTER_KEY_LENGTH. The original decrypted message
|
||||
* should be stored in |from| which must be |flen| bytes in length and padded
|
||||
* such that |flen == RSA_size()|. The TLS protocol version that the client
|
||||
* originally requested should be passed in |client_version|. Some buggy clients
|
||||
* can exist which use the negotiated version instead of the originally
|
||||
* requested protocol version. If it is necessary to work around this bug then
|
||||
* the negotiated protocol version can be passed in |alt_version|, otherwise 0
|
||||
* should be passed.
|
||||
*
|
||||
* If the passed message is publicly invalid or some other error that can be
|
||||
* treated in non-constant time occurs then -1 is returned. On success the
|
||||
* length of the decrypted data is returned. This will always be
|
||||
* SSL_MAX_MASTER_KEY_LENGTH. If an error occurs that should be treated in
|
||||
* constant time then this function will appear to return successfully, but the
|
||||
* decrypted data will be randomly generated (as per
|
||||
* https://tools.ietf.org/html/rfc5246#section-7.4.7.1).
|
||||
*/
|
||||
int rsa_padding_check_PKCS1_type_2_TLS(unsigned char *to, size_t tlen,
|
||||
const unsigned char *from, size_t flen,
|
||||
int client_version, int alt_version)
|
||||
{
|
||||
unsigned int i, good, version_good;
|
||||
unsigned char rand_premaster_secret[SSL_MAX_MASTER_KEY_LENGTH];
|
||||
|
||||
/*
|
||||
* If these checks fail then either the message in publicly invalid, or
|
||||
* we've been called incorrectly. We can fail immediately.
|
||||
*/
|
||||
if (flen < RSA_PKCS1_PADDING_SIZE + SSL_MAX_MASTER_KEY_LENGTH
|
||||
|| tlen < SSL_MAX_MASTER_KEY_LENGTH) {
|
||||
ERR_raise(ERR_LIB_RSA, RSA_R_PKCS_DECODING_ERROR);
|
||||
return -1;
|
||||
}
|
||||
|
||||
/*
|
||||
* Generate a random premaster secret to use in the event that we fail
|
||||
* to decrypt.
|
||||
*/
|
||||
if (RAND_priv_bytes(rand_premaster_secret,
|
||||
sizeof(rand_premaster_secret)) <= 0) {
|
||||
ERR_raise(ERR_LIB_RSA, ERR_R_INTERNAL_ERROR);
|
||||
return -1;
|
||||
}
|
||||
|
||||
good = constant_time_is_zero(from[0]);
|
||||
good &= constant_time_eq(from[1], 2);
|
||||
|
||||
/* Check we have the expected padding data */
|
||||
for (i = 2; i < flen - SSL_MAX_MASTER_KEY_LENGTH - 1; i++)
|
||||
good &= ~constant_time_is_zero_8(from[i]);
|
||||
good &= constant_time_is_zero_8(from[flen - SSL_MAX_MASTER_KEY_LENGTH - 1]);
|
||||
|
||||
|
||||
/*
|
||||
* If the version in the decrypted pre-master secret is correct then
|
||||
* version_good will be 0xff, otherwise it'll be zero. The
|
||||
* Klima-Pokorny-Rosa extension of Bleichenbacher's attack
|
||||
* (http://eprint.iacr.org/2003/052/) exploits the version number
|
||||
* check as a "bad version oracle". Thus version checks are done in
|
||||
* constant time and are treated like any other decryption error.
|
||||
*/
|
||||
version_good =
|
||||
constant_time_eq(from[flen - SSL_MAX_MASTER_KEY_LENGTH],
|
||||
(client_version >> 8) & 0xff);
|
||||
version_good &=
|
||||
constant_time_eq(from[flen - SSL_MAX_MASTER_KEY_LENGTH + 1],
|
||||
client_version & 0xff);
|
||||
|
||||
/*
|
||||
* The premaster secret must contain the same version number as the
|
||||
* ClientHello to detect version rollback attacks (strangely, the
|
||||
* protocol does not offer such protection for DH ciphersuites).
|
||||
* However, buggy clients exist that send the negotiated protocol
|
||||
* version instead if the server does not support the requested
|
||||
* protocol version. If SSL_OP_TLS_ROLLBACK_BUG is set then we tolerate
|
||||
* such clients. In that case alt_version will be non-zero and set to
|
||||
* the negotiated version.
|
||||
*/
|
||||
if (alt_version > 0) {
|
||||
unsigned int workaround_good;
|
||||
|
||||
workaround_good =
|
||||
constant_time_eq(from[flen - SSL_MAX_MASTER_KEY_LENGTH],
|
||||
(alt_version >> 8) & 0xff);
|
||||
workaround_good &=
|
||||
constant_time_eq(from[flen - SSL_MAX_MASTER_KEY_LENGTH + 1],
|
||||
alt_version & 0xff);
|
||||
version_good |= workaround_good;
|
||||
}
|
||||
|
||||
good &= version_good;
|
||||
|
||||
|
||||
/*
|
||||
* Now copy the result over to the to buffer if good, or random data if
|
||||
* not good.
|
||||
*/
|
||||
for (i = 0; i < SSL_MAX_MASTER_KEY_LENGTH; i++) {
|
||||
to[i] =
|
||||
constant_time_select_8(good,
|
||||
from[flen - SSL_MAX_MASTER_KEY_LENGTH + i],
|
||||
rand_premaster_secret[i]);
|
||||
}
|
||||
|
||||
/*
|
||||
* We must not leak whether a decryption failure occurs because of
|
||||
* Bleichenbacher's attack on PKCS #1 v1.5 RSA padding (see RFC 2246,
|
||||
* section 7.4.7.1). The code follows that advice of the TLS RFC and
|
||||
* generates a random premaster secret for the case that the decrypt
|
||||
* fails. See https://tools.ietf.org/html/rfc5246#section-7.4.7.1
|
||||
* So, whether we actually succeeded or not, return success.
|
||||
*/
|
||||
|
||||
return SSL_MAX_MASTER_KEY_LENGTH;
|
||||
}
|
||||
Reference in New Issue
Block a user