forked from SideChannelMarvels/Stark
-
Notifications
You must be signed in to change notification settings - Fork 0
/
DES.c
395 lines (344 loc) · 11.5 KB
/
DES.c
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
/* Unlicensed original code taken from https://github.com/mimoo/DES
* - David Wong, [email protected]
* - Jacques Monin, [email protected]
* - Hugo Bonnin, [email protected]
*/
#include <stdbool.h>
#include <stdlib.h>
#include <stdio.h>
#include <stdint.h>
#include "DES.h"
//////////////////////////////////////////////////////
// GLOBAL VARIABLES //
////////////////////////////////////////////////////
// Tables bellow can be verified on wikipedia:
// http://en.wikipedia.org/wiki/DES_supplementary_material#Initial_permutation_.28IP.29
// Key schedule tables
const int PC1[56] = {
57, 49, 41, 33, 25, 17, 9,
1, 58, 50, 42, 34, 26, 18,
10, 2, 59, 51, 43, 35, 27,
19, 11, 3, 60, 52, 44, 36,
63, 55, 47, 39, 31, 23, 15,
7, 62, 54, 46, 38, 30, 22,
14, 6, 61, 53, 45, 37, 29,
21, 13, 5, 28, 20, 12, 4
};
const int Rotations[16] = {
1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
};
const int PC2[48] = {
14, 17, 11, 24, 1, 5,
3, 28, 15, 6, 21, 10,
23, 19, 12, 4, 26, 8,
16, 7, 27, 20, 13, 2,
41, 52, 31, 37, 47, 55,
30, 40, 51, 45, 33, 48,
44, 49, 39, 56, 34, 53,
46, 42, 50, 36, 29, 32
};
// Permutation tables
const int InitialPermutation[64] = {
58, 50, 42, 34, 26, 18, 10, 2,
60, 52, 44, 36, 28, 20, 12, 4,
62, 54, 46, 38, 30, 22, 14, 6,
64, 56, 48, 40, 32, 24, 16, 8,
57, 49, 41, 33, 25, 17, 9, 1,
59, 51, 43, 35, 27, 19, 11, 3,
61, 53, 45, 37, 29, 21, 13, 5,
63, 55, 47, 39, 31, 23, 15, 7
};
const int FinalPermutation[64] = {
40, 8, 48, 16, 56, 24, 64, 32,
39, 7, 47, 15, 55, 23, 63, 31,
38, 6, 46, 14, 54, 22, 62, 30,
37, 5, 45, 13, 53, 21, 61, 29,
36, 4, 44, 12, 52, 20, 60, 28,
35, 3, 43, 11, 51, 19, 59, 27,
34, 2, 42, 10, 50, 18, 58, 26,
33, 1, 41, 9, 49, 17, 57, 25
};
// Rounds tables
const int DesExpansion[48] = {
32, 1, 2, 3, 4, 5, 4, 5,
6, 7, 8, 9, 8, 9, 10, 11,
12, 13, 12, 13, 14, 15, 16, 17,
16, 17, 18, 19, 20, 21, 20, 21,
22, 23, 24, 25, 24, 25, 26, 27,
28, 29, 28, 29, 30, 31, 32, 1
};
const int DesSbox[8][4][16] = {
{
{14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7},
{ 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8},
{ 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0},
{15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13},
},
{
{15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10},
{ 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5},
{ 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15},
{13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9},
},
{
{10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8},
{13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1},
{13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7},
{ 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12},
},
{
{ 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15},
{13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9},
{10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4},
{ 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14},
},
{
{ 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9},
{14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6},
{ 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14},
{11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3},
},
{
{12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11},
{10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8},
{ 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6},
{ 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13},
},
{
{ 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1},
{13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6},
{ 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2},
{ 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12},
},
{
{13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7},
{ 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2},
{ 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8},
{ 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11},
},
};
const int Pbox[32] = {
16, 7, 20, 21, 29, 12, 28, 17,
1, 15, 23, 26, 5, 18, 31, 10,
2, 8, 24, 14, 32, 27, 3, 9,
19, 13, 30, 6, 22, 11, 4, 25
};
//////////////////////////////////////////////////////
// FUNCTIONS //
////////////////////////////////////////////////////
void addbit(uint64_t *block, uint64_t from,
int position_from, int position_to)
{
if(((from << (position_from)) & FIRSTBIT) != 0)
*block += (FIRSTBIT >> position_to);
}
void Permutation(uint64_t* data, bool initial)
{
uint64_t data_temp = 0;
for(int ii = 0; ii < 64; ii++)
{
if(initial)
addbit(&data_temp, *data, InitialPermutation[ii] - 1, ii);
else
addbit(&data_temp, *data, FinalPermutation[ii] - 1, ii);
}
*data = data_temp;
}
bool key_parity_verify(uint64_t key)
{
int parity_bit = 0; // Parity helper
for(int ii = 0; ii < 64; ii++)
{
// Test the parity bit (8-th bit)
if(ii % 8 == 7)
{
if(parity_bit == 0)
{
// Test if 8-th bit != 0
if( ((key << ii) & FIRSTBIT) != (uint64_t)0)
{
printf("parity error at bit #%i\n", ii + 1);
return false;
}
}
else
{
// Test if 8-th bit != 1
if( ((key << ii) & FIRSTBIT) != FIRSTBIT)
{
printf("parity error at bit #%i\n", ii + 1);
return false;
}
}
parity_bit = 0; // Re-init parity_bit for next byte block
}
// Count numbers of 1 in the 7bit block
else
{
if( ((key << ii) & FIRSTBIT) == FIRSTBIT)
parity_bit = parity_bit == 0 ? 1 : 0;
}
}
return true;
}
void key_schedule(uint64_t* key, uint64_t* next_key, int round)
{
// Init
uint64_t key_left = 0;
uint64_t key_right = 0;
uint64_t key_left_temp = 0;
uint64_t key_right_temp = 0;
*next_key = 0; // Important !
// 1. First round => PC-1 : Permuted Choice 1
if(round == 0)
{
for(int ii = 0; ii < 56; ii++)
{
if(ii < 28)
addbit(&key_left, *key, PC1[ii] - 1, ii);
else
addbit(&key_right, *key, PC1[ii] - 1, ii % 28);
}
}
// 1'. Other rounds? => Seperate key into two key halves.
else
{
for(int ii = 0; ii < 56; ii++)
{
if(ii < 28)
addbit(&key_left, *key, ii, ii);
else
addbit(&key_right, *key, ii, ii % 28);
}
}
// 2. Rotations
key_left_temp = Rotations[round] == 1 ? FIRSTBIT : 0xC000000000000000;
key_right_temp = Rotations[round] == 1 ? FIRSTBIT : 0xC000000000000000;
key_left_temp = (key_left & key_left_temp) >> (28 - Rotations[round]);
key_right_temp = (key_right & key_right_temp) >> (28 - Rotations[round]);
key_left_temp += (key_left << Rotations[round]);
key_right_temp += (key_right << Rotations[round]);
// Combine the 2 keys into 1 (next_key)
// Next_key will be used for following rounds
for(int ii = 0; ii < 56; ii++)
{
if(ii < 28)
addbit(next_key, key_left_temp, ii, ii);
else
addbit(next_key, key_right_temp, (ii % 28), ii);
}
// 3. PC-2 : Permuted Choice 2
*key = 0;
for(int ii = 0; ii < 48; ii++)
addbit(key, *next_key, PC2[ii] - 1, ii);
// All Good!
// Use key in the DES rounds.
// Use next_key in this function again as the new key to change
}
void reverse_key_schedule(uint64_t round_key, int round, uint64_t* possible_keys) {
// First determine the bit mapping from the round key to the key
char bitmap64[64];
char bitmap56[56];
char bitmap48[48];
// PC1
for(int i = 0; i < 56; i++) {
bitmap56[i] = PC1[i]-1;
}
// Shifting
for(int i = 0; i <= round; i++) {
for(int j = 0; j < Rotations[round]; j++) {
int temp = bitmap56[0];
for(int k = 0; k < 27; k++) {
bitmap56[k] = bitmap56[k+1];
}
bitmap56[27] = temp;
temp = bitmap56[28];
for(int k = 28; k < 55; k++) {
bitmap56[k] = bitmap56[k+1];
}
bitmap56[55] = temp;
}
}
// PC2
for(int i = 0; i < 56; i++) {
bitmap48[i] = bitmap56[PC2[i]-1];
}
// Inverse bitmap48
for(int i = 0; i < 64; i++) {
bitmap64[i] = -1;
for(int j = 0; j < 48; j++) {
if(bitmap48[j] == i) {
bitmap64[i] = j;
break;
}
}
}
// Iterate over possible missing 8 bits and compute the key
for(uint64_t i = 0; i < 256; i++) {
int missing_bit_counter = 0;
uint64_t parity_sum = 0;
possible_keys[i] = 0;
for(int j = 0; j < 64; j++) {
if(j%8 < 7) {
if(bitmap64[j] == -1) {
addbit(&possible_keys[i], i << 56, missing_bit_counter, j);
missing_bit_counter += 1;
}
else {
addbit(&possible_keys[i], round_key, bitmap64[j], j);
}
parity_sum ^= (possible_keys[i]<<j) & FIRSTBIT;
}
// Parity bit
else {
addbit(&possible_keys[i], parity_sum, 0, j);
parity_sum = 0;
}
}
if(missing_bit_counter != 8) {
fprintf(stderr, "Error in key generation procedure, missing_bit_counter : %d\n", missing_bit_counter);
}
}
}
void rounds(uint64_t *data, uint64_t key)
{
uint64_t right_block = 0;
uint64_t right_block_temp = 0;
// 1. Block expansion
for(int ii = 0; ii < 48; ii++)
addbit(&right_block, *data, (DesExpansion[ii] + 31), ii);
// 2. Xor with the key
right_block = right_block ^ key;
// 3. Substitution
int coordx, coordy;
uint64_t substitued;
for(int ii = 0; ii < 8; ii++)
{
coordx = ((right_block << 6 * ii) & FIRSTBIT) == FIRSTBIT ? 2 : 0;
if( ((right_block << (6 * ii + 5)) & FIRSTBIT) == FIRSTBIT)
coordx++;
coordy = 0;
for(int jj = 1; jj < 5; jj++)
{
if( ((right_block << (6 * ii + jj)) & FIRSTBIT) == FIRSTBIT)
{
coordy += 1<<(4 - jj);
}
}
substitued = DesSbox[ii][coordx][coordy];
substitued = substitued << (60 - (4 * ii));
right_block_temp += substitued;
}
// Right_block done
right_block = right_block_temp;
// 4. Permutation
right_block_temp = 0;
for(int ii = 0; ii < 32; ii++)
addbit(&right_block_temp, right_block, Pbox[ii] - 1, ii);
right_block = right_block_temp;
// 5. Xor with the left block
right_block = right_block ^ *data;
// Combine the new block and the right block
*data = (*data << 32) + (right_block >> 32);
}
// End of file