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
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
|
/* -*- Mode:C; c-basic-offset:8; tab-width:8; indent-tabs-mode:t -*- */
/*
* Copyright (C) 2004-2018 by the University of Southern California
* $Id: 35e089a7da2122012654b19832826c3224f1f2dc $
*
* This program is free software; you can redistribute it and/or
* modify it under the terms of the GNU General Public License,
* version 2, as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 59 Temple Place, Suite 330, Boston, MA 02111-1307, USA.
*
*/
// #ifndef lint
// static const char rcsid[] =
// "@(#) $Id: 35e089a7da2122012654b19832826c3224f1f2dc $";
// #endif
#include <stdio.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <netinet/in.h>
#include <fcntl.h>
#include <stdint.h>
#include <ctype.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <errno.h>
#include <assert.h>
#include <openssl/md5.h>
#include <openssl/blowfish.h>
#include <openssl/sha.h>
#include <openssl/aes.h>
#include "cryptopANT.h"
#define MAX_BLK_LENGTH 32
#define CACHE_BITS 24 /* How many bits of IPv4 we cache, cannot be zero */
#define BF_KEYLEN 16 /* bytes */
#define TEST_CACHE 0
#define RESET_ETHER_MCAST(p) (*(char*)(p) &= 0xfe)
#ifndef MAX
#define MAX(a,b) ((a) > (b) ? (a) : (b))
#endif
#ifdef HAVE__U6_ADDR32
#define s6_addr32 __u6_addr.__u6_addr32
#endif
//determined by autoconf
#ifdef WORDS_BIGENDIAN
//sigh, older version of the code was not byte-order safe; this is needed
//to ensure backward compatibility AND compatibility with BE-systems.
#include <byteswap.h>
#define cryptopant_swap32(x) bswap_32(x)
#else
#define cryptopant_swap32(x) (x)
#endif
typedef struct ipv4_hash_blk_ {
uint32_t ip4;
uint8_t pad[MAX_BLK_LENGTH - sizeof(uint32_t)];
} ipv4_hash_blk_t;
typedef struct ipv6_hash_blk_ {
struct in6_addr ip6;
uint8_t pad[MAX_BLK_LENGTH - sizeof(struct in6_addr)];
} ipv6_hash_blk_t;
uint8_t scramble_ether_addr[ETHER_ADDR_LEN];
uint16_t scramble_ether_vlan;
int scramble_mac;
static int readhexstring (FILE *, u_char *, int *);
static uint32_t ip4cache[1<<CACHE_BITS];
static uint32_t ip4pad; /* first 4 bytes of pad */
static uint32_t ip6pad[4];
static u_char scramble_mac_buf[MAX_BLK_LENGTH];
static struct {
AES_KEY aeskey;
BF_KEY bfkey;
} scramble_key;
static uint8_t ivec[64];
/* statistics */
static long ipv4_cache_hits = 0;
static long ipv4_anon_calls = 0;
static long ipv6_anon_calls = 0;
static ipv4_hash_blk_t b4_in, b4_out;
static ipv6_hash_blk_t b6_in, b6_out;
static scramble_crypt_t scramble_crypto4 = SCRAMBLE_BLOWFISH;
static scramble_crypt_t scramble_crypto6 = SCRAMBLE_BLOWFISH;
static struct {
char *name;
scramble_crypt_t type;
} scramble_names[] = {
{ "md5", SCRAMBLE_MD5 },
{ "blowfish", SCRAMBLE_BLOWFISH },
{ "aes", SCRAMBLE_AES },
{ "sha", SCRAMBLE_SHA1 },
};
const char *
scramble_type2name(scramble_crypt_t t)
{
int i;
for (i = 0; i < sizeof(scramble_names)/sizeof(scramble_names[0]); ++i)
if (scramble_names[i].type == t)
return scramble_names[i].name;
return NULL;
}
scramble_crypt_t
scramble_name2type(const char *name)
{
int i;
for (i = 0; i < sizeof(scramble_names)/sizeof(scramble_names[0]); ++i)
if (strcasecmp(name, scramble_names[i].name) == 0)
return scramble_names[i].type;
return SCRAMBLE_NONE;
}
scramble_crypt_t
scramble_crypto_ip4(void)
{
return scramble_crypto4;
}
scramble_crypt_t
scramble_crypto_ip6(void)
{
return scramble_crypto6;
}
int
scramble_newkey(u_char *key, int klen)
{
FILE *rnd = fopen(SCRAMBLE_RANDOM_DEV, "r");
if (rnd == NULL) {
perror("scramble_newkey(): fopen");
return -1;
}
if (fread(key, 1, klen, rnd) != klen) {
perror("scramble_newkey(): fread");
fclose(rnd);
return -1;
}
fclose(rnd);
return 0;
}
int
scramble_newpad(u_char *pad, int plen)
{
FILE *rnd = fopen(SCRAMBLE_RANDOM_DEV, "r");
if (rnd == NULL) {
perror("scramble_newpad(): fopen");
return -1;
}
if (fread(pad, 1, plen, rnd) != plen) {
perror("scramble_newpad(): fread");
fclose(rnd);
return -1;
}
fclose(rnd);
return 0;
}
int
scramble_newmac(u_char *mac, int mlen)
{
FILE *rnd = fopen(SCRAMBLE_RANDOM_DEV, "r");
if (rnd == NULL) {
perror("scramble_newkey(): fopen");
return -1;
}
if (fread(mac, 1, mlen, rnd) != mlen) {
perror("scramble_newkey(): fread");
fclose(rnd);
return -1;
}
fclose(rnd);
return 0;
}
int
scramble_newiv(u_char *iv, int ivlen)
{
FILE *rnd = fopen(SCRAMBLE_RANDOM_DEV, "r");
if (rnd == NULL) {
perror("scramble_newiv(): fopen");
return -1;
}
if (fread(iv, 1, ivlen, rnd) != ivlen) {
perror("scramble_newiv(): fread");
fclose(rnd);
return -1;
}
fclose(rnd);
return 0;
}
/* read a hex string from fd at current position and store it in s */
static int
readhexstring(FILE *f, u_char *s, int *len)
{
char c = 0;
int i;
for (i = 0; i < *len + 1; ++i) {
switch (fread(&c, 1, 1, f)) {
case 0:
*len = i;
return 0;
case 1:
break;
default:
return -1;
}
if (!isxdigit(c)) {
*len = i;
return 0;
}
s[i] = ((isdigit(c)) ? c - '0' : tolower(c) - 'a' + 10) << 4;
if (fread(&c, 1, 1, f) != 1) {
*len = i;
return -1; /* error: a byte has 2 digits */
}
if (!isxdigit(c)) {
*len = i;
return -1;
}
s[i] |= (isdigit(c)) ? c - '0' : tolower(c) - 'a' + 10;
}
if (i == *len + 1)
return -1; /* means buffer is too short */
return 0;
}
int
scramble_readstate(const char *fn, scramble_state_t *s)
{
u_char c4, c6;
int l4 = 1, l6 = 1;
FILE *f = fopen(fn, "r");
if (f == NULL) {
perror("scramble_readstate(): fopen");
return -1;
}
if (readhexstring(f, (u_char*)&c4, &l4) != 0) {
fprintf(stderr, "scramble_readstate(): error reading c4");
fclose(f);
return -1;
}
assert(l4 == 1);
s->c4 = (scramble_crypt_t)c4;
if (readhexstring(f, (u_char*)&c6, &l6) != 0) {
fprintf(stderr, "scramble_readstate(): error reading c6");
fclose(f);
return -1;
}
assert(l6 == 1);
s->c6 = (scramble_crypt_t)c6;
if (readhexstring(f, s->key, &s->klen) != 0) {
fprintf(stderr, "scramble_readstate(): error reading key");
fclose(f);
return -1;
}
if (readhexstring(f, s->pad, &s->plen) != 0) {
fprintf(stderr, "scramble_readstate(): error reading pad");
fclose(f);
return -1;
}
if (readhexstring(f, s->mac, &s->mlen) != 0) {
fprintf(stderr, "scramble_readstate(): error reading mac");
fclose(f);
return -1;
}
if (readhexstring(f, s->iv, &s->ivlen) != 0) {
fprintf(stderr, "scramble_readstate(): error reading iv");
fclose(f);
return -1;
}
fclose(f);
return 0;
}
int
scramble_savestate(const char *fn, const scramble_state_t *s)
{
int i;
/* set restrictive mode */
int fd = creat(fn, S_IRUSR|S_IWUSR);
if (fd < 0) {
perror("scramble_savestate(): open");
return -1;
}
FILE *f = fdopen(fd, "w");
if (f == NULL) {
perror("scramble_savestate(): fopen");
return -1;
}
if (fprintf(f, "%02x:%02x:", (unsigned)s->c4, (unsigned)s->c6) < 0) {
perror("scramble_savestate(): error saving cryptos");
fclose(f);
return -1;
}
for (i = 0; i < s->klen; ++i) {
if (fprintf(f, "%02x", s->key[i]) < 0) {
perror("scramble_savestate(): error saving key");
fclose(f);
return -1;
}
}
fprintf(f, ":");
for (i = 0; i < s->plen; ++i) {
if (fprintf(f, "%02x", s->pad[i]) < 0) {
perror("scramble_savestate(): error saving pad");
fclose(f);
return -1;
}
}
fprintf(f, ":");
for (i = 0; i < s->mlen; ++i) {
if (fprintf(f, "%02x", s->mac[i]) < 0) {
perror("scramble_savestate(): error saving mac");
fclose(f);
return -1;
}
}
fprintf(f, ":");
for (i = 0; i < s->ivlen; ++i) {
if (fprintf(f, "%02x", s->iv[i]) < 0) {
perror("scramble_savestate(): error saving lv");
fclose(f);
return -1;
}
}
fprintf(f, "\n");
fclose(f);
return 0;
}
int
scramble_init(const scramble_state_t *s)
{
int plen;
if (s->plen > MAX_BLK_LENGTH)
plen = MAX_BLK_LENGTH;
else
plen = s->plen;
scramble_crypto4 = s->c4;
scramble_crypto6 = s->c6;
memcpy(&b4_in, s->pad, plen);
ip4pad = cryptopant_swap32(b4_in.ip4);
memcpy(&b6_in, s->pad, s->plen);
ip6pad[0] = b6_in.ip6.s6_addr32[0];
ip6pad[1] = b6_in.ip6.s6_addr32[1];
ip6pad[2] = b6_in.ip6.s6_addr32[2];
ip6pad[3] = b6_in.ip6.s6_addr32[3];
if (s->c4 == SCRAMBLE_BLOWFISH || s->c6 == SCRAMBLE_BLOWFISH) {
BF_set_key(&scramble_key.bfkey, s->klen, s->key);
}
if (s->c4 == SCRAMBLE_AES || s->c6 == SCRAMBLE_AES) {
AES_set_encrypt_key(s->key, s->klen*8, &scramble_key.aeskey);
}
scramble_mac = 0;
memcpy(scramble_mac_buf, s->mac, s->mlen);
if (s->mlen > 0) {
scramble_mac = 1;
if (s->mlen < ETHER_ADDR_LEN + ETHER_VLAN_LEN) {
fprintf(stderr,
"scramble_init(): mac string is too short (%d)\n",
s->mlen);
return -1;
}
}
memcpy(scramble_ether_addr, scramble_mac_buf, ETHER_ADDR_LEN);
/* we don't want to map ether unicast to multicast and visa versa */
RESET_ETHER_MCAST(scramble_ether_addr);
memcpy(&scramble_ether_vlan, scramble_mac_buf + ETHER_ADDR_LEN, ETHER_VLAN_LEN);
return 0;
}
/* init everything from file, if it doesn't exist, create it */
int
scramble_init_from_file(const char *fn, scramble_crypt_t c4, scramble_crypt_t c6, int *do_mac)
{
u_char pad[MAX_BLK_LENGTH];
u_char key[MAX_BLK_LENGTH];
u_char mac[MAX_BLK_LENGTH];
u_char iv[MAX_BLK_LENGTH];
scramble_state_t s;
FILE *f;
s.pad = pad;
s.key = key;
s.mac = mac;
s.iv = iv;
if ((f = fopen(fn, "r")) == NULL) {
if (errno != ENOENT) {
perror("scamble_init_file(): fopen");
return -1;
}
if (c4 == SCRAMBLE_NONE || c6 == SCRAMBLE_NONE)
return -1;
/* file doesn't exist, create it */
s.c4 = c4;
s.c6 = c6;
s.plen = MAX_BLK_LENGTH;
s.klen = 16; /* XXX */
s.ivlen = 16;
if (scramble_newpad(pad, s.plen) < 0)
return -1;
if (scramble_newkey(key, s.klen) < 0)
return -1;
if (scramble_newiv(iv, s.ivlen) < 0)
return -1;
if (do_mac && *do_mac) {
s.mlen = ETHER_ADDR_LEN + ETHER_VLAN_LEN;
if (scramble_newmac(mac, s.mlen) < 0)
return -1;
} else
s.mlen = 0;
if (scramble_savestate(fn, &s) < 0)
return -1;
} else {
fclose(f);
s.plen = MAX_BLK_LENGTH;
s.klen = MAX_BLK_LENGTH;
s.mlen = MAX_BLK_LENGTH;
s.ivlen = MAX_BLK_LENGTH;
if (scramble_readstate(fn, &s) < 0)
return -1;
if (do_mac)
*do_mac = (s.mlen > 0);
}
if (scramble_init(&s) < 0)
return -1;
return 0;
}
/* scramble IPv4 addresses, input and output are in network byte order */
uint32_t
scramble_ip4(uint32_t input, int pass_bits) {
uint32_t output = 0;
uint32_t m = 0xffffffff << 1;
int i = 31;
int class_bits = 0;
int pbits = 0;
#define MAX_CLASS_BITS 4
static int _class_bits[1<<MAX_CLASS_BITS] = {
1,1,1,1,1,1,1,1, /* class A: preserve 1 bit */
2,2,2,2, /* class B: preserve 2 bits */
3,3, /* class C: preserve 3 bits */
4, /* class D: preserve 4 bits */
32 /* class bad, preserve all */
};
uint32_t *cp;
input = ntohl(input);
cp = ip4cache + (input >> (32 - CACHE_BITS));
assert(pass_bits >= 0 && pass_bits < 33);
++ipv4_anon_calls;
b4_in.ip4 = input;
class_bits = _class_bits[input >> (32-MAX_CLASS_BITS)];
// check cache first
output = *cp;
if (output != 0) {
output <<= (32 - CACHE_BITS);
if (class_bits < CACHE_BITS)
class_bits = CACHE_BITS;
++ipv4_cache_hits;
}
pbits = MAX(pass_bits, class_bits);
for (i = 31; i > pbits - 1; --i) {
/* pass through 'i' highest bits of ip4 */
b4_in.ip4 &= m;
/* the following could be:
* b4_in.ip4 |= (ip4pad & ~m); */
b4_in.ip4 |= (ip4pad >> i);
b4_in.ip4 = cryptopant_swap32(b4_in.ip4);
switch (scramble_crypto4) {
case SCRAMBLE_MD5:
MD5((u_char*)&b4_in, MD5_DIGEST_LENGTH, (u_char*)&b4_out);
break;
case SCRAMBLE_BLOWFISH:
BF_ecb_encrypt((u_char*)&b4_in, (u_char*)&b4_out, &scramble_key.bfkey, BF_ENCRYPT);
break;
case SCRAMBLE_AES:
AES_ecb_encrypt((u_char*)&b4_in, (u_char*)&b4_out, &scramble_key.aeskey, AES_ENCRYPT);
break;
case SCRAMBLE_SHA1:
SHA1((u_char*)&b4_in, SHA_DIGEST_LENGTH, (u_char*)&b4_out);
break;
default:
abort();
}
output |= (( *((u_char*)&b4_out.ip4) & 1) << (31 - i));
b4_in.ip4 = cryptopant_swap32(b4_in.ip4);
m <<= 1;
}
/* output == 0 is OK, means pass address unchanged */
*cp = (output >> (32 - CACHE_BITS));
return htonl(output ^ input);
}
/* scramble ipv6 address in place, in network byte order */
void
scramble_ip6(struct in6_addr *input, int pass_bits)
{
struct in6_addr output;
int i, w;
int pbits = pass_bits;
++ipv6_anon_calls;
b6_in.ip6.s6_addr32[0] = ip6pad[0]; /* XXX this one not needed */
b6_in.ip6.s6_addr32[1] = ip6pad[1];
b6_in.ip6.s6_addr32[2] = ip6pad[2];
b6_in.ip6.s6_addr32[3] = ip6pad[3];
for (w = 0; w < 4; ++w) {
uint32_t m = 0xffffffff << 1;
uint32_t x = ntohl(input->s6_addr32[w]);
uint32_t hpad = ntohl(ip6pad[w]);
output.s6_addr32[w] = 0;
/* anonymize x, using hpad */
for (i = 31; i > pbits - 1; --i) {
/* pass through 'i' highest bits of the word */
x &= m;
/* the following could be:
* x |= (hpad & ~m); */
x |= (hpad >> i);
b6_in.ip6.s6_addr32[w] = htonl(x);
/* hashing proper */
switch (scramble_crypto6) {
case SCRAMBLE_MD5:
MD5((u_char*)&b6_in, MD5_DIGEST_LENGTH, (u_char*)&b6_out);
break;
case SCRAMBLE_BLOWFISH:
/* use BF in chain mode */
memset(ivec, 0, sizeof(ivec));
BF_cbc_encrypt((u_char*)&b6_in, (u_char*)&b6_out,
sizeof(struct in6_addr),
&scramble_key.bfkey,
ivec, BF_ENCRYPT);
break;
case SCRAMBLE_AES:
AES_ecb_encrypt((u_char*)&b6_in, (u_char*)&b6_out,
&scramble_key.aeskey, AES_ENCRYPT);
break;
case SCRAMBLE_SHA1:
SHA1((u_char*)&b6_in, SHA_DIGEST_LENGTH, (u_char*)&b6_out);
break;
default:
abort();
}
output.s6_addr32[w] |= ((ntohl(b6_out.ip6.s6_addr32[3]) & 1)
<< (31 - i));
m <<= 1;
}
pbits = (pbits >= 32) ? pbits - 32 : 0;
/* pbits >= 32 this means the above for-loop wasn't executed */
output.s6_addr32[w] = htonl(output.s6_addr32[w]) ^ input->s6_addr32[w];
/* restore the word */
b6_in.ip6.s6_addr32[w] = input->s6_addr32[w];
}
*input = output;
}
/* reverse map scrambled IP addresses, all network byte order */
uint32_t
unscramble_ip4(uint32_t input, int pass_bits)
{
int i;
uint32_t guess, res;
guess = input; /* Starting with the input seems
* a good idea because some bits
* may be passed through
* unchanged */
for (i=32; i>0; --i) {
res = scramble_ip4(guess, pass_bits);
/* we're only interested in flipping the
* higher bit, don't care about the rest */
res ^= input;
if (res == 0)
return guess;
guess ^= res;
}
//unreachable, since there should be always a match
//(since we're zeroing out at least one bit per iteration)
assert(0);
return (0xffffffff); /* cannot find the match */
}
/* unscramble ipv6 address in place, in network byte order */
void
unscramble_ip6(struct in6_addr *input, int pass_bits)
{
struct in6_addr guess;
struct in6_addr res;
uint32_t r = 0;
int i;
guess = *input;
for (i = 0; i < 4; ++i) {
for (;;) {
res = guess;
scramble_ip6(&res, pass_bits);
r = res.s6_addr32[i] ^ input->s6_addr32[i];
if (r == 0) break;
guess.s6_addr32[i] ^= r;
}
}
*input = guess;
return;
}
|