summaryrefslogtreecommitdiffstats
path: root/crypto/constant_time_test.c
blob: 89fad7d3f25bcc38ff4f3d0cb4fd19c3c4a9d981 (plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
/* 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 = ~0;
static const unsigned int CONSTTIME_FALSE = 0;
static const unsigned char CONSTTIME_TRUE_8 = ~0;
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 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};

int main(int argc, char *argv[])
	{
	unsigned int a, b, i, j;
	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_failed += test_binary_op(&constant_time_lt,
			"constant_time_lt", a, a, 0);
		num_failed += test_binary_op_8(&constant_time_lt_8,
			"constant_time_lt_8", a, a, 0);
		num_failed += test_binary_op(&constant_time_ge,
			"constant_time_ge", a, a, 1);
		num_failed += test_binary_op_8(&constant_time_ge_8,
			"constant_time_ge_8", a, a, 1);
		num_failed += test_binary_op(&constant_time_eq,
			"constant_time_eq", a, a, 1);
		num_failed += test_binary_op_8(&constant_time_eq_8,
			"constant_time_eq_8", a, a, 1);
		num_all += 8;
		for (j = i + 1; 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_all += 12;
			}
		}

	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;
		}
	}