79bc7a3212
We only need the size_t ones now. BUG=22 Change-Id: Ie6935656bbc4bd2b602b8fad78effc401c493416 Reviewed-on: https://boringssl-review.googlesource.com/14312 Commit-Queue: David Benjamin <davidben@google.com> Reviewed-by: Adam Langley <agl@google.com>
137 lines
4.8 KiB
C++
137 lines
4.8 KiB
C++
/*
|
|
* Utilities for constant-time cryptography.
|
|
*
|
|
* Author: Emilia Kasper (emilia@openssl.org)
|
|
* Based on previous work by Bodo Moeller, Emilia Kasper, Adam Langley
|
|
* (Google).
|
|
* ====================================================================
|
|
* Copyright (c) 2014 The OpenSSL Project. All rights reserved.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
* 3. All advertising materials mentioning features or use of this software
|
|
* must display the following acknowledgement:
|
|
* "This product includes cryptographic software written by
|
|
* Eric Young (eay@cryptsoft.com)"
|
|
* The word 'cryptographic' can be left out if the rouines from the library
|
|
* being used are not cryptographic related :-).
|
|
* 4. If you include any Windows specific code (or a derivative thereof) from
|
|
* the apps directory (application code) you must include an acknowledgement:
|
|
* "This product includes software written by Tim Hudson (tjh@cryptsoft.com)"
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*
|
|
* The licence and distribution terms for any publically available version or
|
|
* derivative of this code cannot be changed. i.e. this code cannot simply be
|
|
* copied and put under another distribution licence
|
|
* [including the GNU Public Licence.]
|
|
*/
|
|
|
|
#include "internal.h"
|
|
|
|
#include <limits.h>
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
|
|
#include <limits>
|
|
|
|
#include <gtest/gtest.h>
|
|
|
|
|
|
static uint8_t FromBool8(bool b) {
|
|
return b ? CONSTTIME_TRUE_8 : CONSTTIME_FALSE_8;
|
|
}
|
|
|
|
static size_t FromBoolS(bool b) {
|
|
return b ? CONSTTIME_TRUE_S : CONSTTIME_FALSE_S;
|
|
}
|
|
|
|
static uint8_t test_values_8[] = {0, 1, 2, 20, 32, 127, 128, 129, 255};
|
|
|
|
static size_t test_values_s[] = {
|
|
0,
|
|
1,
|
|
1024,
|
|
12345,
|
|
32000,
|
|
#if defined(OPENSSL_64_BIT)
|
|
0xffffffff / 2 - 1,
|
|
0xffffffff / 2,
|
|
0xffffffff / 2 + 1,
|
|
0xffffffff - 1,
|
|
0xffffffff,
|
|
#endif
|
|
std::numeric_limits<size_t>::max() / 2 - 1,
|
|
std::numeric_limits<size_t>::max() / 2,
|
|
std::numeric_limits<size_t>::max() / 2 + 1,
|
|
std::numeric_limits<size_t>::max() - 1,
|
|
std::numeric_limits<size_t>::max(),
|
|
};
|
|
|
|
static int signed_test_values[] = {
|
|
0, 1, -1, 1024, -1024, 12345, -12345,
|
|
32000, -32000, INT_MAX, INT_MIN, INT_MAX - 1, INT_MIN + 1};
|
|
|
|
TEST(ConstantTimeTest, Test) {
|
|
for (size_t a : test_values_s) {
|
|
SCOPED_TRACE(a);
|
|
|
|
EXPECT_EQ(FromBoolS(a == 0), constant_time_is_zero_s(a));
|
|
EXPECT_EQ(FromBool8(a == 0), constant_time_is_zero_8(a));
|
|
|
|
for (size_t b : test_values_s) {
|
|
SCOPED_TRACE(b);
|
|
|
|
EXPECT_EQ(FromBoolS(a < b), constant_time_lt_s(a, b));
|
|
EXPECT_EQ(FromBool8(a < b), constant_time_lt_8(a, b));
|
|
|
|
EXPECT_EQ(FromBoolS(a >= b), constant_time_ge_s(a, b));
|
|
EXPECT_EQ(FromBool8(a >= b), constant_time_ge_8(a, b));
|
|
|
|
EXPECT_EQ(FromBoolS(a == b), constant_time_eq_s(a, b));
|
|
EXPECT_EQ(FromBool8(a == b), constant_time_eq_8(a, b));
|
|
|
|
EXPECT_EQ(a, constant_time_select_s(CONSTTIME_TRUE_S, a, b));
|
|
EXPECT_EQ(b, constant_time_select_s(CONSTTIME_FALSE_S, a, b));
|
|
}
|
|
}
|
|
|
|
for (int a : signed_test_values) {
|
|
SCOPED_TRACE(a);
|
|
for (int b : signed_test_values) {
|
|
SCOPED_TRACE(b);
|
|
|
|
EXPECT_EQ(a, constant_time_select_int(CONSTTIME_TRUE_S, a, b));
|
|
EXPECT_EQ(b, constant_time_select_int(CONSTTIME_FALSE_S, a, b));
|
|
|
|
EXPECT_EQ(FromBoolS(a == b), constant_time_eq_int(a, b));
|
|
EXPECT_EQ(FromBool8(a == b), constant_time_eq_int_8(a, b));
|
|
}
|
|
}
|
|
|
|
for (uint8_t a : test_values_8) {
|
|
SCOPED_TRACE(static_cast<int>(a));
|
|
for (uint8_t b : test_values_8) {
|
|
SCOPED_TRACE(static_cast<int>(b));
|
|
EXPECT_EQ(a, constant_time_select_8(CONSTTIME_TRUE_8, a, b));
|
|
EXPECT_EQ(b, constant_time_select_8(CONSTTIME_FALSE_8, a, b));
|
|
}
|
|
}
|
|
}
|