-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathutils.cpp
More file actions
543 lines (457 loc) · 11 KB
/
utils.cpp
File metadata and controls
543 lines (457 loc) · 11 KB
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
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
#include "utils.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
#include <iostream>
#include <time.h>
int istext_r(int val)
{
return isalnum(val) || (val == ' ') || (val == 0xa) || (val == 0xd) || val == ',' ||
val == '!' || val == '-' || val == '.' || val == ';';
}
int istext(int val)
{
return isalnum(val) || (val == ' ') || (val == 0xa) || (val == 0xd) || ispunct(val);
}
int ispasswd(int val)
{
return isalnum(val) || ispunct(val);
}
int hexchartoi(char c)
{
if (c >= '0' && c <= '9')
{
return c - '0';
}
if (c >= 'a' && c <= 'f')
{
return c - 'a' + 0xa;
}
if (c >= 'A' && c <= 'F')
{
return c - 'A' + 0xa;
}
std::cout << "\nhexchartoi unexpected " << (int)c << std::endl;
return 0;
}
char itohexchar(int c)
{
if (c >= 0 && c <= 9)
{
return c + '0';
}
if (c >= 0xa && c <= 0xf)
{
return c - 0xa + 'a';
}
std::cout << "\nitohexchar unexpected " << c << std::endl;
return '!';
}
int hexstring_to_bytes(const char* in, size_t insz, unsigned char* out, size_t outsz)
{
int i = 0;
while (i < outsz && 2*i+1 < insz)
{
if (in[i] == 0) break;
out[i] = (hexchartoi(in[2 * i]) << 4) + hexchartoi(in[2 * i + 1]);
i++;
}
return i;
}
int bytes_to_hexstring(const unsigned char* in, size_t insz, unsigned char* out, size_t outsz)
{
int i = 0;
while (2 * i + 1 < outsz && i < insz)
{
out[2 * i] = itohexchar(in[i] >> 4);
out[2 * i + 1] = itohexchar(in[i] & 0xf);
i++;
}
return i;
}
int xor_fixed(const unsigned char* first, const unsigned char* second, unsigned char* out, size_t sz)
{
int i = 0;
while (i < sz)
{
out[i] = first[i] ^ second[i];
i++;
}
return i;
}
int xor_key(const unsigned char* phrase, size_t phrasesz, const unsigned char* key, size_t keysz, unsigned char* out, size_t outsz)
{
int i = 0, j = 0;
size_t limit = phrasesz < outsz ? phrasesz : outsz;
while (i < limit)
{
out[i] = phrase[i] ^ key[j];
i++;
j++;
if (j >= keysz) j = 0;
}
return i;
}
static float en_freq_tbl[256];
void character_frequency_table_init()
{
memset(en_freq_tbl, 0, sizeof(en_freq_tbl));
const char text[] = "the cryptopals crypto challenges"
"Challenges Set 1 Challenge 3"
"Single - byte XOR cipher"
"The hex encoded string :"
"... has been XOR'd against a single character. Find the key, decrypt the message."
"You can do this by hand.But don't: write code to do it for you."
"How ? Devise some method for \"scoring\" a piece of English plaintext.Character frequency is a good metric.Evaluate each output and choose the one with the best score."
"Achievement Unlocked"
"You now have our permission to make \"ETAOIN SHRDLU\" jokes on Twitter."
"Cryptography Services | NCC Group";
int i = 0;
#if 1
const float increment = 1.0f / (sizeof(text) - 1);
while (i < sizeof(text) - 1)
{
int a = tolower(text[i]);
en_freq_tbl[a] += increment;
i++;
}
#endif
#if 0
en_freq_tbl['a'] = 0.08167f;
en_freq_tbl['b'] = 0.01492f;
en_freq_tbl['c'] = 0.02782f;
en_freq_tbl['d'] = 0.04253f;
en_freq_tbl['e'] = 0.12702f;
en_freq_tbl['f'] = 0.02228f;
en_freq_tbl['g'] = 0.02015f;
en_freq_tbl['h'] = 0.06094f;
en_freq_tbl['i'] = 0.06966f;
en_freq_tbl['j'] = 0.00153f;
en_freq_tbl['k'] = 0.00772f;
en_freq_tbl['l'] = 0.04025f;
en_freq_tbl['m'] = 0.02406f;
en_freq_tbl['n'] = 0.06749f;
en_freq_tbl['o'] = 0.07507f;
en_freq_tbl['p'] = 0.01929f;
en_freq_tbl['q'] = 0.00095f;
en_freq_tbl['r'] = 0.05987f;
en_freq_tbl['s'] = 0.06327f;
en_freq_tbl['t'] = 0.09056f;
en_freq_tbl['u'] = 0.02758f;
en_freq_tbl['v'] = 0.00978f;
en_freq_tbl['w'] = 0.02360f;
en_freq_tbl['x'] = 0.00150f;
en_freq_tbl['y'] = 0.01974f;
en_freq_tbl['z'] = 0.00074f;
#endif
#if 0
std::cout << "\nFrequency table english text\n";
float xx = 0;
i = 0;
while (i < sizeof(en_freq_tbl)/ sizeof(en_freq_tbl[0]))
{
float val = en_freq_tbl[i];
if (val)
{
xx += val;
std::cout << (char)i << ": " << val << std::endl;
}
i++;
}
std::cout << "totals: " << xx << std::endl;
#endif
}
float character_frequency_calculate(const unsigned char* input, size_t insz)
{
float *local_tbl = (float*)malloc(sizeof(en_freq_tbl));
if (local_tbl == NULL) return -1;
memset(local_tbl, 0, sizeof(en_freq_tbl));
const float increment = 1.0f / insz;
int i = 0;
while (i < insz)
{
local_tbl[tolower(input[i])] += increment;
i++;
}
#if 0
std::cout << "\nFrequency table NEW text\n";
float xx = 0;
i = 0;
while (i < sizeof(en_freq_tbl) / sizeof(en_freq_tbl[0]))
{
float val = local_tbl[i];
if (val != 0.0f)
{
xx += val;
std::cout << (char)i << ": " << val << std::endl;
}
i++;
}
std::cout << "totals: " << xx << std::endl;
#endif
float count = 0;
i = sizeof(en_freq_tbl)/sizeof(en_freq_tbl[0]) -1;
while (i >= 0)
{
if (/*en_freq_tbl[i] != 0 &&*/ local_tbl[i] != 0.0f)
{
count += fabs(en_freq_tbl[i] - local_tbl[i]);
}
i--;
}
free(local_tbl);
return count;
}
int hamming_distance_calculate(const unsigned char* first, const unsigned char* second, size_t sz)
{
int ret = 0;
int i = 0;
while (i < sz)
{
unsigned int val = first[i] ^ second[i];
i++;
int j;
for(j = 0; j < 8; j++)
{
unsigned int bitval = val & 1;
val = val >> 1;
if (bitval) ret++;
}
}
return ret;
}
void data_buffer_adjust(uc8_t ** memory, size_t* allocatedsz, size_t newsize)
{
if (newsize > *allocatedsz)
{
if (*memory == NULL)
{
*memory = (uc8_t*)malloc(newsize);
if (*memory == NULL) exit(-1);
}
else
{
uc8_t * t = (uc8_t*)realloc(*memory, newsize);
if (t == NULL) exit(-1);
*memory = t;
}
*allocatedsz = newsize;
}
}
void random_init()
{
static int initialised = 0;
if (initialised == 0)
{
unsigned int seed = (unsigned int)time(NULL);
srand(seed);
initialised = 1;
std::cout << "seed: " << seed << std::endl;
}
}
void random_bytes(uc8_t* out, int size)
{
random_init();
int i;
for (i = 0; i < size; i++)
{
out[i] = rand() % 0x100;
}
}
void random_text(uc8_t* out, int size)
{
random_init();
int i;
for (i = 0; i < size; )
{
int val = rand();
uc8_t* itr = (uc8_t*)&val;
for (int j = 0; j < sizeof(val); j++, itr++)
{
if (ispasswd(*itr))
{
out[i] = *itr;
i++;
break;
}
}
}
}
void membuf_init(membuf* mb)
{
mb->data = NULL;
mb->size = 0;
mb->used = 0;
}
void membuf_adjust_size(membuf* mb, size_t newsize)
{
if (newsize > mb->size)
{
if (mb->data == NULL)
{
mb->data = (uc8_t*)malloc(newsize);
if (mb->data == NULL) exit(-1);
}
else
{
uc8_t* t = (uc8_t*)realloc(mb->data, newsize);
if (t == NULL) exit(-1);
mb->data = t;
}
mb->size = newsize;
}
}
void membuf_yield(membuf* mb, uc8_t **recipient)
{
if (mb->data && recipient)
{
*recipient = mb->data;
mb->data = NULL;
}
mb->size = 0;
mb->used = 0;
}
void membuf_move(membuf* dst, membuf* src)
{
membuf_free(dst);
dst->data = src->data;
dst->size = src->size;
dst->used = src->used;
src->data = NULL;
src->size = 0;
src->used = 0;
}
void membuf_free(membuf* mb)
{
if (mb->data)
{
free(mb->data);
mb->data = NULL;
}
mb->size = 0;
mb->used = 0;
}
void membuf_clear(membuf* mb)
{
mb->used = 0;
}
void membuf_copy(membuf* dst, const membuf* src)
{
if (dst != src && dst->data && src->data)
{
size_t size = dst->size < src->used ? dst->size : src->used;
memcpy(dst->data, src->data, size);
dst->used = size;
}
}
void membuf_copy_auto(membuf* dst, const membuf* src)
{
if (dst != src)
{
membuf_adjust_size(dst, src->used);
membuf_copy(dst, src);
}
}
void membuf_append_byte_auto(membuf* mb, uc8_t value)
{
int used = mb->used;
if (used + 1 > mb->size)
membuf_adjust_size(mb, used + 1);
mb->data[used] = value;
mb->used++;
}
void membuf_append_data_auto(membuf* mb, uc8_t *data, size_t sz)
{
int used = mb->used;
if (used + sz > mb->size)
membuf_adjust_size(mb, used + sz);
memcpy(&(mb->data[used]), data, sz);
mb->used += sz;
}
void membuf_prepend_byte_auto(membuf* mb, uc8_t value)
{
int used = mb->used;
if (used + 1 > mb->size)
membuf_adjust_size(mb, used + 1);
uc8_t* tmp = &mb->data[used];
for (int i = 0; i < used; i++, tmp--)
{
*tmp = *(tmp - 1);
}
mb->data[0] = value;
mb->used++;
}
void membuf_set_byte_auto(membuf* mb, uc8_t value, int pos, uc8_t padding)
{
int used = mb->used;
if (pos + 1 > mb->size)
{
membuf_adjust_size(mb, pos + 1);
}
if (pos >= used)
{
//last byte will be filled-in later
memset(mb->data + used, padding, pos - used);
mb->used = pos + 1;
}
mb->data[pos] = value;
}
size_t pad_data_buffer(uc8_t** memory, size_t* memsz, size_t used_size, size_t block_size)
{
size_t requiredsz = (used_size + block_size) / block_size;
requiredsz *= block_size;
data_buffer_adjust(memory, memsz, requiredsz);
int padval = requiredsz - used_size;
if (padval < requiredsz)
memset(&(*memory)[used_size], padval, padval);
return requiredsz;
}
size_t unpad_data_buffer(uc8_t* data, size_t used_size)
{
size_t ret = used_size;
uc8_t* iter = &data[used_size - 1];
int padval = *iter;
if (padval >= used_size)
return -1;
int found = 1;
iter--;
int i;
for (i = 1; i < padval; i++, iter--)
{
if (*iter == padval)
found++;
}
if (found != padval)
{
//std::cout << "problem with padding " << found << " " << padval << std::endl;
ret = -2;
}
else
{
iter[1] = 0;
ret -= padval;
}
return ret;
}
void make_printable(uc8_t* text, int len)
{
for (int i = 0; i < len; i++)
{
int val = text[i];
if (!ispasswd(val))
text[i] = ' ';
}
}
void MD4(
char* hash_out,
const char* str,
uint32_t len)
{
MD4_CTX ctx;
unsigned int ii;
MD4_Init(&ctx);
for (ii = 0; ii < len; ii += 1)
MD4_Update(&ctx, (const unsigned char*)str + ii, 1);
MD4_Final((unsigned char*)hash_out, &ctx);
}