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
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
|
/*
Copyright (c) 2012, Matthias Schiffer <mschiffer@universe-factory.net>
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 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 HOLDER 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 "fastd.h"
#include <asm/byteorder.h>
#include <crypto_stream_aes128ctr.h>
#define NONCEBYTES 7
#define BLOCKBYTES 16
#define BLOCKQWORDS (BLOCKBYTES/8)
struct _fastd_method_session_state {
struct timespec valid_till;
struct timespec refresh_after;
uint8_t d[crypto_stream_aes128ctr_BEFORENMBYTES];
uint64_t H[8*BLOCKBYTES*BLOCKQWORDS];
uint8_t send_nonce[NONCEBYTES];
uint8_t receive_nonce[NONCEBYTES];
struct timespec receive_last;
uint64_t receive_reorder_seen;
};
static inline void increment_nonce(uint8_t nonce[NONCEBYTES]) {
nonce[0] += 2;
if (nonce[0] == 0 || nonce[0] == 1) {
int i;
for (i = 1; i < NONCEBYTES; i++) {
nonce[i]++;
if (nonce[i] != 0)
break;
}
}
}
static inline bool is_nonce_valid(const uint8_t nonce[NONCEBYTES], const uint8_t old_nonce[NONCEBYTES], int64_t *age) {
if ((nonce[0] & 1) != (old_nonce[0] & 1))
return false;
int i;
*age = 0;
for (i = NONCEBYTES-1; i >= 0; i--) {
*age *= 256;
*age += old_nonce[i]-nonce[i];
}
*age /= 2;
return true;
}
static size_t method_max_packet_size(fastd_context *ctx) {
return (fastd_max_packet_size(ctx) + NONCEBYTES + BLOCKBYTES);
}
static size_t method_min_encrypt_head_space(fastd_context *ctx) {
return 0;
}
static size_t method_min_decrypt_head_space(fastd_context *ctx) {
return 0;
}
static const uint64_t r[BLOCKQWORDS] = {__constant_cpu_to_le64(0x87)};
static inline unsigned int shl1(uint8_t out[BLOCKBYTES], const uint8_t in[BLOCKBYTES]) {
int i;
uint8_t c = 0;
for (i = 0; i < BLOCKBYTES; i++) {
uint8_t c2 = in[i] >> 7;
out[i] = (in[i] << 1) | c;
c = c2;
}
return c;
}
static inline void xor_if(uint64_t x[BLOCKQWORDS], const uint64_t a[BLOCKQWORDS], uint64_t b) {
uint64_t mask = -b;
x[0] ^= (mask & a[0]);
x[1] ^= (mask & a[1]);
}
static fastd_method_session_state* method_session_init(fastd_context *ctx, uint8_t *secret, size_t length, bool initiator) {
int i;
if (length < crypto_stream_aes128ctr_KEYBYTES)
exit_bug(ctx, "aes128-gcm: tried to init with short secret");
fastd_method_session_state *session = malloc(sizeof(fastd_method_session_state));
session->valid_till = ctx->now;
session->valid_till.tv_sec += ctx->conf->key_valid;
session->refresh_after = ctx->now;
session->refresh_after.tv_sec += ctx->conf->key_refresh;
crypto_stream_aes128ctr_beforenm(session->d, secret);
uint8_t zerononce[crypto_stream_aes128ctr_NONCEBYTES];
memset(zerononce, 0, crypto_stream_aes128ctr_NONCEBYTES);
crypto_stream_aes128ctr_afternm((uint8_t*)session->H, BLOCKBYTES, zerononce, session->d);
for (i = 1; i < 8*BLOCKBYTES; i++) {
unsigned int carry = shl1((uint8_t*)(session->H + i*BLOCKQWORDS), (uint8_t*)(session->H + (i-1)*BLOCKQWORDS));
xor_if(session->H + i*BLOCKQWORDS, r, carry);
}
session->send_nonce[0] = initiator ? 3 : 2;
session->receive_nonce[0] = initiator ? 0 : 1;
for (i = 1; i < NONCEBYTES; i++) {
session->send_nonce[i] = 0;
session->receive_nonce[i] = 0;
}
return session;
}
static bool method_session_is_valid(fastd_context *ctx, fastd_method_session_state *session) {
return (session && timespec_after(&session->valid_till, &ctx->now));
}
static bool method_session_is_initiator(fastd_context *ctx, fastd_method_session_state *session) {
return (session->send_nonce[0] & 1);
}
static bool method_session_want_refresh(fastd_context *ctx, fastd_method_session_state *session) {
return timespec_after(&ctx->now, &session->refresh_after);
}
static void method_session_free(fastd_context *ctx, fastd_method_session_state *session) {
if(session) {
memset(session, 0, sizeof(fastd_method_session_state));
free(session);
}
}
static inline void xor(uint8_t *x, const uint8_t *a, const uint8_t *b, unsigned int l) {
int i;
for (i = 0; i < l; i++)
x[i] = a[i] ^ b[i];
}
#define BITOF(x, b) ((x[b/8] >> (b%8)) & 1)
static void mulH(uint8_t out[BLOCKBYTES], const uint8_t in[BLOCKBYTES], fastd_method_session_state *session) {
uint64_t out2[BLOCKQWORDS];
memset(out2, 0, BLOCKBYTES);
int i;
for (i = 0; i < 8*BLOCKBYTES; i++)
xor_if(out2, session->H + i*BLOCKQWORDS, BITOF(in, i));
memcpy(out, out2, BLOCKBYTES);
}
#define BLOCKPTR(buf, i) (((uint8_t*)(buf))+i*BLOCKBYTES)
static bool method_encrypt(fastd_context *ctx, fastd_peer *peer, fastd_method_session_state *session, fastd_buffer *out, fastd_buffer in) {
*out = fastd_buffer_alloc(in.len, NONCEBYTES+BLOCKBYTES, 0);
uint8_t *sig = ((uint8_t*)out->data) - BLOCKBYTES;
memset(sig, 0, BLOCKBYTES);
uint8_t nonce[crypto_stream_aes128ctr_NONCEBYTES];
memcpy(nonce, session->send_nonce, NONCEBYTES);
memset(nonce+NONCEBYTES, 0, crypto_stream_aes128ctr_NONCEBYTES-NONCEBYTES-1);
nonce[crypto_stream_aes128ctr_NONCEBYTES-1] = 1;
uint8_t stream[in.len+BLOCKBYTES];
crypto_stream_aes128ctr_afternm(stream, in.len+BLOCKBYTES, nonce, session->d);
int blocks = (in.len+BLOCKBYTES-1)/BLOCKBYTES;
int i;
for (i = 0; i < blocks; i++) {
int len = BLOCKBYTES;
if (i == blocks-1)
len = in.len - i*BLOCKBYTES;
xor(BLOCKPTR(out->data, i), BLOCKPTR(in.data, i), BLOCKPTR(stream, i+1), len);
xor(sig, sig, BLOCKPTR(out->data, i), len);
mulH(sig, sig, session);
}
sig[BLOCKBYTES-8] ^= (in.len >> 53) & 0xff;
sig[BLOCKBYTES-7] ^= (in.len >> 45) & 0xff;
sig[BLOCKBYTES-6] ^= (in.len >> 37) & 0xff;
sig[BLOCKBYTES-5] ^= (in.len >> 29) & 0xff;
sig[BLOCKBYTES-4] ^= (in.len >> 21) & 0xff;
sig[BLOCKBYTES-3] ^= (in.len >> 13) & 0xff;
sig[BLOCKBYTES-2] ^= (in.len >> 5) & 0xff;
sig[BLOCKBYTES-1] ^= (in.len << 3) & 0xff;
mulH(sig, sig, session);
xor(sig, sig, stream, BLOCKBYTES);
fastd_buffer_free(in);
fastd_buffer_pull_head(out, NONCEBYTES+BLOCKBYTES);
memcpy(out->data, session->send_nonce, NONCEBYTES);
increment_nonce(session->send_nonce);
return true;
}
static bool method_decrypt(fastd_context *ctx, fastd_peer *peer, fastd_method_session_state *session, fastd_buffer *out, fastd_buffer in) {
if (in.len < NONCEBYTES+BLOCKBYTES)
return false;
if (!method_session_is_valid(ctx, session))
return false;
uint8_t nonce[crypto_stream_aes128ctr_NONCEBYTES];
memcpy(nonce, in.data, NONCEBYTES);
memset(nonce+NONCEBYTES, 0, crypto_stream_aes128ctr_NONCEBYTES-NONCEBYTES-1);
nonce[crypto_stream_aes128ctr_NONCEBYTES-1] = 1;
int64_t age;
if (!is_nonce_valid(nonce, session->receive_nonce, &age))
return false;
if (age >= 0) {
if (timespec_diff(&ctx->now, &session->receive_last) > ctx->conf->reorder_time*1000)
return false;
if (age > ctx->conf->reorder_count)
return false;
}
fastd_buffer_push_head(&in, NONCEBYTES+BLOCKBYTES);
*out = fastd_buffer_alloc(in.len, 0, 0);
uint8_t sig[BLOCKBYTES];
memset(sig, 0, BLOCKBYTES);
uint8_t stream[in.len+BLOCKBYTES];
crypto_stream_aes128ctr_afternm(stream, in.len+BLOCKBYTES, nonce, session->d);
int blocks = (in.len+BLOCKBYTES-1)/BLOCKBYTES;
int i;
for (i = 0; i < blocks; i++) {
int len = BLOCKBYTES;
if (i == blocks-1)
len = in.len - i*BLOCKBYTES;
xor(BLOCKPTR(out->data, i), BLOCKPTR(in.data, i), BLOCKPTR(stream, i+1), len);
xor(sig, sig, BLOCKPTR(in.data, i), len);
mulH(sig, sig, session);
}
sig[BLOCKBYTES-8] ^= (in.len >> 53) & 0xff;
sig[BLOCKBYTES-7] ^= (in.len >> 45) & 0xff;
sig[BLOCKBYTES-6] ^= (in.len >> 37) & 0xff;
sig[BLOCKBYTES-5] ^= (in.len >> 29) & 0xff;
sig[BLOCKBYTES-4] ^= (in.len >> 21) & 0xff;
sig[BLOCKBYTES-3] ^= (in.len >> 13) & 0xff;
sig[BLOCKBYTES-2] ^= (in.len >> 5) & 0xff;
sig[BLOCKBYTES-1] ^= (in.len << 3) & 0xff;
mulH(sig, sig, session);
xor(sig, sig, stream, BLOCKBYTES);
fastd_buffer_pull_head(&in, BLOCKBYTES);
if (memcmp(sig, in.data, BLOCKBYTES) != 0) {
fastd_buffer_free(*out);
/* restore input buffer */
fastd_buffer_pull_head(&in, NONCEBYTES);
return false;
}
fastd_buffer_free(in);
if (age < 0) {
session->receive_reorder_seen >>= age;
session->receive_reorder_seen |= (1 >> (age+1));
memcpy(session->receive_nonce, nonce, NONCEBYTES);
session->receive_last = ctx->now;
}
else if (age == 0 || session->receive_reorder_seen & (1 << (age-1))) {
pr_debug(ctx, "dropping duplicate packet from %P (age %u)", peer, (unsigned)age);
fastd_buffer_free(*out);
*out = fastd_buffer_alloc(0, 0, 0);
}
else {
pr_debug(ctx, "accepting reordered packet from %P (age %u)", peer, (unsigned)age);
session->receive_reorder_seen |= (1 << (age-1));
}
return true;
}
const fastd_method fastd_method_aes128_gcm = {
.name = "aes128-gcm",
.max_packet_size = method_max_packet_size,
.min_encrypt_head_space = method_min_encrypt_head_space,
.min_decrypt_head_space = method_min_decrypt_head_space,
.session_init = method_session_init,
.session_is_valid = method_session_is_valid,
.session_is_initiator = method_session_is_initiator,
.session_want_refresh = method_session_want_refresh,
.session_free = method_session_free,
.encrypt = method_encrypt,
.decrypt = method_decrypt,
};
|