-
Notifications
You must be signed in to change notification settings - Fork 0
/
dpf.cpp
481 lines (459 loc) · 15.8 KB
/
dpf.cpp
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
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
#include "dpf.h"
#include "Defines.h"
#include "PRNG.h"
#include "AES.h"
#include "Log.h"
#include <iostream>
#include <cassert>
namespace DPF {
namespace prg {
inline block getL(const block& seed) {
return mAesFixedKey.encryptECB_MMO(seed);
}
inline block getR(const block& seed) {
return mAesFixedKey2.encryptECB_MMO(seed);
}
inline std::array<block,8> getL8(const std::array<block,8>& seed) {
std::array<block,8> out;
mAesFixedKey.encryptECB_MMO_Blocks(seed.data(), 8, out.data());
return out;
}
inline std::array<block,8> getR8(const std::array<block,8>& seed) {
std::array<block,8> out;
mAesFixedKey2.encryptECB_MMO_Blocks(seed.data(), 8, out.data());
return out;
}
}
inline block clr(block in) {
return in & ~MSBBlock;
}
inline bool getT(block in) {
return !is_zero(in & MSBBlock);
}
inline void clr8(std::array<block, 8>& in) {
for(int i = 0; i < 8; i++) {
in[i] &= ~MSBBlock;
}
}
inline std::array<uint8_t,8> getT8(const std::array<block,8>& in) {
std::array<uint8_t,8> out;
for(int i = 0; i < 8; i++) {
out[i] = !is_zero(in[i] & MSBBlock);
}
return out;
}
inline bool ConvertBit(block in) {
return !is_zero(in & LSBBlock);
}
inline block ConvertBlock(block in) {
return mAesFixedKey.encryptECB(in);
}
inline std::array<block,8> ConvertBlock8(const std::array<block,8>& in) {
std::array<block,8> out;
mAesFixedKey.encryptECBBlocks(in.data(), 8, out.data());
return out;
}
std::pair<std::vector<uint8_t>, std::vector<uint8_t>> Gen(size_t alpha, size_t logn) {
assert(logn <= 63);
assert(alpha < (1<<logn));
std::vector<uint8_t> ka, kb, CW;
PRNG p = PRNG::getTestPRNG();
block s0, s1;
uint8_t t0, t1;
p.get((uint8_t *) &s0, sizeof(s0));
p.get((uint8_t *) &s1, sizeof(s1));
t0 = getT(s0);
t1 = !t0;
s0 = clr(s0);
s1 = clr(s1);
ka.insert(ka.end(), (uint8_t*)&s0, ((uint8_t*)&s0) + sizeof(s0));
ka.push_back(t0);
kb.insert(kb.end(), (uint8_t*)&s1, ((uint8_t*)&s1) + sizeof(s1));
kb.push_back(t1);
// std::cout << ka.hex() << std::endl;
// std::cout << kb.hex() << std::endl;
size_t stop = logn >=7 ? logn - 7 : 0; // pack 7 layers in final CW
for(size_t i = 0; i < stop; i++) {
Log::v("gen", "%d, %d", t0, t1);
Log::v("gen", s0);
Log::v("gen", s1);
block s0L = prg::getL(s0);
uint8_t t0L = getT(s0L);
s0L = clr(s0L);
block s0R = prg::getR(s0);
uint8_t t0R = getT(s0R);
s0R = clr(s0R);
block s1L = prg::getL(s1);
uint8_t t1L = getT(s1L);
s1L = clr(s1L);
block s1R = prg::getR(s1);
uint8_t t1R = getT(s1R);
s1R = clr(s1R);
if(alpha & (1ULL << (logn-1-i))) {
//KEEP = R, LOSE = L
block scw = s0L ^ s1L;
uint8_t tLCW = t0L ^ t1L;
uint8_t tRCW = t0R ^ t1R ^ 1;
CW.insert(CW.end(), (uint8_t*)&scw, ((uint8_t*)&scw) + sizeof(scw));
CW.push_back(tLCW);
CW.push_back(tRCW);
s0 = s0R;
if(t0) s0 = s0 ^ scw;
s1 = s1R;
if(t1) s1 = s1 ^ scw;
// new t
if(t0) t0 = t0R ^ tRCW;
else t0 = t0R;
if(t1) t1 = t1R ^ tRCW;
else t1 = t1R;
}
else {
//KEEP = L, LOSE = R
block scw = s0R ^ s1R;
uint8_t tLCW = t0L ^ t1L ^ 1;
uint8_t tRCW = t0R ^ t1R;
CW.insert(CW.end(), (uint8_t*)&scw, ((uint8_t*)&scw) + sizeof(scw));
CW.push_back(tLCW);
CW.push_back(tRCW);
//new s
s0 = s0L;
if(t0) s0 = s0 ^ scw;
s1 = s1L;
if(t1) s1 = s1 ^ scw;
// new t
if(t0) t0 = t0L ^ tLCW;
else t0 = t0L;
if(t1) t1 = t1L ^ tLCW;
else t1 = t1L;
}
}
reg_arr_union tmp = {ZeroBlock};
tmp.arr[(alpha&127)/8] = (uint8_t)(1U<<((alpha&127)%8));
tmp.reg = tmp.reg ^ ConvertBlock(s0) ^ ConvertBlock(s1);
CW.insert(CW.end(), (uint8_t*)&tmp.reg, ((uint8_t*)&tmp.reg) + sizeof(tmp.reg));
ka.insert(ka.end(), CW.begin(), CW.end());
kb.insert(kb.end(), CW.begin(), CW.end());
return std::make_pair(ka, kb);
}
bool Eval(const std::vector<uint8_t>& key, size_t x, size_t logn) {
assert(logn <= 63);
assert(x < (1<<logn));
block s;
memcpy(&s, key.data(), 16);
uint8_t t = key.data()[16];
size_t stop = logn >=7 ? logn - 7 : 0; // pack 7 layers in final CW
for(size_t i = 0; i < stop; i++) {
Log::v("eval", s);
Log::v("eval", "t: %d", t);
block sL = prg::getL(s);
uint8_t tL = getT(sL);
sL = clr(sL);
block sR = prg::getR(s);
uint8_t tR = getT(sR);
sR = clr(sR);
if(t) {
block sCW;
memcpy(&sCW, key.data() + 17 + i*18, 16);
uint8_t tLCW = key.data()[17+i*18+16];
uint8_t tRCW = key.data()[17+i*18+17];
Log::v("eval", "tcw %d %d", tLCW, tRCW);
tL^=tLCW;
tR^=tRCW;
sL^=sCW;
sR^=sCW;
}
if(x & (1ULL<<(logn-1-i))) {
s = sR;
t = tR;
} else {
s = sL;
t = tL;
}
}
Log::v("evalfin", s);
if(t) {
reg_arr_union tmp;
reg_arr_union CW;
memcpy(CW.arr, key.data()+key.size()-16, 16);
tmp.reg = CW.reg ^ ConvertBlock(s);
return (tmp.arr[(x&127)/8] & (1UL << ((x&127)%8))) != 0;
}
else {
reg_arr_union tmp;
tmp.reg = ConvertBlock(s);
return (tmp.arr[(x&127)/8] & (1UL << ((x&127)%8))) != 0;
}
}
void EvalFullRecursive(const std::vector<uint8_t>& key, block s, uint8_t t, size_t lvl, size_t stop, std::vector<uint8_t>& res) {
if(lvl == stop) {
if(t) {
reg_arr_union tmp;
reg_arr_union CW;
memcpy(CW.arr, key.data()+key.size()-16, 16);
tmp.reg = CW.reg ^ ConvertBlock(s);
res.insert(res.end(), &tmp.arr[0], &tmp.arr[16]);
}
else {
reg_arr_union tmp;
tmp.reg = ConvertBlock(s);
res.insert(res.end(), &tmp.arr[0], &tmp.arr[16]);
}
return;
}
block sL = prg::getL(s);
uint8_t tL = getT(sL);
sL = clr(sL);
block sR = prg::getR(s);
uint8_t tR = getT(sR);
sR = clr(sR);
if(t) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
// block* sCW = (block*) key.data() + 17 + lvl*18;
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tL^=tLCW;
tR^=tRCW;
sL^=sCW;
sR^=sCW;
}
Log::v("-sL", sL);
EvalFullRecursive(key, sL, tL, lvl+1, stop, res);
Log::v("-sR", sR);
EvalFullRecursive(key, sR, tR, lvl+1, stop, res);
}
std::vector<uint8_t> EvalFull(const std::vector<uint8_t>& key, size_t logn) {
assert(logn <= 63);
std::vector<uint8_t> data;
if(logn >= 7)
data.reserve(1ULL << (logn-3));
block s;
memcpy(&s, key.data(), 16);
uint8_t t = key.data()[16];
size_t stop = logn >=7 ? logn - 7 : 0; // pack 7 layers in final CW
EvalFullRecursive(key, s, t, 0, stop, data);
return data;
}
// optimized for vectorized ops
void EvalFullRecursive8(const std::vector<uint8_t>& key, std::array<block, 8>& s, std::array<uint8_t,8>& t, size_t lvl, size_t stop, std::array<uint8_t*,8>& res) {
if(lvl == stop) {
std::array<reg_arr_union,8> tmp;
reg_arr_union CW;
memcpy(CW.arr, key.data() + key.size() - 16, 16);
std::array<block, 8> conv = ConvertBlock8(s);
for (int i = 0; i < 8; i++) {
block tt = _mm_set1_epi8(-(t[i]));
tmp[i].reg = conv[i] ^ (CW.reg & tt);
memcpy(res[i], tmp[i].arr, 16);
res[i] += sizeof(block);
}
return;
}
std::array<block,8> sL = prg::getL8(s);
std::array<uint8_t,8> tL = getT8(sL);
clr8(sL);
std::array<block,8> sR = prg::getR8(s);
std::array<uint8_t,8> tR = getT8(sR);
clr8(sR);
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
for(int i = 0; i < 8; i++) {
tL[i] ^= (tLCW & t[i]);
tR[i] ^= (tRCW & t[i]);
block tt = _mm_set1_epi8(-(t[i]));
sL[i] ^= (sCW & tt);
sR[i] ^= (sCW & tt);
}
EvalFullRecursive8(key, sL, tL, lvl+1, stop, res);
EvalFullRecursive8(key, sR, tR, lvl+1, stop, res);
}
std::vector<uint8_t> EvalFull8(const std::vector<uint8_t>& key, size_t logn) {
assert(logn <= 63);
std::vector<uint8_t> data;
data.resize(1ULL << (logn - 3));
std::array<uint8_t*,8> data_ptrs;
for(size_t i = 0; i < 8; i++) {
data_ptrs[i] = &data[i*(1ULL << (logn - 3 - 3))];
}
block s;
memcpy(&s, key.data(), 16);
uint8_t t = key.data()[16];
size_t stop = logn >=7 ? logn - 7 : 0; // pack 7 layers in final CW
assert(stop >= 3); // need 3 or more layers for this to make sense
// evaluate first 3 layers
size_t lvl = 0;
block sL = prg::getL(s);
uint8_t tL = getT(sL);
sL = clr(sL);
block sR = prg::getR(s);
uint8_t tR = getT(sR);
sR = clr(sR);
if(t) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tL^=tLCW;
tR^=tRCW;
sL^=sCW;
sR^=sCW;
}
lvl = 1;
block sLL = prg::getL(sL);
uint8_t tLL = getT(sLL);
sLL = clr(sLL);
block sRL = prg::getR(sL);
uint8_t tRL = getT(sRL);
sRL = clr(sRL);
if(tL) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tLL^=tLCW;
tRL^=tRCW;
sLL^=sCW;
sRL^=sCW;
}
block sLR = prg::getL(sR);
uint8_t tLR = getT(sLR);
sLR = clr(sLR);
block sRR = prg::getR(sR);
uint8_t tRR = getT(sRR);
sRR = clr(sRR);
if(tR) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tLR^=tLCW;
tRR^=tRCW;
sLR^=sCW;
sRR^=sCW;
}
lvl = 2;
block sLLL = prg::getL(sLL);
uint8_t tLLL = getT(sLLL);
sLLL = clr(sLLL);
block sRLL = prg::getR(sLL);
uint8_t tRLL = getT(sRLL);
sRLL = clr(sRLL);
if(tLL) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tLLL^=tLCW;
tRLL^=tRCW;
sLLL^=sCW;
sRLL^=sCW;
}
block sLRL = prg::getL(sRL);
uint8_t tLRL = getT(sLRL);
sLRL = clr(sLRL);
block sRRL = prg::getR(sRL);
uint8_t tRRL = getT(sRRL);
sRRL = clr(sRRL);
if(tRL) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tLRL^=tLCW;
tRRL^=tRCW;
sLRL^=sCW;
sRRL^=sCW;
}
block sLLR = prg::getL(sLR);
uint8_t tLLR = getT(sLLR);
sLLR = clr(sLLR);
block sRLR = prg::getR(sLR);
uint8_t tRLR = getT(sRLR);
sRLR = clr(sRLR);
if(tLR) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tLLR^=tLCW;
tRLR^=tRCW;
sLLR^=sCW;
sRLR^=sCW;
}
block sLRR = prg::getL(sRR);
uint8_t tLRR = getT(sLRR);
sLRR = clr(sLRR);
block sRRR = prg::getR(sRR);
uint8_t tRRR = getT(sRRR);
sRRR = clr(sRRR);
if(tRR) {
block sCW;
memcpy(&sCW, key.data() + 17 + lvl*18, 16);
uint8_t tLCW = key.data()[17+lvl*18+16];
uint8_t tRCW = key.data()[17+lvl*18+17];
tLRR^=tLCW;
tRRR^=tRCW;
sLRR^=sCW;
sRRR^=sCW;
}
std::array<block, 8> s_array{sLLL, sRLL, sLRL, sRRL, sLLR, sRLR, sLRR, sRRR};
std::array<uint8_t, 8> t_array{tLLL, tRLL, tLRL, tRRL, tLLR, tRLR, tLRR, tRRR};
EvalFullRecursive8(key, s_array, t_array, 3, stop, data_ptrs);
return data;
}
// std::vector<uint8_t> EvalFullNonRec(const std::vector<uint8_t>& key, size_t logn) {
// assert(logn <= 63);
// std::vector<uint8_t> data;
// std::vector<block> sL_vals;
// std::vector<block> sR_vals;
// std::vector<int> tL_vals;
// std::vector<int> tR_vals;
// data.reserve(1ULL << (logn-3));
// block s;
// memcpy(&s, key.data(), 16);
// uint8_t t = key.data()[16];
// size_t stop = logn >=7 ? logn - 7 : 0; // pack 7 layers in final CW
//
// for(size_t lvl = 0; lvl < stop; lvl++) {
// const size_t layersize = (1 << lvl);
// block sCW;
// memcpy(&sCW, key.data() + 17 + lvl * 18, 16);
// uint8_t tLCW = key.data()[17 + lvl * 18 + 16];
// uint8_t tRCW = key.data()[17 + lvl * 18 + 17];
// for(int j = 0; j < layersize; j++) {
// block sL = prg::getL(s);
// uint8_t tL = getT(sL);
// sL = clr(sL);
// block sR = prg::getR(s);
// uint8_t tR = getT(sR);
// sR = clr(sR);
// if (t) {
// Log::v("eval", "tcw %d %d", tLCW, tRCW);
// tL ^= tLCW;
// tR ^= tRCW;
// sL ^= sCW;
// sR ^= sCW;
// }
// }
// }
//
// if(lvl == stop) {
// if(t) {
// reg_arr_union tmp;
// reg_arr_union CW;
// memcpy(CW.arr, key.data()+key.size()-16, 16);
// tmp.reg = CW.reg ^ ConvertBlock(s);
// res.insert(res.end(), &tmp.arr[0], &tmp.arr[16]);
// }
// else {
// reg_arr_union tmp;
// tmp.reg = ConvertBlock(s);
// res.insert(res.end(), &tmp.arr[0], &tmp.arr[16]);
// }
// return;
// }
// return data;
// }
}