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
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
|
//
// simple driver to test "ecdhp384" core in hardware
//
//
// note, that the test program needs a custom bitstream where
// the core is located at offset 0 (without the core selector)
//
// stm32 headers
#include "stm-init.h"
#include "stm-led.h"
#include "stm-fmc.h"
// locations of core registers
#define CORE_ADDR_NAME0 (0x00 << 2)
#define CORE_ADDR_NAME1 (0x01 << 2)
#define CORE_ADDR_VERSION (0x02 << 2)
#define CORE_ADDR_CONTROL (0x08 << 2)
#define CORE_ADDR_STATUS (0x09 << 2)
// locations of data buffers
#define CORE_ADDR_BUF_K (0x80 << 2)
#define CORE_ADDR_BUF_XIN (0x90 << 2)
#define CORE_ADDR_BUF_YIN (0xA0 << 2)
#define CORE_ADDR_BUF_XOUT (0xB0 << 2)
#define CORE_ADDR_BUF_YOUT (0xC0 << 2)
// bit maps
#define CORE_CONTROL_BIT_NEXT 0x00000002
#define CORE_STATUS_BIT_READY 0x00000002
// curve selection
#define USE_CURVE 2
#include "../../../user/shatov/ecdh_fpga_model/ecdh_fpga_model.h"
#include "../../../user/shatov/ecdh_fpga_model/test_vectors/ecdh_test_vectors.h"
#define BUF_NUM_WORDS (OPERAND_WIDTH / (sizeof(uint32_t) << 3)) // 8
//
// test vectors
//
static const uint32_t p384_da[BUF_NUM_WORDS] = P_384_DA;
static const uint32_t p384_db[BUF_NUM_WORDS] = P_384_DB;
static const uint32_t p384_gx[BUF_NUM_WORDS] = P_384_G_X;
static const uint32_t p384_gy[BUF_NUM_WORDS] = P_384_G_Y;
static const uint32_t p384_qax[BUF_NUM_WORDS] = P_384_QA_X;
static const uint32_t p384_qay[BUF_NUM_WORDS] = P_384_QA_Y;
static const uint32_t p384_qbx[BUF_NUM_WORDS] = P_384_QB_X;
static const uint32_t p384_qby[BUF_NUM_WORDS] = P_384_QB_Y;
static const uint32_t p384_qa2x[BUF_NUM_WORDS] = P_384_QA2_X;
static const uint32_t p384_qa2y[BUF_NUM_WORDS] = P_384_QA2_Y;
static const uint32_t p384_qb2x[BUF_NUM_WORDS] = P_384_QB2_X;
static const uint32_t p384_qb2y[BUF_NUM_WORDS] = P_384_QB2_Y;
static const uint32_t p384_sx[BUF_NUM_WORDS] = P_384_S_X;
static const uint32_t p384_sy[BUF_NUM_WORDS] = P_384_S_Y;
static const uint32_t p384_0[BUF_NUM_WORDS] = P_384_ZERO;
static const uint32_t p384_1[BUF_NUM_WORDS] = P_384_ONE;
static const uint32_t p384_hx[BUF_NUM_WORDS] = P_384_H_X;
static const uint32_t p384_hy[BUF_NUM_WORDS] = P_384_H_Y;
static const uint32_t p384_n[BUF_NUM_WORDS] = P_384_N;
static uint32_t p384_2[BUF_NUM_WORDS]; // 2
static uint32_t p384_n1[BUF_NUM_WORDS]; // n + 1
static uint32_t p384_n2[BUF_NUM_WORDS]; // n + 2
//
// prototypes
//
void toggle_yellow_led(void);
int test_p384_multiplier(const uint32_t *k,
const uint32_t *xin, const uint32_t *yin,
const uint32_t *xout, const uint32_t *yout);
//
// test routine
//
int main()
{
int ok;
stm_init();
fmc_init();
led_on(LED_GREEN);
led_off(LED_RED);
led_off(LED_YELLOW);
led_off(LED_BLUE);
uint32_t core_name0;
uint32_t core_name1;
fmc_read_32(CORE_ADDR_NAME0, &core_name0);
fmc_read_32(CORE_ADDR_NAME1, &core_name1);
// "ecdh", "p384"
if ((core_name0 != 0x65636468) || (core_name1 != 0x70333834)) {
led_off(LED_GREEN);
led_on(LED_RED);
while (1);
}
// prepare more numbers
size_t w;
for (w=0; w<BUF_NUM_WORDS; w++)
{ p384_2[w] = p384_0[w]; // p384_2 = p384_z = 0
p384_n1[w] = p384_n[w]; // p384_n1 = p384_n = N
p384_n2[w] = p384_n[w]; // p384_n2 = p384_n = N
}
// note, that we can safely cheat and compute n+1 and n+2 by
// just adding 1 and 2 to the least significant word of n, the
// word itself is 0xccc52973, so it will not overflow and we don't
// need to take care of carry propagation
p384_2[BUF_NUM_WORDS-1] += 2; // p384_2 = 2
p384_n1[BUF_NUM_WORDS-1] += 1; // p384_n1 = N + 1
p384_n2[BUF_NUM_WORDS-1] += 2; // p384_n2 = N + 2
// repeat forever
while (1)
{
ok = 1;
/* 1. QA = dA * G */
/* 2. QB = dB * G */
ok = ok && test_p384_multiplier(p384_da, p384_gx, p384_gy, p384_qax, p384_qay);
ok = ok && test_p384_multiplier(p384_db, p384_gx, p384_gy, p384_qbx, p384_qby);
/* 3. S = dA * QB */
/* 4. S = dB * QA */
ok = ok && test_p384_multiplier(p384_da, p384_qbx, p384_qby, p384_sx, p384_sy);
ok = ok && test_p384_multiplier(p384_db, p384_qax, p384_qay, p384_sx, p384_sy);
/* 5. O = 0 * QA */
/* 6. O = 0 * QB */
ok = ok && test_p384_multiplier(p384_0, p384_qax, p384_qay, p384_0, p384_0);
ok = ok && test_p384_multiplier(p384_0, p384_qbx, p384_qby, p384_0, p384_0);
/* 7. QA = 1 * QA */
/* 8. QB = 1 * QB */
ok = ok && test_p384_multiplier(p384_1, p384_qax, p384_qay, p384_qax, p384_qay);
ok = ok && test_p384_multiplier(p384_1, p384_qbx, p384_qby, p384_qbx, p384_qby);
/* 9. O = n * G */
ok = ok && test_p384_multiplier(p384_n, p384_gx, p384_gy, p384_0, p384_0);
/* 10. G = (n + 1) * G */
ok = ok && test_p384_multiplier(p384_n1, p384_gx, p384_gy, p384_gx, p384_gy);
/* 11. H = 2 * G */
/* 12. H = (n + 2) * G */
ok = ok && test_p384_multiplier(p384_2, p384_gx, p384_gy, p384_hx, p384_hy);
ok = ok && test_p384_multiplier(p384_n2, p384_gx, p384_gy, p384_hx, p384_hy);
/* 13. QA2 = 2 * QA */
/* 14. QA2 = (n + 2) * QA */
ok = ok && test_p384_multiplier(p384_2, p384_qax, p384_qay, p384_qa2x, p384_qa2y);
ok = ok && test_p384_multiplier(p384_n2, p384_qax, p384_qay, p384_qa2x, p384_qa2y);
/* 15. QB2 = 2 * QB */
/* 16. QB2 = (n + 2) * QB */
ok = ok && test_p384_multiplier(p384_2, p384_qbx, p384_qby, p384_qb2x, p384_qb2y);
ok = ok && test_p384_multiplier(p384_n2, p384_qbx, p384_qby, p384_qb2x, p384_qb2y);
// check
if (!ok) {
led_off(LED_GREEN);
led_on(LED_RED);
}
toggle_yellow_led();
}
}
//
// this routine uses the hardware multiplier to obtain R(rx, ry), which is the
// scalar multiple of the point P(xin, yin), rx and ry are then compared to the values
// xout and yout (correct result known in advance)
//
int test_p384_multiplier(const uint32_t *k,
const uint32_t *xin, const uint32_t *yin,
const uint32_t *xout, const uint32_t *yout)
{
int i, num_cyc;
uint32_t reg_control, reg_status;
uint32_t k_word, qx_word, qy_word;
// fill k
for (i=0; i<BUF_NUM_WORDS; i++) {
k_word = k[i];
fmc_write_32(CORE_ADDR_BUF_K + ((BUF_NUM_WORDS - (i + 1)) * sizeof(uint32_t)), &k_word);
}
// fill xin, yin
for (i=0; i<BUF_NUM_WORDS; i++) {
qx_word = xin[i];
qy_word = yin[i];
fmc_write_32(CORE_ADDR_BUF_XIN + ((BUF_NUM_WORDS - (i + 1)) * sizeof(uint32_t)), &qx_word);
fmc_write_32(CORE_ADDR_BUF_YIN + ((BUF_NUM_WORDS - (i + 1)) * sizeof(uint32_t)), &qy_word);
}
// clear 'next' control bit, then set 'next' control bit again to trigger new operation
reg_control = 0;
fmc_write_32(CORE_ADDR_CONTROL, ®_control);
reg_control = CORE_CONTROL_BIT_NEXT;
fmc_write_32(CORE_ADDR_CONTROL, ®_control);
// wait for 'ready' status bit to be set
num_cyc = 0;
do {
num_cyc++;
fmc_read_32(CORE_ADDR_STATUS, ®_status);
}
while (!(reg_status & CORE_STATUS_BIT_READY));
// read back x and y word-by-word, then compare to the reference values
for (i=0; i<BUF_NUM_WORDS; i++) {
fmc_read_32(CORE_ADDR_BUF_XOUT + (i * sizeof(uint32_t)), &qx_word);
fmc_read_32(CORE_ADDR_BUF_YOUT + (i * sizeof(uint32_t)), &qy_word);
if ((qx_word != xout[BUF_NUM_WORDS - (i + 1)])) return 0;
if ((qy_word != yout[BUF_NUM_WORDS - (i + 1)])) return 0;
}
// everything went just fine
return 1;
}
//
// toggle the yellow led to indicate that we're not stuck somewhere
//
void toggle_yellow_led(void)
{
static int led_state = 0;
led_state = !led_state;
if (led_state) led_on(LED_YELLOW);
else led_off(LED_YELLOW);
}
//
// end of file
//
|
