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
|
/*
* test-rsa.c
* ----------
* First stumblings towards a test harness for RSA using Cryptech
* ModExp core.
*
* For the moment this just does modular exponentiation tests using
* RSA keys and pre-formatted data-to-be-signed, without attempting
* CRT or any of the other clever stuff we should be doing. This is
* not usable for any sane purpose other than testing.
*
* Authors: Rob Austein
* Copyright (c) 2015, SUNET
*
* 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 above 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.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "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
* COPYRIGHT OWNER 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.
*/
#include <stdio.h>
#include <stdint.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <sys/time.h>
#include "cryptech.h"
#include "test-rsa.h"
/*
* Run one modexp test.
*/
static int test_modexp(const char * const kind,
const rsa_tc_t * const tc,
const rsa_tc_bn_t * const msg, /* Input message */
const rsa_tc_bn_t * const exp, /* Exponent */
const rsa_tc_bn_t * const val) /* Expected result */
{
uint8_t result[tc->n.len];
printf("%s test for %lu-bit RSA key\n", kind, (unsigned long) tc->size);
if (hal_modexp(msg->val, msg->len, exp->val, exp->len,
tc->n.val, tc->n.len, result, sizeof(result)) != HAL_OK) {
printf("ModExp failed\n");
return 0;
}
if (memcmp(result, val->val, val->len)) {
printf("MISMATCH\n");
return 0;
}
printf("OK\n");
return 1;
}
/*
* Run one RSA CRT test.
*/
static int test_crt(const char * const kind, const rsa_tc_t * const tc)
{
uint8_t result[tc->n.len];
printf("%s test for %lu-bit RSA key\n", kind, (unsigned long) tc->size);
if (hal_rsa_crt(tc->m.val, tc->m.len,
tc->n.val, tc->n.len,
tc->e.val, tc->e.len,
tc->d.val, tc->d.len,
tc->p.val, tc->p.len,
tc->q.val, tc->q.len,
tc->u.val, tc->u.len,
result, sizeof(result)) != HAL_OK) {
printf("RSA CRT failed\n");
return 0;
}
if (memcmp(result, tc->s.val, tc->s.len)) {
printf("MISMATCH\n");
return 0;
}
printf("OK\n");
return 1;
}
#define time_check(_expr_) \
do { \
struct timeval _t1, _t2, _td; \
gettimeofday(&_t1, NULL); \
int _ok = (_expr_); \
gettimeofday(&_t2, NULL); \
_td.tv_sec = _t2.tv_sec - _t1.tv_sec; \
_td.tv_usec = _t2.tv_usec - _t1.tv_usec; \
if (_td.tv_usec < 0) { \
_td.tv_usec += 1000000; \
_td.tv_sec -= 1; \
} \
printf("%lu.%06lu %s\n", \
(unsigned long) _td.tv_sec, \
(unsigned long) _td.tv_usec, \
_ok ? "OK" : "FAILED"); \
if (!_ok) \
return 0; \
} while (0)
/*
* Test signature and exponentiation for one RSA keypair.
*/
static int test_rsa(const rsa_tc_t * const tc)
{
/* RSA encryption */
time_check(test_modexp("Verification", tc, &tc->s, &tc->e, &tc->m));
/* Brute force RSA decryption */
time_check(test_modexp("Signature (ModExp)", tc, &tc->m, &tc->d, &tc->s));
/* RSA decyrption using CRT */
time_check(test_crt("Signature (CRT)", tc));
return 1;
}
int main(int argc, char *argv[])
{
uint8_t name[8], version[4];
hal_error_t err;
int i;
/*
* Initialize EIM and report what core we're running.
*/
if ((err = hal_io_read(MODEXP_ADDR_NAME0, name, sizeof(name))) != HAL_OK ||
(err = hal_io_read(MODEXP_ADDR_VERSION, version, sizeof(version))) != HAL_OK) {
printf("Initialization failed: %s\n", hal_error_string(err));
return 1;
}
printf("\"%8.8s\" \"%4.4s\"\n\n", name, version);
/*
* Run the test cases.
*/
hal_modexp_set_debug(1);
for (i = 0; i < (sizeof(rsa_tc)/sizeof(*rsa_tc)); i++)
if (!test_rsa(&rsa_tc[i]))
return 1;
return 0;
}
/*
* Local variables:
* indent-tabs-mode: nil
* End:
*/
|
