mirror of https://github.com/lukechilds/node.git
Browse Source
Reviewed-By: Ben Noordhuis <info@bnoordhuis.nl> PR-URL: https://github.com/iojs/io.js/pull/1archived-io.js-v0.12
98 changed files with 2438 additions and 725 deletions
@ -0,0 +1,216 @@ |
|||||
|
/* crypto/constant_time_locl.h */ |
||||
|
/*
|
||||
|
* 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.] |
||||
|
*/ |
||||
|
|
||||
|
#ifndef HEADER_CONSTANT_TIME_LOCL_H |
||||
|
#define HEADER_CONSTANT_TIME_LOCL_H |
||||
|
|
||||
|
#include "e_os.h" /* For 'inline' */ |
||||
|
|
||||
|
#ifdef __cplusplus |
||||
|
extern "C" { |
||||
|
#endif |
||||
|
|
||||
|
/*
|
||||
|
* The boolean methods return a bitmask of all ones (0xff...f) for true |
||||
|
* and 0 for false. This is useful for choosing a value based on the result |
||||
|
* of a conditional in constant time. For example, |
||||
|
* |
||||
|
* if (a < b) { |
||||
|
* c = a; |
||||
|
* } else { |
||||
|
* c = b; |
||||
|
* } |
||||
|
* |
||||
|
* can be written as |
||||
|
* |
||||
|
* unsigned int lt = constant_time_lt(a, b); |
||||
|
* c = constant_time_select(lt, a, b); |
||||
|
*/ |
||||
|
|
||||
|
/*
|
||||
|
* Returns the given value with the MSB copied to all the other |
||||
|
* bits. Uses the fact that arithmetic shift shifts-in the sign bit. |
||||
|
* However, this is not ensured by the C standard so you may need to |
||||
|
* replace this with something else on odd CPUs. |
||||
|
*/ |
||||
|
static inline unsigned int constant_time_msb(unsigned int a); |
||||
|
|
||||
|
/*
|
||||
|
* Returns 0xff..f if a < b and 0 otherwise. |
||||
|
*/ |
||||
|
static inline unsigned int constant_time_lt(unsigned int a, unsigned int b); |
||||
|
/* Convenience method for getting an 8-bit mask. */ |
||||
|
static inline unsigned char constant_time_lt_8(unsigned int a, unsigned int b); |
||||
|
|
||||
|
/*
|
||||
|
* Returns 0xff..f if a >= b and 0 otherwise. |
||||
|
*/ |
||||
|
static inline unsigned int constant_time_ge(unsigned int a, unsigned int b); |
||||
|
/* Convenience method for getting an 8-bit mask. */ |
||||
|
static inline unsigned char constant_time_ge_8(unsigned int a, unsigned int b); |
||||
|
|
||||
|
/*
|
||||
|
* Returns 0xff..f if a == 0 and 0 otherwise. |
||||
|
*/ |
||||
|
static inline unsigned int constant_time_is_zero(unsigned int a); |
||||
|
/* Convenience method for getting an 8-bit mask. */ |
||||
|
static inline unsigned char constant_time_is_zero_8(unsigned int a); |
||||
|
|
||||
|
|
||||
|
/*
|
||||
|
* Returns 0xff..f if a == b and 0 otherwise. |
||||
|
*/ |
||||
|
static inline unsigned int constant_time_eq(unsigned int a, unsigned int b); |
||||
|
/* Convenience method for getting an 8-bit mask. */ |
||||
|
static inline unsigned char constant_time_eq_8(unsigned int a, unsigned int b); |
||||
|
/* Signed integers. */ |
||||
|
static inline unsigned int constant_time_eq_int(int a, int b); |
||||
|
/* Convenience method for getting an 8-bit mask. */ |
||||
|
static inline unsigned char constant_time_eq_int_8(int a, int b); |
||||
|
|
||||
|
|
||||
|
/*
|
||||
|
* Returns (mask & a) | (~mask & b). |
||||
|
* |
||||
|
* When |mask| is all 1s or all 0s (as returned by the methods above), |
||||
|
* the select methods return either |a| (if |mask| is nonzero) or |b| |
||||
|
* (if |mask| is zero). |
||||
|
*/ |
||||
|
static inline unsigned int constant_time_select(unsigned int mask, |
||||
|
unsigned int a, unsigned int b); |
||||
|
/* Convenience method for unsigned chars. */ |
||||
|
static inline unsigned char constant_time_select_8(unsigned char mask, |
||||
|
unsigned char a, unsigned char b); |
||||
|
/* Convenience method for signed integers. */ |
||||
|
static inline int constant_time_select_int(unsigned int mask, int a, int b); |
||||
|
|
||||
|
static inline unsigned int constant_time_msb(unsigned int a) |
||||
|
{ |
||||
|
return (unsigned int)((int)(a) >> (sizeof(int) * 8 - 1)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned int constant_time_lt(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
unsigned int lt; |
||||
|
/* Case 1: msb(a) == msb(b). a < b iff the MSB of a - b is set.*/ |
||||
|
lt = ~(a ^ b) & (a - b); |
||||
|
/* Case 2: msb(a) != msb(b). a < b iff the MSB of b is set. */ |
||||
|
lt |= ~a & b; |
||||
|
return constant_time_msb(lt); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned char constant_time_lt_8(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
return (unsigned char)(constant_time_lt(a, b)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned int constant_time_ge(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
unsigned int ge; |
||||
|
/* Case 1: msb(a) == msb(b). a >= b iff the MSB of a - b is not set.*/ |
||||
|
ge = ~((a ^ b) | (a - b)); |
||||
|
/* Case 2: msb(a) != msb(b). a >= b iff the MSB of a is set. */ |
||||
|
ge |= a & ~b; |
||||
|
return constant_time_msb(ge); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned char constant_time_ge_8(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
return (unsigned char)(constant_time_ge(a, b)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned int constant_time_is_zero(unsigned int a) |
||||
|
{ |
||||
|
return constant_time_msb(~a & (a - 1)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned char constant_time_is_zero_8(unsigned int a) |
||||
|
{ |
||||
|
return (unsigned char)(constant_time_is_zero(a)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned int constant_time_eq(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
return constant_time_is_zero(a ^ b); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned char constant_time_eq_8(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
return (unsigned char)(constant_time_eq(a, b)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned int constant_time_eq_int(int a, int b) |
||||
|
{ |
||||
|
return constant_time_eq((unsigned)(a), (unsigned)(b)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned char constant_time_eq_int_8(int a, int b) |
||||
|
{ |
||||
|
return constant_time_eq_8((unsigned)(a), (unsigned)(b)); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned int constant_time_select(unsigned int mask, |
||||
|
unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
return (mask & a) | (~mask & b); |
||||
|
} |
||||
|
|
||||
|
static inline unsigned char constant_time_select_8(unsigned char mask, |
||||
|
unsigned char a, unsigned char b) |
||||
|
{ |
||||
|
return (unsigned char)(constant_time_select(mask, a, b)); |
||||
|
} |
||||
|
|
||||
|
inline int constant_time_select_int(unsigned int mask, int a, int b) |
||||
|
{ |
||||
|
return (int)(constant_time_select(mask, (unsigned)(a), (unsigned)(b))); |
||||
|
} |
||||
|
|
||||
|
#ifdef __cplusplus |
||||
|
} |
||||
|
#endif |
||||
|
|
||||
|
#endif /* HEADER_CONSTANT_TIME_LOCL_H */ |
@ -0,0 +1,330 @@ |
|||||
|
/* crypto/constant_time_test.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 "../crypto/constant_time_locl.h" |
||||
|
|
||||
|
#include <limits.h> |
||||
|
#include <stdio.h> |
||||
|
#include <stdlib.h> |
||||
|
|
||||
|
static const unsigned int CONSTTIME_TRUE = (unsigned)(~0); |
||||
|
static const unsigned int CONSTTIME_FALSE = 0; |
||||
|
static const unsigned char CONSTTIME_TRUE_8 = 0xff; |
||||
|
static const unsigned char CONSTTIME_FALSE_8 = 0; |
||||
|
|
||||
|
static int test_binary_op(unsigned int (*op)(unsigned int a, unsigned int b), |
||||
|
const char* op_name, unsigned int a, unsigned int b, int is_true) |
||||
|
{ |
||||
|
unsigned c = op(a, b); |
||||
|
if (is_true && c != CONSTTIME_TRUE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %du " |
||||
|
"(TRUE), got %du\n", op_name, a, b, CONSTTIME_TRUE, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (!is_true && c != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %du " |
||||
|
"(FALSE), got %du\n", op_name, a, b, CONSTTIME_FALSE, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_binary_op_8(unsigned char (*op)(unsigned int a, unsigned int b), |
||||
|
const char* op_name, unsigned int a, unsigned int b, int is_true) |
||||
|
{ |
||||
|
unsigned char c = op(a, b); |
||||
|
if (is_true && c != CONSTTIME_TRUE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %u " |
||||
|
"(TRUE), got %u\n", op_name, a, b, CONSTTIME_TRUE_8, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (!is_true && c != CONSTTIME_FALSE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %u " |
||||
|
"(FALSE), got %u\n", op_name, a, b, CONSTTIME_FALSE_8, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_is_zero(unsigned int a) |
||||
|
{ |
||||
|
unsigned int c = constant_time_is_zero(a); |
||||
|
if (a == 0 && c != CONSTTIME_TRUE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %du (TRUE), got %du\n", a, CONSTTIME_TRUE, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != 0 && c != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %du (FALSE), got %du\n", a, CONSTTIME_FALSE, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_is_zero_8(unsigned int a) |
||||
|
{ |
||||
|
unsigned char c = constant_time_is_zero_8(a); |
||||
|
if (a == 0 && c != CONSTTIME_TRUE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %u (TRUE), got %u\n", a, CONSTTIME_TRUE_8, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != 0 && c != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %u (FALSE), got %u\n", a, CONSTTIME_FALSE_8, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_select(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
unsigned int selected = constant_time_select(CONSTTIME_TRUE, a, b); |
||||
|
if (selected != a) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %du," |
||||
|
"%du): expected %du(first value), got %du\n", |
||||
|
CONSTTIME_TRUE, a, b, a, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
selected = constant_time_select(CONSTTIME_FALSE, a, b); |
||||
|
if (selected != b) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %du," |
||||
|
"%du): expected %du(second value), got %du\n", |
||||
|
CONSTTIME_FALSE, a, b, b, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_select_8(unsigned char a, unsigned char b) |
||||
|
{ |
||||
|
unsigned char selected = constant_time_select_8(CONSTTIME_TRUE_8, a, b); |
||||
|
if (selected != a) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%u, %u," |
||||
|
"%u): expected %u(first value), got %u\n", |
||||
|
CONSTTIME_TRUE, a, b, a, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
selected = constant_time_select_8(CONSTTIME_FALSE_8, a, b); |
||||
|
if (selected != b) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%u, %u," |
||||
|
"%u): expected %u(second value), got %u\n", |
||||
|
CONSTTIME_FALSE, a, b, b, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_select_int(int a, int b) |
||||
|
{ |
||||
|
int selected = constant_time_select_int(CONSTTIME_TRUE, a, b); |
||||
|
if (selected != a) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %d," |
||||
|
"%d): expected %d(first value), got %d\n", |
||||
|
CONSTTIME_TRUE, a, b, a, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
selected = constant_time_select_int(CONSTTIME_FALSE, a, b); |
||||
|
if (selected != b) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %d," |
||||
|
"%d): expected %d(second value), got %d\n", |
||||
|
CONSTTIME_FALSE, a, b, b, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_eq_int(int a, int b) |
||||
|
{ |
||||
|
unsigned int equal = constant_time_eq_int(a, b); |
||||
|
if (a == b && equal != CONSTTIME_TRUE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int(%d, %d): " |
||||
|
"expected %du(TRUE), got %du\n", |
||||
|
a, b, CONSTTIME_TRUE, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != b && equal != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int(%d, %d): " |
||||
|
"expected %du(FALSE), got %du\n", |
||||
|
a, b, CONSTTIME_FALSE, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_eq_int_8(int a, int b) |
||||
|
{ |
||||
|
unsigned char equal = constant_time_eq_int_8(a, b); |
||||
|
if (a == b && equal != CONSTTIME_TRUE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int_8(%d, %d): " |
||||
|
"expected %u(TRUE), got %u\n", |
||||
|
a, b, CONSTTIME_TRUE_8, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != b && equal != CONSTTIME_FALSE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int_8(%d, %d): " |
||||
|
"expected %u(FALSE), got %u\n", |
||||
|
a, b, CONSTTIME_FALSE_8, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static unsigned int test_values[] = {0, 1, 1024, 12345, 32000, UINT_MAX/2-1, |
||||
|
UINT_MAX/2, UINT_MAX/2+1, UINT_MAX-1, |
||||
|
UINT_MAX}; |
||||
|
|
||||
|
static unsigned char test_values_8[] = {0, 1, 2, 20, 32, 127, 128, 129, 255}; |
||||
|
|
||||
|
static int signed_test_values[] = {0, 1, -1, 1024, -1024, 12345, -12345, |
||||
|
32000, -32000, INT_MAX, INT_MIN, INT_MAX-1, |
||||
|
INT_MIN+1}; |
||||
|
|
||||
|
|
||||
|
int main(int argc, char *argv[]) |
||||
|
{ |
||||
|
unsigned int a, b, i, j; |
||||
|
int c, d; |
||||
|
unsigned char e, f; |
||||
|
int num_failed = 0, num_all = 0; |
||||
|
fprintf(stdout, "Testing constant time operations...\n"); |
||||
|
|
||||
|
for (i = 0; i < sizeof(test_values)/sizeof(int); ++i) |
||||
|
{ |
||||
|
a = test_values[i]; |
||||
|
num_failed += test_is_zero(a); |
||||
|
num_failed += test_is_zero_8(a); |
||||
|
num_all += 2; |
||||
|
for (j = 0; j < sizeof(test_values)/sizeof(int); ++j) |
||||
|
{ |
||||
|
b = test_values[j]; |
||||
|
num_failed += test_binary_op(&constant_time_lt, |
||||
|
"constant_time_lt", a, b, a < b); |
||||
|
num_failed += test_binary_op_8(&constant_time_lt_8, |
||||
|
"constant_time_lt_8", a, b, a < b); |
||||
|
num_failed += test_binary_op(&constant_time_lt, |
||||
|
"constant_time_lt_8", b, a, b < a); |
||||
|
num_failed += test_binary_op_8(&constant_time_lt_8, |
||||
|
"constant_time_lt_8", b, a, b < a); |
||||
|
num_failed += test_binary_op(&constant_time_ge, |
||||
|
"constant_time_ge", a, b, a >= b); |
||||
|
num_failed += test_binary_op_8(&constant_time_ge_8, |
||||
|
"constant_time_ge_8", a, b, a >= b); |
||||
|
num_failed += test_binary_op(&constant_time_ge, |
||||
|
"constant_time_ge", b, a, b >= a); |
||||
|
num_failed += test_binary_op_8(&constant_time_ge_8, |
||||
|
"constant_time_ge_8", b, a, b >= a); |
||||
|
num_failed += test_binary_op(&constant_time_eq, |
||||
|
"constant_time_eq", a, b, a == b); |
||||
|
num_failed += test_binary_op_8(&constant_time_eq_8, |
||||
|
"constant_time_eq_8", a, b, a == b); |
||||
|
num_failed += test_binary_op(&constant_time_eq, |
||||
|
"constant_time_eq", b, a, b == a); |
||||
|
num_failed += test_binary_op_8(&constant_time_eq_8, |
||||
|
"constant_time_eq_8", b, a, b == a); |
||||
|
num_failed += test_select(a, b); |
||||
|
num_all += 13; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
for (i = 0; i < sizeof(signed_test_values)/sizeof(int); ++i) |
||||
|
{ |
||||
|
c = signed_test_values[i]; |
||||
|
for (j = 0; j < sizeof(signed_test_values)/sizeof(int); ++j) |
||||
|
{ |
||||
|
d = signed_test_values[j]; |
||||
|
num_failed += test_select_int(c, d); |
||||
|
num_failed += test_eq_int(c, d); |
||||
|
num_failed += test_eq_int_8(c, d); |
||||
|
num_all += 3; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
for (i = 0; i < sizeof(test_values_8); ++i) |
||||
|
{ |
||||
|
e = test_values_8[i]; |
||||
|
for (j = 0; j < sizeof(test_values_8); ++j) |
||||
|
{ |
||||
|
f = test_values_8[j]; |
||||
|
num_failed += test_select_8(e, f); |
||||
|
num_all += 1; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
if (!num_failed) |
||||
|
{ |
||||
|
fprintf(stdout, "ok (ran %d tests)\n", num_all); |
||||
|
return EXIT_SUCCESS; |
||||
|
} |
||||
|
else |
||||
|
{ |
||||
|
fprintf(stdout, "%d of %d tests failed!\n", num_failed, num_all); |
||||
|
return EXIT_FAILURE; |
||||
|
} |
||||
|
} |
@ -0,0 +1,81 @@ |
|||||
|
=pod |
||||
|
|
||||
|
=for comment |
||||
|
Original text by James Westby, contributed under the OpenSSL license. |
||||
|
|
||||
|
=head1 NAME |
||||
|
|
||||
|
c_rehash - Create symbolic links to files named by the hash values |
||||
|
|
||||
|
=head1 SYNOPSIS |
||||
|
|
||||
|
B<c_rehash> |
||||
|
[ I<directory>...] |
||||
|
|
||||
|
=head1 DESCRIPTION |
||||
|
|
||||
|
B<c_rehash> scans directories and calculates a hash value of each C<.pem> |
||||
|
file in the specified directory list and creates symbolic links |
||||
|
for each file, where the name of the link is the hash value. |
||||
|
This utility is useful as many programs that use OpenSSL require |
||||
|
directories to be set up like this in order to find certificates. |
||||
|
|
||||
|
If any directories are named on the command line, then those are |
||||
|
processed in turn. If not, then the B<SSL_CERT_DIR> environment variable |
||||
|
is consulted; this shold be a colon-separated list of directories, |
||||
|
like the Unix B<PATH> variable. |
||||
|
If that is not set then the default directory (installation-specific |
||||
|
but often B</usr/local/ssl/certs>) is processed. |
||||
|
|
||||
|
In order for a directory to be processed, the user must have write |
||||
|
permissions on that directory, otherwise it will be skipped. |
||||
|
The links created are of the form C<HHHHHHHH.D>, where each B<H> |
||||
|
is a hexadecimal character and B<D> is a single decimal digit. |
||||
|
When processing a directory, B<c_rehash> will first remove all links |
||||
|
that have a name in that syntax. If you have links in that format |
||||
|
used for other purposes, they will be removed. |
||||
|
Hashes for CRL's look similar except the letter B<r> appears after |
||||
|
the period, like this: C<HHHHHHHH.rD>. |
||||
|
|
||||
|
Multiple objects may have the same hash; they will be indicated by |
||||
|
incrementing the B<D> value. Duplicates are found by comparing the |
||||
|
full SHA-1 fingerprint. A warning will be displayed if a duplicate |
||||
|
is found. |
||||
|
|
||||
|
A warning will also be displayed if there are B<.pem> files that |
||||
|
cannot be parsed as either a certificate or a CRL. |
||||
|
|
||||
|
The program uses the B<openssl> program to compute the hashes and |
||||
|
fingerprints. If not found in the user's B<PATH>, then set the |
||||
|
B<OPENSSL> environment variable to the full pathname. |
||||
|
Any program can be used, it will be invoked as follows for either |
||||
|
a certificate or CRL: |
||||
|
|
||||
|
$OPENSSL x509 -hash -fingerprint -noout -in FFFFFF |
||||
|
$OPENSSL crl -hash -fingerprint -noout -in FFFFFF |
||||
|
|
||||
|
where B<FFFFFF> is the filename. It must output the hash of the |
||||
|
file on the first line, and the fingerprint on the second, |
||||
|
optionally prefixed with some text and an equals sign. |
||||
|
|
||||
|
=head1 ENVIRONMENT |
||||
|
|
||||
|
=over |
||||
|
|
||||
|
=item B<OPENSSL> |
||||
|
|
||||
|
The path to an executable to use to generate hashes and |
||||
|
fingerprints (see above). |
||||
|
|
||||
|
=item B<SSL_CERT_DIR> |
||||
|
|
||||
|
Colon separated list of directories to operate on. |
||||
|
Ignored if directories are listed on the command line. |
||||
|
|
||||
|
=back |
||||
|
|
||||
|
=head1 SEE ALSO |
||||
|
|
||||
|
L<openssl(1)|openssl(1)>, |
||||
|
L<crl(1)|crl(1)>. |
||||
|
L<x509(1)|x509(1)>. |
@ -0,0 +1,330 @@ |
|||||
|
/* crypto/constant_time_test.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 "../crypto/constant_time_locl.h" |
||||
|
|
||||
|
#include <limits.h> |
||||
|
#include <stdio.h> |
||||
|
#include <stdlib.h> |
||||
|
|
||||
|
static const unsigned int CONSTTIME_TRUE = (unsigned)(~0); |
||||
|
static const unsigned int CONSTTIME_FALSE = 0; |
||||
|
static const unsigned char CONSTTIME_TRUE_8 = 0xff; |
||||
|
static const unsigned char CONSTTIME_FALSE_8 = 0; |
||||
|
|
||||
|
static int test_binary_op(unsigned int (*op)(unsigned int a, unsigned int b), |
||||
|
const char* op_name, unsigned int a, unsigned int b, int is_true) |
||||
|
{ |
||||
|
unsigned c = op(a, b); |
||||
|
if (is_true && c != CONSTTIME_TRUE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %du " |
||||
|
"(TRUE), got %du\n", op_name, a, b, CONSTTIME_TRUE, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (!is_true && c != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %du " |
||||
|
"(FALSE), got %du\n", op_name, a, b, CONSTTIME_FALSE, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_binary_op_8(unsigned char (*op)(unsigned int a, unsigned int b), |
||||
|
const char* op_name, unsigned int a, unsigned int b, int is_true) |
||||
|
{ |
||||
|
unsigned char c = op(a, b); |
||||
|
if (is_true && c != CONSTTIME_TRUE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %u " |
||||
|
"(TRUE), got %u\n", op_name, a, b, CONSTTIME_TRUE_8, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (!is_true && c != CONSTTIME_FALSE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for %s(%du, %du): expected %u " |
||||
|
"(FALSE), got %u\n", op_name, a, b, CONSTTIME_FALSE_8, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_is_zero(unsigned int a) |
||||
|
{ |
||||
|
unsigned int c = constant_time_is_zero(a); |
||||
|
if (a == 0 && c != CONSTTIME_TRUE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %du (TRUE), got %du\n", a, CONSTTIME_TRUE, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != 0 && c != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %du (FALSE), got %du\n", a, CONSTTIME_FALSE, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_is_zero_8(unsigned int a) |
||||
|
{ |
||||
|
unsigned char c = constant_time_is_zero_8(a); |
||||
|
if (a == 0 && c != CONSTTIME_TRUE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %u (TRUE), got %u\n", a, CONSTTIME_TRUE_8, c); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != 0 && c != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_is_zero(%du): " |
||||
|
"expected %u (FALSE), got %u\n", a, CONSTTIME_FALSE_8, |
||||
|
c); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_select(unsigned int a, unsigned int b) |
||||
|
{ |
||||
|
unsigned int selected = constant_time_select(CONSTTIME_TRUE, a, b); |
||||
|
if (selected != a) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %du," |
||||
|
"%du): expected %du(first value), got %du\n", |
||||
|
CONSTTIME_TRUE, a, b, a, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
selected = constant_time_select(CONSTTIME_FALSE, a, b); |
||||
|
if (selected != b) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %du," |
||||
|
"%du): expected %du(second value), got %du\n", |
||||
|
CONSTTIME_FALSE, a, b, b, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_select_8(unsigned char a, unsigned char b) |
||||
|
{ |
||||
|
unsigned char selected = constant_time_select_8(CONSTTIME_TRUE_8, a, b); |
||||
|
if (selected != a) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%u, %u," |
||||
|
"%u): expected %u(first value), got %u\n", |
||||
|
CONSTTIME_TRUE, a, b, a, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
selected = constant_time_select_8(CONSTTIME_FALSE_8, a, b); |
||||
|
if (selected != b) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%u, %u," |
||||
|
"%u): expected %u(second value), got %u\n", |
||||
|
CONSTTIME_FALSE, a, b, b, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_select_int(int a, int b) |
||||
|
{ |
||||
|
int selected = constant_time_select_int(CONSTTIME_TRUE, a, b); |
||||
|
if (selected != a) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %d," |
||||
|
"%d): expected %d(first value), got %d\n", |
||||
|
CONSTTIME_TRUE, a, b, a, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
selected = constant_time_select_int(CONSTTIME_FALSE, a, b); |
||||
|
if (selected != b) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_select(%du, %d," |
||||
|
"%d): expected %d(second value), got %d\n", |
||||
|
CONSTTIME_FALSE, a, b, b, selected); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_eq_int(int a, int b) |
||||
|
{ |
||||
|
unsigned int equal = constant_time_eq_int(a, b); |
||||
|
if (a == b && equal != CONSTTIME_TRUE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int(%d, %d): " |
||||
|
"expected %du(TRUE), got %du\n", |
||||
|
a, b, CONSTTIME_TRUE, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != b && equal != CONSTTIME_FALSE) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int(%d, %d): " |
||||
|
"expected %du(FALSE), got %du\n", |
||||
|
a, b, CONSTTIME_FALSE, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static int test_eq_int_8(int a, int b) |
||||
|
{ |
||||
|
unsigned char equal = constant_time_eq_int_8(a, b); |
||||
|
if (a == b && equal != CONSTTIME_TRUE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int_8(%d, %d): " |
||||
|
"expected %u(TRUE), got %u\n", |
||||
|
a, b, CONSTTIME_TRUE_8, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
else if (a != b && equal != CONSTTIME_FALSE_8) |
||||
|
{ |
||||
|
fprintf(stderr, "Test failed for constant_time_eq_int_8(%d, %d): " |
||||
|
"expected %u(FALSE), got %u\n", |
||||
|
a, b, CONSTTIME_FALSE_8, equal); |
||||
|
return 1; |
||||
|
} |
||||
|
return 0; |
||||
|
} |
||||
|
|
||||
|
static unsigned int test_values[] = {0, 1, 1024, 12345, 32000, UINT_MAX/2-1, |
||||
|
UINT_MAX/2, UINT_MAX/2+1, UINT_MAX-1, |
||||
|
UINT_MAX}; |
||||
|
|
||||
|
static unsigned char test_values_8[] = {0, 1, 2, 20, 32, 127, 128, 129, 255}; |
||||
|
|
||||
|
static int signed_test_values[] = {0, 1, -1, 1024, -1024, 12345, -12345, |
||||
|
32000, -32000, INT_MAX, INT_MIN, INT_MAX-1, |
||||
|
INT_MIN+1}; |
||||
|
|
||||
|
|
||||
|
int main(int argc, char *argv[]) |
||||
|
{ |
||||
|
unsigned int a, b, i, j; |
||||
|
int c, d; |
||||
|
unsigned char e, f; |
||||
|
int num_failed = 0, num_all = 0; |
||||
|
fprintf(stdout, "Testing constant time operations...\n"); |
||||
|
|
||||
|
for (i = 0; i < sizeof(test_values)/sizeof(int); ++i) |
||||
|
{ |
||||
|
a = test_values[i]; |
||||
|
num_failed += test_is_zero(a); |
||||
|
num_failed += test_is_zero_8(a); |
||||
|
num_all += 2; |
||||
|
for (j = 0; j < sizeof(test_values)/sizeof(int); ++j) |
||||
|
{ |
||||
|
b = test_values[j]; |
||||
|
num_failed += test_binary_op(&constant_time_lt, |
||||
|
"constant_time_lt", a, b, a < b); |
||||
|
num_failed += test_binary_op_8(&constant_time_lt_8, |
||||
|
"constant_time_lt_8", a, b, a < b); |
||||
|
num_failed += test_binary_op(&constant_time_lt, |
||||
|
"constant_time_lt_8", b, a, b < a); |
||||
|
num_failed += test_binary_op_8(&constant_time_lt_8, |
||||
|
"constant_time_lt_8", b, a, b < a); |
||||
|
num_failed += test_binary_op(&constant_time_ge, |
||||
|
"constant_time_ge", a, b, a >= b); |
||||
|
num_failed += test_binary_op_8(&constant_time_ge_8, |
||||
|
"constant_time_ge_8", a, b, a >= b); |
||||
|
num_failed += test_binary_op(&constant_time_ge, |
||||
|
"constant_time_ge", b, a, b >= a); |
||||
|
num_failed += test_binary_op_8(&constant_time_ge_8, |
||||
|
"constant_time_ge_8", b, a, b >= a); |
||||
|
num_failed += test_binary_op(&constant_time_eq, |
||||
|
"constant_time_eq", a, b, a == b); |
||||
|
num_failed += test_binary_op_8(&constant_time_eq_8, |
||||
|
"constant_time_eq_8", a, b, a == b); |
||||
|
num_failed += test_binary_op(&constant_time_eq, |
||||
|
"constant_time_eq", b, a, b == a); |
||||
|
num_failed += test_binary_op_8(&constant_time_eq_8, |
||||
|
"constant_time_eq_8", b, a, b == a); |
||||
|
num_failed += test_select(a, b); |
||||
|
num_all += 13; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
for (i = 0; i < sizeof(signed_test_values)/sizeof(int); ++i) |
||||
|
{ |
||||
|
c = signed_test_values[i]; |
||||
|
for (j = 0; j < sizeof(signed_test_values)/sizeof(int); ++j) |
||||
|
{ |
||||
|
d = signed_test_values[j]; |
||||
|
num_failed += test_select_int(c, d); |
||||
|
num_failed += test_eq_int(c, d); |
||||
|
num_failed += test_eq_int_8(c, d); |
||||
|
num_all += 3; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
for (i = 0; i < sizeof(test_values_8); ++i) |
||||
|
{ |
||||
|
e = test_values_8[i]; |
||||
|
for (j = 0; j < sizeof(test_values_8); ++j) |
||||
|
{ |
||||
|
f = test_values_8[j]; |
||||
|
num_failed += test_select_8(e, f); |
||||
|
num_all += 1; |
||||
|
} |
||||
|
} |
||||
|
|
||||
|
if (!num_failed) |
||||
|
{ |
||||
|
fprintf(stdout, "ok (ran %d tests)\n", num_all); |
||||
|
return EXIT_SUCCESS; |
||||
|
} |
||||
|
else |
||||
|
{ |
||||
|
fprintf(stdout, "%d of %d tests failed!\n", num_failed, num_all); |
||||
|
return EXIT_FAILURE; |
||||
|
} |
||||
|
} |
Loading…
Reference in new issue