forked from openwall/john
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathDES_std.c
1175 lines (1032 loc) · 27.8 KB
/
DES_std.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
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
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* This file is part of John the Ripper password cracker,
* Copyright (c) 1996-2001,2005,2012 by Solar Designer
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted.
*
* There's ABSOLUTELY NO WARRANTY, express or implied.
*/
#include <string.h>
#include "arch.h"
#include "common.h"
#include "DES_std.h"
#include "memdbg.h"
#include "misc.h"
#if ARCH_BITS >= 64
#if !DES_ASM
static union {
double dummy;
struct {
DES_KS KS;
ARCH_WORD SPE_F[8][64];
#if DES_128K
ARCH_WORD SPE_W[4][64 * 64];
#endif
} data;
} CC_CACHE_ALIGN DES_all;
#else
extern ARCH_WORD DES_SPE_F[8][64];
#if DES_128K
extern ARCH_WORD DES_SPE_W[4][64 * 64];
#endif
#endif
static ARCH_WORD DES_SPE[8][64];
#else
#if !DES_ASM
static union {
double dummy;
struct {
DES_KS KS;
ARCH_WORD SPE_L[8][64];
ARCH_WORD cache_bank_shift;
ARCH_WORD SPE_H[8][64];
#if DES_128K
ARCH_WORD restore_double_word_alignment;
ARCH_WORD SPE_W[4][64 * 64][2];
#endif
} data;
} CC_CACHE_ALIGN DES_all;
#else
#if DES_X2
extern ARCH_WORD DES_SPE_F[8][64][2];
#else
extern ARCH_WORD DES_SPE_L[8][64], DES_SPE_H[8][64];
#endif
#if DES_128K
extern ARCH_WORD DES_SPE_W[4][64 * 64][2];
#endif
#endif
static ARCH_WORD DES_SPE[8][64][2];
#endif
#if !DES_ASM
#define DES_KS_copy DES_all.data.KS
#define DES_SPE_F DES_all.data.SPE_F
#define DES_SPE_L DES_all.data.SPE_L
#define DES_SPE_H DES_all.data.SPE_H
#define DES_SPE_W DES_all.data.SPE_W
DES_binary DES_IV;
ARCH_WORD DES_count;
DES_KS CC_CACHE_ALIGN DES_KS_current;
DES_KS CC_CACHE_ALIGN DES_KS_table[8][128];
#endif
static int DES_KS_updates;
static char DES_key[16];
#if DES_COPY
#if DES_ASM
extern DES_KS DES_KS_copy;
#endif
unsigned ARCH_WORD *DES_out;
#endif
extern DES_KS DES_KS_table[8][128];
#if ARCH_BITS >= 64
static ARCH_WORD DES_IP_E[8][16], DES_C_FP[16][16];
#else
static ARCH_WORD DES_IP_E[8][16][2], DES_C_FP[16][16][2];
#endif
/*
* Some architecture-dependent definitions follow. Be sure to use correct
* options while compiling, this might affect the performance a lot.
*/
#if (ARCH_BITS >= 64 && (DES_SCALE || !DES_MASK) || DES_128K) && \
DES_SIZE_FIX == 2
/*
* 64-bit architectures which can shift addresses left by 1 bit with no extra
* time required (for example by adding a register to itself).
*/
#define DES_INDEX(SPE, i) \
(*((ARCH_WORD *)(((unsigned char (*)[2])SPE) + (i))))
#else
#if DES_SIZE_FIX == 0
/*
* 64-bit architectures which can shift addresses left by 3 bits (but maybe
* not by 1) with no extra time required (for example by using the S8ADDQ
* instruction on DEC Alphas; we would need an ADDQ anyway).
*/
#define DES_INDEX(SPE, i) \
SPE[i]
#else
/*
* Architectures with no complicated addressing modes supported, or when those
* are not required.
*/
#define DES_INDEX(SPE, i) \
(*((ARCH_WORD *)(((unsigned char *)SPE) + (i))))
#if ARCH_BITS < 64 && DES_128K
#define DES_INDEX_L(SPE, i) \
(*((ARCH_WORD *)(((unsigned char *)&SPE[0][0]) + (i))))
#define DES_INDEX_H(SPE, i) \
(*((ARCH_WORD *)(((unsigned char *)&SPE[0][1]) + (i))))
#endif
#endif
#endif
/*
* You can choose between using shifts/masks, and using memory store and load
* instructions.
*/
#if DES_MASK
#if ARCH_BITS >= 64 && !DES_SCALE && DES_SIZE_FIX == 2
/*
* This method might be good for some 64-bit architectures with no complicated
* addressing modes supported. It would be the best one for DEC Alphas if they
* didn't have the S8ADDQ instruction.
*/
#define DES_MASK_6 (0x3F << 3)
#else
#if DES_EXTB
/*
* Masking whole bytes allows the compiler to use Move with Zero Extension
* instructions (where supported), like MOVZBL (MOVZX in Intel's syntax) on
* x86s, or EXTBL on DEC Alphas. It might only be reasonable to disable this
* if such instructions exist, but are slower than masks/shifts (as they are
* on Pentiums).
*/
#define DES_MASK_6 ((0x3F << DES_SIZE_FIX) | 0xFF)
#else
/*
* Forces using plain shifts/masks, sometimes it's the only choice. Note that
* you don't have to set DES_MASK if this is the case -- store/load method
* might be faster.
*/
#define DES_MASK_6 (0x3F << DES_SIZE_FIX)
#endif
#endif
#endif
#if !DES_COPY
#undef DES_KS_copy
#define DES_KS_copy KS
#endif
#define DES_KS_INDEX(i) (DES_KS_copy + (i * (16 / DES_SIZE)))
#define DES_24_TO_32(x) \
(((x) & 077) | \
(((x) & 07700) << 2) | \
(((x) & 0770000) << 4) | \
(((x) & 077000000) << 6))
#define DES_16_TO_32(x) \
((((x) & 0xF) << 1) | \
(((x) & 0xF0) << 5) | \
(((x) & 0xF00) << 9) | \
(((x) & 0xF000) << 13))
#if DES_128K
#define DES_UNDO_SIZE_FIX(x) \
((((x) >> 1) & 0xFF00FF00) | (((x) & 0x00FF00FF) >> 3))
#else
#define DES_UNDO_SIZE_FIX(x) \
((x) >> DES_SIZE_FIX)
#endif
static unsigned char DES_S[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}
}
};
static unsigned char DES_P[32] = {
15, 6, 19, 20,
28, 11, 27, 16,
0, 14, 22, 25,
4, 17, 30, 9,
1, 7, 23, 13,
31, 26, 2, 8,
18, 12, 29, 5,
21, 10, 3, 24
};
unsigned char DES_E[48] = {
31, 0, 1, 2, 3, 4,
3, 4, 5, 6, 7, 8,
7, 8, 9, 10, 11, 12,
11, 12, 13, 14, 15, 16,
15, 16, 17, 18, 19, 20,
19, 20, 21, 22, 23, 24,
23, 24, 25, 26, 27, 28,
27, 28, 29, 30, 31, 0
};
unsigned char DES_IP[64] = {
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,
56, 48, 40, 32, 24, 16, 8, 0,
58, 50, 42, 34, 26, 18, 10, 2,
60, 52, 44, 36, 28, 20, 12, 4,
62, 54, 46, 38, 30, 22, 14, 6
};
static unsigned char DES_C[64] = {
0, 1, 2, 3, 16, 17, 18, 19,
4, 5, 6, 7, 20, 21, 22, 23,
8, 9, 10, 11, 24, 25, 26, 27,
12, 13, 14, 15, 28, 29, 30, 31,
32, 33, 34, 35, 48, 49, 50, 51,
36, 37, 38, 39, 52, 53, 54, 55,
40, 41, 42, 43, 56, 57, 58, 59,
44, 45, 46, 47, 60, 61, 62, 63
};
unsigned char DES_PC1[56] = {
56, 48, 40, 32, 24, 16, 8,
0, 57, 49, 41, 33, 25, 17,
9, 1, 58, 50, 42, 34, 26,
18, 10, 2, 59, 51, 43, 35,
62, 54, 46, 38, 30, 22, 14,
6, 61, 53, 45, 37, 29, 21,
13, 5, 60, 52, 44, 36, 28,
20, 12, 4, 27, 19, 11, 3
};
unsigned char DES_ROT[16] = {
1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
};
unsigned char DES_PC2[48] = {
13, 16, 10, 23, 0, 4,
2, 27, 14, 5, 20, 9,
22, 18, 11, 3, 25, 7,
15, 6, 26, 19, 12, 1,
40, 51, 30, 36, 46, 54,
29, 39, 50, 44, 32, 47,
43, 48, 38, 55, 33, 52,
45, 41, 49, 35, 28, 31
};
static void init_SPE(void)
{
int box, index, row, column, bit;
unsigned int mask, l, h;
for (box = 0; box < 8; box++)
for (index = 0; index < 64; index++) {
row =
((index & 1) << 1) |
(index >> 5);
column =
(((index >> 1) & 1) << 3) |
(((index >> 2) & 1) << 2) |
(((index >> 3) & 1) << 1) |
((index >> 4) & 1);
mask = (ARCH_WORD)DES_S[box][row][column] << ((7 - box) << 2);
h = l = 0;
for (bit = 0; bit < 24; bit++) {
if (((unsigned int)0x80000000 >>
DES_P[ARCH_INDEX(DES_E[bit])]) & mask)
l |= 1 << bit;
if (((unsigned int)0x80000000 >>
DES_P[ARCH_INDEX(DES_E[bit + 24])]) & mask)
h |= 1 << bit;
}
l = DES_24_TO_32(l); h = DES_24_TO_32(h);
#if ARCH_BITS >= 64
DES_SPE[box][index] =
DES_DO_SIZE_FIX(l) |
((unsigned ARCH_WORD)DES_DO_SIZE_FIX(h) << 32);
#else
DES_SPE[box][index][0] = DES_DO_SIZE_FIX(l);
DES_SPE[box][index][1] = DES_DO_SIZE_FIX(h);
#endif
}
}
static void init_IP_E(void)
{
int src, dst, dst1, dst2;
int chunk, mask, value;
memset(DES_IP_E, 0, sizeof(DES_IP_E));
for (dst1 = 0; dst1 < 8; dst1++)
for (dst2 = 0; dst2 < 6; dst2++) {
dst = (dst1 << 3) + dst2;
src = DES_IP[ARCH_INDEX(DES_E[dst1 * 6 + dst2])];
if (src >= 32) src -= 32; else src--;
src ^= 7;
chunk = src >> 2;
mask = 1 << (src & 3);
for (value = 0; value < 16; value++)
if (value & mask)
#if ARCH_BITS >= 64
DES_IP_E[chunk][value] |=
(unsigned ARCH_WORD)1 << dst;
#else
DES_IP_E[chunk][value][dst >> 5] |=
(unsigned ARCH_WORD)1 << (dst & 0x1F);
#endif
}
}
static void init_C_FP(void)
{
int src, dst;
int chunk, mask, value;
memset(DES_C_FP, 0, sizeof(DES_C_FP));
for (src = 0; src < 64; src++) {
dst = DES_IP[ARCH_INDEX(DES_C[src])] ^ 7;
chunk = src >> 2;
mask = 1 << (src & 3);
for (value = 0; value < 16; value++)
if (value & mask)
#if ARCH_BITS >= 64
DES_C_FP[chunk][value] |=
(unsigned ARCH_WORD)1 << dst;
#else
DES_C_FP[chunk][value][dst >> 5] |=
(unsigned ARCH_WORD)1 << (dst & 0x1F);
#endif
}
}
static void init_KS(void)
{
int pos, chr, round, bit, ofs;
unsigned char block[64];
ARCH_WORD value[2];
int k, p, q, r, s;
memset(block, 0, sizeof(block));
for (pos = 0; pos < 8; pos++)
for (chr = 0x7F; chr >= 0; chr--) {
for (bit = 0; bit < 7; bit++)
block[(pos << 3) + bit] = (chr >> (6 - bit)) & 1;
s = 0;
for (round = 0; round < 16; round++) {
s += DES_ROT[round];
value[0] = value[1] = 0;
k = 0;
for (ofs = 0; ofs < 64; ofs += 8)
for (bit = 0; bit < 6; bit++) {
p = DES_PC2[k++];
q = p < 28 ? 0 : 28;
p += s;
while (p >= 28) p -= 28;
r = DES_PC1[p + q];
value[ofs >> 5] |= (ARCH_WORD)block[r] <<
((ofs & 31) + bit);
}
#if ARCH_BITS >= 64
DES_KS_table[pos][chr][round] =
DES_DO_SIZE_FIX(value[0]) |
(DES_DO_SIZE_FIX(value[1]) << 32);
#else
DES_KS_table[pos][chr][round << 1] =
DES_DO_SIZE_FIX(value[0]);
DES_KS_table[pos][chr][(round << 1) + 1] =
DES_DO_SIZE_FIX(value[1]);
#endif
}
}
DES_KS_updates = 0;
memset(DES_key, 0, sizeof(DES_key));
memcpy(DES_KS_current, DES_KS_table, sizeof(DES_KS));
}
void DES_std_init(void)
{
init_SPE();
init_IP_E();
init_C_FP();
init_KS();
memset(DES_IV, 0, sizeof(DES_IV));
DES_count = 25;
}
void DES_std_set_salt(ARCH_WORD salt)
{
int box, index;
ARCH_WORD xor;
#if ARCH_BITS >= 64
unsigned ARCH_WORD src;
#else
ARCH_WORD l, h;
#endif
for (box = 0; box < 8; box++)
for (index = 0; index < 64; index++) {
#if ARCH_BITS >= 64
src = DES_SPE[box][index];
xor = (src ^ (src >> 32)) & salt;
DES_SPE_F[box][index] = src ^ (xor | (xor << 32));
#else
l = DES_SPE[box][index][0];
h = DES_SPE[box][index][1];
xor = (l ^ h) & salt;
#if DES_X2
DES_SPE_F[box][index][0] = l ^ xor;
DES_SPE_F[box][index][1] = h ^ xor;
#else
DES_SPE_L[box][index] = l ^ xor;
DES_SPE_H[box][index] = h ^ xor;
#endif
#endif
}
#if DES_128K
for (box = 0; box < 4; box++)
for (index = 0; index < 64 * 64; index++) {
#if ARCH_BITS >= 64
DES_SPE_W[box][index] =
DES_SPE_F[box << 1][index & 0x3F] ^
DES_SPE_F[(box << 1) + 1][index >> 6];
#else
DES_SPE_W[box][index][0] =
DES_SPE_L[box << 1][index & 0x3F] ^
DES_SPE_L[(box << 1) + 1][index >> 6];
DES_SPE_W[box][index][1] =
DES_SPE_H[box << 1][index & 0x3F] ^
DES_SPE_H[(box << 1) + 1][index >> 6];
#endif
}
#endif
}
/*
* The new DES_std_set_key() idea is originally by Roman Rusakov. I extended
* the original idea to detect whether it's faster to calculate from scratch
* or modify the previous key schedule. This code assumes that DES_xor_key1()
* is 1.5 times faster than DES_xor_key2().
*/
#if !DES_ASM
#define DES_xor1_1(ofs) \
DES_KS_current[ofs] ^= value1[ofs];
#define DES_xor1_4(ofs) \
DES_xor1_1(ofs); \
DES_xor1_1(ofs + 1); \
DES_xor1_1(ofs + 2); \
DES_xor1_1(ofs + 3);
#define DES_xor1_16(ofs) \
DES_xor1_4(ofs); \
DES_xor1_4(ofs + 4); \
DES_xor1_4(ofs + 8); \
DES_xor1_4(ofs + 12);
#if ARCH_BITS >= 64
#define DES_xor_key1(_value) { \
value1 = _value; \
DES_xor1_16(0); \
}
#else
#define DES_xor_key1(_value) { \
value1 = _value; \
DES_xor1_16(0); \
DES_xor1_16(16); \
}
#endif
#define DES_xor2_1(ofs) \
DES_KS_current[ofs] ^= value1[ofs] ^ value2[ofs];
#define DES_xor2_4(ofs) \
DES_xor2_1(ofs); \
DES_xor2_1(ofs + 1); \
DES_xor2_1(ofs + 2); \
DES_xor2_1(ofs + 3);
#define DES_xor2_16(ofs) \
DES_xor2_4(ofs); \
DES_xor2_4(ofs + 4); \
DES_xor2_4(ofs + 8); \
DES_xor2_4(ofs + 12);
#if ARCH_BITS >= 64
#define DES_xor_key2(_value1, _value2) { \
value1 = _value1; value2 = _value2; \
DES_xor2_16(0); \
}
#else
#define DES_xor_key2(_value1, _value2) { \
value1 = _value1; value2 = _value2; \
DES_xor2_16(0); \
DES_xor2_16(16); \
}
#endif
#else
extern void DES_xor_key1(ARCH_WORD *value);
extern void DES_xor_key2(ARCH_WORD *value1, ARCH_WORD *value2);
#endif
void DES_raw_set_key(char *key)
{
int i;
DES_KS *pos;
#if !DES_ASM
ARCH_WORD *value1;
#endif
memcpy(DES_KS_current,
DES_KS_table[0][ARCH_INDEX(DES_key[0] = key[0] & 0x7F)],
sizeof(DES_KS));
pos = (DES_KS *)DES_KS_table[1][0];
for (i = 1; i < 8; i++) {
DES_xor_key1(pos[ARCH_INDEX(DES_key[i] = key[i] & 0x7F)]);
pos += 128;
}
}
void DES_std_set_key(char *key)
{
unsigned i, j;
int k, l;
#if !DES_ASM
ARCH_WORD *value1, *value2;
#endif
j = key[0];
for (k = i = 0; (l = DES_key[i]) && (j = key[i]); i++)
if (j != l) k += 3;
if (j) {
while (i < 8 && key[i]) {
i++; k += 2;
}
j = i;
} else {
j = i;
while (DES_key[i++]) k += 2;
}
if ((k < (j << 1)) && (++DES_KS_updates & 0xFFF)) {
j = 0; l = 1;
for (i = 0; i < 8 && (k = key[i]); i++) {
if (l)
if (k == (l = DES_key[j++])) continue;
if (l) {
DES_xor_key2(DES_KS_table[i][l],
DES_KS_table[i][k & 0x7F]);
} else
DES_xor_key1(DES_KS_table[i][k & 0x7F]);
}
if (l)
for (; j < 8 && (l = DES_key[j]); j++)
DES_xor_key1(DES_KS_table[j][l]);
} else {
memcpy(DES_KS_current, DES_KS_table[0][(k = key[0]) & 0x7F],
sizeof(DES_KS));
if (k)
for (i = 1; i < 8 && (k = key[i]); i++)
DES_xor_key1(DES_KS_table[i][k & 0x7F]);
}
DES_key[0] = key[0] & 0x7F;
DES_key[1] = key[1] & 0x7F;
DES_key[2] = key[2] & 0x7F;
DES_key[3] = key[3] & 0x7F;
DES_key[4] = key[4] & 0x7F;
DES_key[5] = key[5] & 0x7F;
DES_key[6] = key[6] & 0x7F;
DES_key[7] = key[7] & 0x7F;
}
void DES_std_set_block(ARCH_WORD R, ARCH_WORD L)
{
ARCH_WORD Rl, Rh, Ll, Lh;
unsigned ARCH_WORD C;
#if ARCH_BITS >= 64
ARCH_WORD mask;
#else
ARCH_WORD *mask;
#endif
int chunk;
C = (R & 0xAAAAAAAA) | ((L & 0xAAAAAAAA) >> 1);
Rh = Rl = 0;
for (chunk = 0; chunk < 8; chunk++) {
mask = DES_IP_E[chunk][C & 0xF];
#if ARCH_BITS >= 64
Rl |= mask & 0xFFFFFFFF;
Rh |= mask >> 32;
#else
Rl |= mask[0];
Rh |= mask[1];
#endif
C >>= 4;
}
C = ((R & 0x55555555) << 1) | (L & 0x55555555);
Lh = Ll = 0;
for (chunk = 0; chunk < 8; chunk++) {
mask = DES_IP_E[chunk][C & 0xF];
#if ARCH_BITS >= 64
Ll |= mask & 0xFFFFFFFF;
Lh |= mask >> 32;
#else
Ll |= mask[0];
Lh |= mask[1];
#endif
C >>= 4;
}
Rl = DES_DO_SIZE_FIX(Rl);
Rh = DES_DO_SIZE_FIX(Rh);
Ll = DES_DO_SIZE_FIX(Ll);
Lh = DES_DO_SIZE_FIX(Lh);
#if ARCH_BITS >= 64
DES_IV[0] = Rl | (Rh << 32);
DES_IV[1] = Ll | (Lh << 32);
#else
DES_IV[0] = Rl;
DES_IV[1] = Rh;
DES_IV[2] = Ll;
DES_IV[3] = Lh;
#endif
}
void DES_std_get_block(DES_binary binary, unsigned ARCH_WORD out[2])
{
ARCH_WORD Rl, Rh, Ll, Lh;
ARCH_WORD R, L;
unsigned ARCH_WORD C;
#if ARCH_BITS >= 64
unsigned ARCH_WORD mask;
#else
ARCH_WORD *mask;
#endif
int chunk;
#if ARCH_BITS >= 64
Rl = binary[0];
Rh = binary[0] >> 32;
Ll = binary[1];
Lh = binary[1] >> 32;
#else
Rl = binary[0];
Rh = binary[1];
Ll = binary[2];
Lh = binary[3];
#endif
Rl = DES_UNDO_SIZE_FIX(Rl);
Rh = DES_UNDO_SIZE_FIX(Rh);
Ll = DES_UNDO_SIZE_FIX(Ll);
Lh = DES_UNDO_SIZE_FIX(Lh);
R = L = 0;
C = ((Ll >> 1) & 0x0F0F0F0F) | ((Lh << 3) & 0xF0F0F0F0);
for (chunk = 0; chunk < 16; chunk++) {
if (chunk == 8)
C = ((Rl >> 1) & 0x0F0F0F0F) | ((Rh << 3) & 0xF0F0F0F0);
mask = DES_C_FP[chunk][C & 0xF];
#if ARCH_BITS >= 64
R |= mask & 0xFFFFFFFF;
L |= mask >> 32;
#else
R |= mask[0];
L |= mask[1];
#endif
C >>= 4;
}
out[0] = R;
out[1] = L;
}
#if !DES_ASM
#if !DES_MASK
#define DES_D (DES_tmp.w)
#if ARCH_LITTLE_ENDIAN
#define DES_Dl (DES_tmp.w[0])
#define DES_Dh (DES_tmp.w[1])
#define DES_B0 (DES_tmp.b[0])
#define DES_B1 (DES_tmp.b[1])
#define DES_B2 (DES_tmp.b[2])
#define DES_B3 (DES_tmp.b[3])
#define DES_B4 (DES_tmp.b[4])
#define DES_B5 (DES_tmp.b[5])
#define DES_B6 (DES_tmp.b[6])
#define DES_B7 (DES_tmp.b[7])
#else
#define DES_Dl (DES_tmp.w[1])
#define DES_Dh (DES_tmp.w[0])
#if ARCH_BITS > 64
#define DES_START ARCH_SIZE
#else
#define DES_START 8
#endif
#define DES_B0 (DES_tmp.b[DES_START - 1])
#define DES_B1 (DES_tmp.b[DES_START - 2])
#define DES_B2 (DES_tmp.b[DES_START - 3])
#define DES_B3 (DES_tmp.b[DES_START - 4])
#define DES_B4 (DES_tmp.b[DES_START - 5])
#define DES_B5 (DES_tmp.b[DES_START - 6])
#define DES_B6 (DES_tmp.b[DES_START - 7])
#define DES_B7 (DES_tmp.b[DES_START - 8])
#endif
#endif
/*
* The code below is heavily optimized, looking at the assembly output for
* several architectures, enjoy the speed.
*/
#if ARCH_BITS >= 64
#if !DES_128K
/*
* An extra temporary register is used for better instruction scheduling.
*/
#if DES_MASK
#if DES_SCALE
/* 64-bit, 4K, mask, scale */
#define DES_ROUND(L, H, B) \
T = DES_INDEX(DES_SPE_F[0], DES_D & DES_MASK_6); \
B ^= DES_INDEX(DES_SPE_F[1], (DES_D >> 8) & DES_MASK_6); \
T ^= DES_INDEX(DES_SPE_F[2], (DES_D >> 16) & DES_MASK_6); \
B ^= DES_INDEX(DES_SPE_F[3], (DES_D >> 24) & DES_MASK_6); \
T ^= DES_INDEX(DES_SPE_F[4], (DES_D >> 32) & DES_MASK_6); \
B ^= DES_INDEX(DES_SPE_F[5], (DES_D >> 40) & DES_MASK_6); \
T ^= DES_INDEX(DES_SPE_F[6], (DES_D >> 48) & DES_MASK_6); \
B ^= T ^ DES_INDEX(DES_SPE_F[7], DES_D >> 56);
#else
/*
* This code assumes that the indices are already shifted left by 2, and still
* should be shifted left by 1 more bit. Weird shift counts allow doing this
* with only one extra shift, in the first line. By shifting the mask right
* (which is done at compile time), I moved the extra shift out of the mask,
* which allows doing this with special addressing modes, where possible.
*/
/* 64-bit, 4K, mask, no scale */
#define DES_ROUND(L, H, B) \
T = DES_INDEX(DES_SPE_F[0], (DES_D & (DES_MASK_6 >> 1)) << 1); \
B ^= DES_INDEX(DES_SPE_F[1], (DES_D >> 7) & DES_MASK_6); \
T ^= DES_INDEX(DES_SPE_F[2], (DES_D >> 15) & DES_MASK_6); \
B ^= DES_INDEX(DES_SPE_F[3], (DES_D >> 23) & DES_MASK_6); \
T ^= DES_INDEX(DES_SPE_F[4], (DES_D >> 31) & DES_MASK_6); \
B ^= DES_INDEX(DES_SPE_F[5], (DES_D >> 39) & DES_MASK_6); \
T ^= DES_INDEX(DES_SPE_F[6], (DES_D >> 47) & DES_MASK_6); \
B ^= T ^ DES_INDEX(DES_SPE_F[7], (DES_D >> 55) & DES_MASK_6);
#endif
#else
/* 64-bit, 4K, store/load, scale */
#define DES_ROUND(L, H, B) \
T = DES_INDEX(DES_SPE_F[0], DES_B0); \
B ^= DES_INDEX(DES_SPE_F[1], DES_B1); \
T ^= DES_INDEX(DES_SPE_F[2], DES_B2); \
B ^= DES_INDEX(DES_SPE_F[3], DES_B3); \
T ^= DES_INDEX(DES_SPE_F[4], DES_B4); \
B ^= DES_INDEX(DES_SPE_F[5], DES_B5); \
T ^= DES_INDEX(DES_SPE_F[6], DES_B6); \
B ^= T ^ DES_INDEX(DES_SPE_F[7], DES_B7);
#endif
#else
/* 64-bit, 128K, mask, no scale */
#define DES_ROUND(L, H, B) \
B ^= DES_INDEX(DES_SPE_W[0], DES_D & 0xFFFF); \
B ^= DES_INDEX(DES_SPE_W[1], (DES_D >>= 16) & 0xFFFF); \
B ^= DES_INDEX(DES_SPE_W[2], (DES_D >>= 16) & 0xFFFF); \
B ^= DES_INDEX(DES_SPE_W[3], DES_D >> 16);
#endif
#else
#if !DES_128K
#if DES_MASK
/* 32-bit, 4K, mask */
#define DES_ROUND(L, H, B) \
L ^= DES_INDEX(DES_SPE_L[0], DES_Dl & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[0], DES_Dl & DES_MASK_6); \
L ^= DES_INDEX(DES_SPE_L[1], (DES_Dl >>= 8) & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[1], DES_Dl & DES_MASK_6); \
L ^= DES_INDEX(DES_SPE_L[2], (DES_Dl >>= 8) & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[2], DES_Dl & DES_MASK_6); \
L ^= DES_INDEX(DES_SPE_L[3], (DES_Dl >>= 8) & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[3], DES_Dl & DES_MASK_6); \
L ^= DES_INDEX(DES_SPE_L[4], DES_Dh & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[4], DES_Dh & DES_MASK_6); \
L ^= DES_INDEX(DES_SPE_L[5], (DES_Dh >>= 8) & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[5], DES_Dh & DES_MASK_6); \
L ^= DES_INDEX(DES_SPE_L[6], (DES_Dh >>= 8) & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[6], DES_Dh & DES_MASK_6); \
L ^= DES_INDEX(DES_SPE_L[7], (DES_Dh >>= 8) & DES_MASK_6); \
H ^= DES_INDEX(DES_SPE_H[7], DES_Dh & DES_MASK_6);
#else
/* 32-bit, 4K, store/load */
#define DES_ROUND(L, H, B) \
L ^= DES_INDEX(DES_SPE_L[0], DES_B0); \
H ^= DES_INDEX(DES_SPE_H[0], DES_B0); \
L ^= DES_INDEX(DES_SPE_L[1], DES_B1); \
H ^= DES_INDEX(DES_SPE_H[1], DES_B1); \
L ^= DES_INDEX(DES_SPE_L[2], DES_B2); \
H ^= DES_INDEX(DES_SPE_H[2], DES_B2); \
L ^= DES_INDEX(DES_SPE_L[3], DES_B3); \
H ^= DES_INDEX(DES_SPE_H[3], DES_B3); \
L ^= DES_INDEX(DES_SPE_L[4], DES_B4); \
H ^= DES_INDEX(DES_SPE_H[4], DES_B4); \
L ^= DES_INDEX(DES_SPE_L[5], DES_B5); \
H ^= DES_INDEX(DES_SPE_H[5], DES_B5); \
L ^= DES_INDEX(DES_SPE_L[6], DES_B6); \
H ^= DES_INDEX(DES_SPE_H[6], DES_B6); \
L ^= DES_INDEX(DES_SPE_L[7], DES_B7); \
H ^= DES_INDEX(DES_SPE_H[7], DES_B7);
#endif
#else
/* 32-bit, 128K, mask */
#define DES_ROUND(L, H, B) \
L ^= DES_INDEX_L(DES_SPE_W[0], DES_Dl & 0xFFFF); \
H ^= DES_INDEX_H(DES_SPE_W[0], DES_Dl & 0xFFFF); \
L ^= DES_INDEX_L(DES_SPE_W[1], DES_Dl >>= 16); \
H ^= DES_INDEX_H(DES_SPE_W[1], DES_Dl); \
L ^= DES_INDEX_L(DES_SPE_W[2], DES_Dh & 0xFFFF); \
H ^= DES_INDEX_H(DES_SPE_W[2], DES_Dh & 0xFFFF); \
L ^= DES_INDEX_L(DES_SPE_W[3], DES_Dh >>= 16); \
H ^= DES_INDEX_H(DES_SPE_W[3], DES_Dh);
#endif
#endif
#if ARCH_BITS >= 64
#define DES_2_ROUNDS(KS) \
DES_D = R ^ KS[0]; \
DES_ROUND(Ll, Lh, L); \
DES_D = L ^ KS[1]; \
DES_ROUND(Rl, Rh, R);
#else
#define DES_2_ROUNDS(KS) \
DES_Dl = Rl ^ KS[0]; \
DES_Dh = Rh ^ KS[1]; \
DES_ROUND(Ll, Lh, L); \
DES_Dl = Ll ^ KS[2]; \
DES_Dh = Lh ^ KS[3]; \
DES_ROUND(Rl, Rh, R);
#endif
#if DES_COPY
static void crypt_body(void)
#else
void DES_std_crypt(DES_KS KS, DES_binary DES_out)
#endif
{
#if DES_MASK
#if ARCH_BITS >= 64
unsigned ARCH_WORD DES_D;
#else
unsigned ARCH_WORD DES_Dl, DES_Dh;
#endif
#else
union {
#if ARCH_BITS >= 64
ARCH_WORD w;
#else
ARCH_WORD w[2];
#endif
unsigned char b[8];
} DES_tmp;
#endif
#if ARCH_BITS >= 64
ARCH_WORD R, L;
#if !DES_128K
ARCH_WORD T;
#endif
#else
ARCH_WORD Rl, Rh, Ll, Lh;
#endif
int count;
#if ARCH_BITS >= 64
R = DES_IV[0];
L = DES_IV[1];
#else
Rl = DES_IV[0];
Rh = DES_IV[1];
Ll = DES_IV[2];
Lh = DES_IV[3];
#endif
count = DES_count;
do {
DES_2_ROUNDS(DES_KS_INDEX(0));
DES_2_ROUNDS(DES_KS_INDEX(1));
DES_2_ROUNDS(DES_KS_INDEX(2));
DES_2_ROUNDS(DES_KS_INDEX(3));
DES_2_ROUNDS(DES_KS_INDEX(4));
DES_2_ROUNDS(DES_KS_INDEX(5));
DES_2_ROUNDS(DES_KS_INDEX(6));
DES_2_ROUNDS(DES_KS_INDEX(7));
#if ARCH_BITS >= 64