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
1001
1002
1003
1004
1005
1006
1007
1008
1009
1010
1011
1012
1013
1014
1015
1016
1017
1018
|
/*-
* Copyright (c) 1991, 1993
* The Regents of the University of California. All rights reserved.
*
* This code is derived from software contributed to Berkeley by
* Matt Bishop of Dartmouth College.
*
* The United States Government has rights in this work pursuant
* to contract no. NAG 2-680 between the National Aeronautics and
* Space Administration and Dartmouth College.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by the University of
* California, Berkeley and its contributors.
* 4. Neither the name of the University nor the names of its contributors
* may be used to endorse or promote products derived from this software
* without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#ifndef lint
static const char copyright[] =
"@(#) Copyright (c) 1991, 1993\n\
The Regents of the University of California. All rights reserved.\n";
#endif /* not lint */
#ifndef lint
#if 0
static char sccsid[] = "@(#)bdes.c 8.1 (Berkeley) 6/6/93";
#endif
#endif /* not lint */
/*
* BDES -- DES encryption package for Berkeley Software Distribution 4.4
* options:
* -a key is in ASCII
* -b use ECB (electronic code book) mode
* -d invert (decrypt) input
* -f b use b-bit CFB (cipher feedback) mode
* -F b use b-bit CFB (cipher feedback) alternative mode
* -k key use key as the cryptographic key
* -m b generate a MAC of length b
* -o b use b-bit OFB (output feedback) mode
* -p don't reset the parity bit
* -v v use v as the initialization vector (ignored for ECB)
* note: the last character of the last block is the integer indicating
* how many characters of that block are to be output
*
* Author: Matt Bishop
* Department of Mathematics and Computer Science
* Dartmouth College
* Hanover, NH 03755
* Email: Matt.Bishop@dartmouth.edu
* ...!decvax!dartvax!Matt.Bishop
*
* See Technical Report PCS-TR91-158, Department of Mathematics and Computer
* Science, Dartmouth College, for a detailed description of the implemen-
* tation and differences between it and Sun's. The DES is described in
* FIPS PUB 46, and the modes in FIPS PUB 81 (see either the manual page
* or the technical report for a complete reference).
*/
#include <sys/cdefs.h>
__FBSDID("$FreeBSD$");
#include <sys/types.h>
#include <ctype.h>
#include <err.h>
#include <errno.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <openssl/des.h>
/*
* BSD and System V systems offer special library calls that do
* block moves and fills, so if possible we take advantage of them
*/
#define MEMCPY(dest,src,len) bcopy((src),(dest),(len))
#define MEMZERO(dest,len) bzero((dest),(len))
#define DES_XFORM(buf) \
DES_ecb_encrypt(buf, buf, &schedule, \
mode == MODE_ENCRYPT ? DES_ENCRYPT : DES_DECRYPT);
/*
* this does an error-checking write
*/
#define READ(buf, n) fread(buf, sizeof(char), n, stdin)
#define WRITE(buf,n) \
if (fwrite(buf, sizeof(char), n, stdout) != n) \
warnx("fwrite error at %d", n);
/*
* global variables and related macros
*/
#define KEY_DEFAULT 0 /* interpret radix of key from key */
#define KEY_ASCII 1 /* key is in ASCII characters */
int keybase = KEY_DEFAULT; /* how to interpret the key */
enum { /* encrypt, decrypt, authenticate */
MODE_ENCRYPT, MODE_DECRYPT, MODE_AUTHENTICATE
} mode = MODE_ENCRYPT;
enum { /* ecb, cbc, cfb, cfba, ofb? */
ALG_ECB, ALG_CBC, ALG_CFB, ALG_OFB, ALG_CFBA
} alg = ALG_CBC;
DES_cblock ivec; /* initialization vector */
char bits[] = { /* used to extract bits from a char */
'\200', '\100', '\040', '\020', '\010', '\004', '\002', '\001'
};
int inverse; /* 0 to encrypt, 1 to decrypt */
int macbits = -1; /* number of bits in authentication */
int fbbits = -1; /* number of feedback bits */
int pflag; /* 1 to preserve parity bits */
DES_key_schedule schedule; /* expanded DES key */
static void ecbenc(void);
static void ecbdec(void);
static void cbcenc(void);
static void cbcdec(void);
static void cfbenc(void);
static void cfbdec(void);
static void cfbaenc(void);
static void cfbadec(void);
static void ofbenc(void);
static void ofbdec(void);
static void cbcauth(void);
static void cfbauth(void);
static void cvtkey(DES_cblock, char *);
static int setbits(char *, int);
static void makekey(DES_cblock *);
static int tobinhex(char, int);
static void usage(void);
int
main(int ac, char *av[])
{
extern char *optarg; /* argument to option if any */
int i; /* counter in a for loop */
char *p; /* used to obtain the key */
DES_cblock msgbuf; /* I/O buffer */
int kflag; /* command-line encryptiooon key */
int argc; /* the real arg count */
char **argv; /* the real argument vector */
/*
* Hide the arguments from ps(1) by making private copies of them
* and clobbering the global (visible to ps(1)) ones.
*/
argc = ac;
ac = 1;
argv = malloc((argc + 1) * sizeof(char *));
for (i = 0; i < argc; ++i) {
argv[i] = strdup(av[i]);
MEMZERO(av[i], strlen(av[i]));
}
argv[argc] = NULL;
/* initialize the initialization vctor */
MEMZERO(ivec, 8);
/* process the argument list */
kflag = 0;
while ((i = getopt(argc, argv, "abdF:f:k:m:o:pv:")) != EOF)
switch(i) {
case 'a': /* key is ASCII */
keybase = KEY_ASCII;
break;
case 'b': /* use ECB mode */
alg = ALG_ECB;
break;
case 'd': /* decrypt */
mode = MODE_DECRYPT;
break;
case 'F': /* use alternative CFB mode */
alg = ALG_CFBA;
if ((fbbits = setbits(optarg, 7)) > 56 || fbbits == 0)
errx(1, "-F: number must be 1-56 inclusive");
else if (fbbits == -1)
errx(1, "-F: number must be a multiple of 7");
break;
case 'f': /* use CFB mode */
alg = ALG_CFB;
if ((fbbits = setbits(optarg, 8)) > 64 || fbbits == 0)
errx(1, "-f: number must be 1-64 inclusive");
else if (fbbits == -1)
errx(1, "-f: number must be a multiple of 8");
break;
case 'k': /* encryption key */
kflag = 1;
cvtkey(msgbuf, optarg);
break;
case 'm': /* number of bits for MACing */
mode = MODE_AUTHENTICATE;
if ((macbits = setbits(optarg, 1)) > 64)
errx(1, "-m: number must be 0-64 inclusive");
break;
case 'o': /* use OFB mode */
alg = ALG_OFB;
if ((fbbits = setbits(optarg, 8)) > 64 || fbbits == 0)
errx(1, "-o: number must be 1-64 inclusive");
else if (fbbits == -1)
errx(1, "-o: number must be a multiple of 8");
break;
case 'p': /* preserve parity bits */
pflag = 1;
break;
case 'v': /* set initialization vector */
cvtkey(ivec, optarg);
break;
default: /* error */
usage();
}
if (!kflag) {
/*
* if the key's not ASCII, assume it is
*/
keybase = KEY_ASCII;
/*
* get the key
*/
p = getpass("Enter key: ");
/*
* copy it, nul-padded, into the key area
*/
cvtkey(msgbuf, p);
}
makekey(&msgbuf);
inverse = (alg == ALG_CBC || alg == ALG_ECB) && mode == MODE_DECRYPT;
switch(alg) {
case ALG_CBC:
switch(mode) {
case MODE_AUTHENTICATE: /* authenticate using CBC mode */
cbcauth();
break;
case MODE_DECRYPT: /* decrypt using CBC mode */
cbcdec();
break;
case MODE_ENCRYPT: /* encrypt using CBC mode */
cbcenc();
break;
}
break;
case ALG_CFB:
switch(mode) {
case MODE_AUTHENTICATE: /* authenticate using CFB mode */
cfbauth();
break;
case MODE_DECRYPT: /* decrypt using CFB mode */
cfbdec();
break;
case MODE_ENCRYPT: /* encrypt using CFB mode */
cfbenc();
break;
}
break;
case ALG_CFBA:
switch(mode) {
case MODE_AUTHENTICATE: /* authenticate using CFBA mode */
errx(1, "can't authenticate with CFBA mode");
break;
case MODE_DECRYPT: /* decrypt using CFBA mode */
cfbadec();
break;
case MODE_ENCRYPT: /* encrypt using CFBA mode */
cfbaenc();
break;
}
break;
case ALG_ECB:
switch(mode) {
case MODE_AUTHENTICATE: /* authenticate using ECB mode */
errx(1, "can't authenticate with ECB mode");
break;
case MODE_DECRYPT: /* decrypt using ECB mode */
ecbdec();
break;
case MODE_ENCRYPT: /* encrypt using ECB mode */
ecbenc();
break;
}
break;
case ALG_OFB:
switch(mode) {
case MODE_AUTHENTICATE: /* authenticate using OFB mode */
errx(1, "can't authenticate with OFB mode");
break;
case MODE_DECRYPT: /* decrypt using OFB mode */
ofbdec();
break;
case MODE_ENCRYPT: /* encrypt using OFB mode */
ofbenc();
break;
}
break;
}
return (0);
}
/*
* map a hex character to an integer
*/
static int
tobinhex(char c, int radix)
{
switch(c) {
case '0': return(0x0);
case '1': return(0x1);
case '2': return(radix > 2 ? 0x2 : -1);
case '3': return(radix > 3 ? 0x3 : -1);
case '4': return(radix > 4 ? 0x4 : -1);
case '5': return(radix > 5 ? 0x5 : -1);
case '6': return(radix > 6 ? 0x6 : -1);
case '7': return(radix > 7 ? 0x7 : -1);
case '8': return(radix > 8 ? 0x8 : -1);
case '9': return(radix > 9 ? 0x9 : -1);
case 'A': case 'a': return(radix > 10 ? 0xa : -1);
case 'B': case 'b': return(radix > 11 ? 0xb : -1);
case 'C': case 'c': return(radix > 12 ? 0xc : -1);
case 'D': case 'd': return(radix > 13 ? 0xd : -1);
case 'E': case 'e': return(radix > 14 ? 0xe : -1);
case 'F': case 'f': return(radix > 15 ? 0xf : -1);
}
/*
* invalid character
*/
return(-1);
}
/*
* convert the key to a bit pattern
*/
static void
cvtkey(DES_cblock obuf, char *ibuf)
{
int i, j; /* counter in a for loop */
int nbuf[64]; /* used for hex/key translation */
/*
* just switch on the key base
*/
switch(keybase) {
case KEY_ASCII: /* ascii to integer */
(void)strncpy(obuf, ibuf, 8);
return;
case KEY_DEFAULT: /* tell from context */
/*
* leading '0x' or '0X' == hex key
*/
if (ibuf[0] == '0' && (ibuf[1] == 'x' || ibuf[1] == 'X')) {
ibuf = &ibuf[2];
/*
* now translate it, bombing on any illegal hex digit
*/
for (i = 0; ibuf[i] && i < 16; i++)
if ((nbuf[i] = tobinhex(ibuf[i], 16)) == -1)
warnx("bad hex digit in key");
while (i < 16)
nbuf[i++] = 0;
for (i = 0; i < 8; i++)
obuf[i] =
((nbuf[2*i]&0xf)<<4) | (nbuf[2*i+1]&0xf);
/* preserve parity bits */
pflag = 1;
return;
}
/*
* leading '0b' or '0B' == binary key
*/
if (ibuf[0] == '0' && (ibuf[1] == 'b' || ibuf[1] == 'B')) {
ibuf = &ibuf[2];
/*
* now translate it, bombing on any illegal binary digit
*/
for (i = 0; ibuf[i] && i < 16; i++)
if ((nbuf[i] = tobinhex(ibuf[i], 2)) == -1)
warnx("bad binary digit in key");
while (i < 64)
nbuf[i++] = 0;
for (i = 0; i < 8; i++)
for (j = 0; j < 8; j++)
obuf[i] = (obuf[i]<<1)|nbuf[8*i+j];
/* preserve parity bits */
pflag = 1;
return;
}
/*
* no special leader -- ASCII
*/
(void)strncpy(obuf, ibuf, 8);
}
}
/*
* convert an ASCII string into a decimal number:
* 1. must be between 0 and 64 inclusive
* 2. must be a valid decimal number
* 3. must be a multiple of mult
*/
static int
setbits(char *s, int mult)
{
char *p; /* pointer in a for loop */
int n = 0; /* the integer collected */
/*
* skip white space
*/
while (isspace(*s))
s++;
/*
* get the integer
*/
for (p = s; *p; p++) {
if (isdigit(*p))
n = n * 10 + *p - '0';
else {
warnx("bad decimal digit in MAC length");
}
}
/*
* be sure it's a multiple of mult
*/
return((n % mult != 0) ? -1 : n);
}
/*****************
* DES FUNCTIONS *
*****************/
/*
* This sets the DES key and (if you're using the deszip version)
* the direction of the transformation. This uses the Sun
* to map the 64-bit key onto the 56 bits that the key schedule
* generation routines use: the old way, which just uses the user-
* supplied 64 bits as is, and the new way, which resets the parity
* bit to be the same as the low-order bit in each character. The
* new way generates a greater variety of key schedules, since many
* systems set the parity (high) bit of each character to 0, and the
* DES ignores the low order bit of each character.
*/
static void
makekey(DES_cblock *buf)
{
int i, j; /* counter in a for loop */
int par; /* parity counter */
/*
* if the parity is not preserved, flip it
*/
if (!pflag) {
for (i = 0; i < 8; i++) {
par = 0;
for (j = 1; j < 8; j++)
if ((bits[j] & (*buf)[i]) != 0)
par++;
if ((par & 0x01) == 0x01)
(*buf)[i] &= 0x7f;
else
(*buf)[i] = ((*buf)[i] & 0x7f) | 0x80;
}
}
DES_set_odd_parity(buf);
DES_set_key(buf, &schedule);
}
/*
* This encrypts using the Electronic Code Book mode of DES
*/
static void
ecbenc(void)
{
int n; /* number of bytes actually read */
int bn; /* block number */
DES_cblock msgbuf; /* I/O buffer */
for (bn = 0; (n = READ(msgbuf, 8)) == 8; bn++) {
/*
* do the transformation
*/
DES_XFORM(&msgbuf);
WRITE(&msgbuf, 8);
}
/*
* at EOF or last block -- in either case, the last byte contains
* the character representation of the number of bytes in it
*/
bn++;
MEMZERO(&msgbuf[n], 8 - n);
msgbuf[7] = n;
DES_XFORM(&msgbuf);
WRITE(&msgbuf, 8);
}
/*
* This decrypts using the Electronic Code Book mode of DES
*/
static void
ecbdec(void)
{
int n; /* number of bytes actually read */
int c; /* used to test for EOF */
int bn; /* block number */
DES_cblock msgbuf; /* I/O buffer */
for (bn = 1; (n = READ(msgbuf, 8)) == 8; bn++) {
/*
* do the transformation
*/
DES_XFORM(&msgbuf);
/*
* if the last one, handle it specially
*/
if ((c = getchar()) == EOF) {
n = msgbuf[7];
if (n < 0 || n > 7)
warnx("decryption failed (block corrupt) at %d",
bn);
}
else
(void)ungetc(c, stdin);
WRITE(msgbuf, n);
}
if (n > 0)
warnx("decryption failed (incomplete block) at %d", bn);
}
/*
* This encrypts using the Cipher Block Chaining mode of DES
*/
static void
cbcenc(void)
{
int n; /* number of bytes actually read */
int bn; /* block number */
DES_cblock msgbuf; /* I/O buffer */
/*
* do the transformation
*/
for (bn = 1; (n = READ(msgbuf, 8)) == 8; bn++) {
for (n = 0; n < 8; n++)
msgbuf[n] ^= ivec[n];
DES_XFORM(&msgbuf);
MEMCPY(ivec, msgbuf, 8);
WRITE(msgbuf, 8);
}
/*
* at EOF or last block -- in either case, the last byte contains
* the character representation of the number of bytes in it
*/
bn++;
MEMZERO(&msgbuf[n], 8 - n);
msgbuf[7] = n;
for (n = 0; n < 8; n++)
msgbuf[n] ^= ivec[n];
DES_XFORM(&msgbuf);
WRITE(msgbuf, 8);
}
/*
* This decrypts using the Cipher Block Chaining mode of DES
*/
static void
cbcdec(void)
{
int n; /* number of bytes actually read */
DES_cblock msgbuf; /* I/O buffer */
DES_cblock ibuf; /* temp buffer for initialization vector */
int c; /* used to test for EOF */
int bn; /* block number */
for (bn = 0; (n = READ(msgbuf, 8)) == 8; bn++) {
/*
* do the transformation
*/
MEMCPY(ibuf, msgbuf, 8);
DES_XFORM(&msgbuf);
for (c = 0; c < 8; c++)
msgbuf[c] ^= ivec[c];
MEMCPY(ivec, ibuf, 8);
/*
* if the last one, handle it specially
*/
if ((c = getchar()) == EOF) {
n = msgbuf[7];
if (n < 0 || n > 7)
warnx("decryption failed (block corrupt) at %d",
bn);
}
else
(void)ungetc(c, stdin);
WRITE(msgbuf, n);
}
if (n > 0)
warnx("decryption failed (incomplete block) at %d", bn);
}
/*
* This authenticates using the Cipher Block Chaining mode of DES
*/
static void
cbcauth(void)
{
int n, j; /* number of bytes actually read */
DES_cblock msgbuf; /* I/O buffer */
DES_cblock encbuf; /* encryption buffer */
/*
* do the transformation
* note we DISCARD the encrypted block;
* we only care about the last one
*/
while ((n = READ(msgbuf, 8)) == 8) {
for (n = 0; n < 8; n++)
encbuf[n] = msgbuf[n] ^ ivec[n];
DES_XFORM(&encbuf);
MEMCPY(ivec, encbuf, 8);
}
/*
* now compute the last one, right padding with '\0' if need be
*/
if (n > 0) {
MEMZERO(&msgbuf[n], 8 - n);
for (n = 0; n < 8; n++)
encbuf[n] = msgbuf[n] ^ ivec[n];
DES_XFORM(&encbuf);
}
/*
* drop the bits
* we write chars until fewer than 7 bits,
* and then pad the last one with 0 bits
*/
for (n = 0; macbits > 7; n++, macbits -= 8)
(void)putchar(encbuf[n]);
if (macbits > 0) {
msgbuf[0] = 0x00;
for (j = 0; j < macbits; j++)
msgbuf[0] |= encbuf[n] & bits[j];
(void)putchar(msgbuf[0]);
}
}
/*
* This encrypts using the Cipher FeedBack mode of DES
*/
static void
cfbenc(void)
{
int n; /* number of bytes actually read */
int nbytes; /* number of bytes to read */
int bn; /* block number */
char ibuf[8]; /* input buffer */
DES_cblock msgbuf; /* encryption buffer */
/*
* do things in bytes, not bits
*/
nbytes = fbbits / 8;
/*
* do the transformation
*/
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (n = 0; n < 8 - nbytes; n++)
ivec[n] = ivec[n+nbytes];
for (n = 0; n < nbytes; n++)
ivec[8 - nbytes + n] = ibuf[n] ^ msgbuf[n];
WRITE(&ivec[8 - nbytes], nbytes);
}
/*
* at EOF or last block -- in either case, the last byte contains
* the character representation of the number of bytes in it
*/
bn++;
MEMZERO(&ibuf[n], nbytes - n);
ibuf[nbytes - 1] = n;
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (n = 0; n < nbytes; n++)
ibuf[n] ^= msgbuf[n];
WRITE(ibuf, nbytes);
}
/*
* This decrypts using the Cipher Block Chaining mode of DES
*/
static void
cfbdec(void)
{
int n; /* number of bytes actually read */
int c; /* used to test for EOF */
int nbytes; /* number of bytes to read */
int bn; /* block number */
char ibuf[8]; /* input buffer */
char obuf[8]; /* output buffer */
DES_cblock msgbuf; /* encryption buffer */
/*
* do things in bytes, not bits
*/
nbytes = fbbits / 8;
/*
* do the transformation
*/
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (c = 0; c < 8 - nbytes; c++)
ivec[c] = ivec[c + nbytes];
for (c = 0; c < nbytes; c++) {
ivec[8 - nbytes + c] = ibuf[c];
obuf[c] = ibuf[c] ^ msgbuf[c];
}
/*
* if the last one, handle it specially
*/
if ((c = getchar()) == EOF) {
n = obuf[nbytes-1];
if (n < 0 || n > nbytes-1)
warnx("decryption failed (block corrupt) at %d",
bn);
}
else
(void)ungetc(c, stdin);
WRITE(obuf, n);
}
if (n > 0)
warnx("decryption failed (incomplete block) at %d", bn);
}
/*
* This encrypts using the alternative Cipher FeedBack mode of DES
*/
static void
cfbaenc(void)
{
int n; /* number of bytes actually read */
int nbytes; /* number of bytes to read */
int bn; /* block number */
char ibuf[8]; /* input buffer */
char obuf[8]; /* output buffer */
DES_cblock msgbuf; /* encryption buffer */
/*
* do things in bytes, not bits
*/
nbytes = fbbits / 7;
/*
* do the transformation
*/
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (n = 0; n < 8 - nbytes; n++)
ivec[n] = ivec[n + nbytes];
for (n = 0; n < nbytes; n++)
ivec[8 - nbytes + n] = (ibuf[n] ^ msgbuf[n]) | 0x80;
for (n = 0; n < nbytes; n++)
obuf[n] = ivec[8 - nbytes + n] & 0x7f;
WRITE(obuf, nbytes);
}
/*
* at EOF or last block -- in either case, the last byte contains
* the character representation of the number of bytes in it
*/
bn++;
MEMZERO(&ibuf[n], nbytes - n);
ibuf[nbytes - 1] = ('0' + n)|0200;
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (n = 0; n < nbytes; n++)
ibuf[n] ^= msgbuf[n];
WRITE(ibuf, nbytes);
}
/*
* This decrypts using the alternative Cipher Block Chaining mode of DES
*/
static void
cfbadec(void)
{
int n; /* number of bytes actually read */
int c; /* used to test for EOF */
int nbytes; /* number of bytes to read */
int bn; /* block number */
char ibuf[8]; /* input buffer */
char obuf[8]; /* output buffer */
DES_cblock msgbuf; /* encryption buffer */
/*
* do things in bytes, not bits
*/
nbytes = fbbits / 7;
/*
* do the transformation
*/
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (c = 0; c < 8 - nbytes; c++)
ivec[c] = ivec[c + nbytes];
for (c = 0; c < nbytes; c++) {
ivec[8 - nbytes + c] = ibuf[c] | 0x80;
obuf[c] = (ibuf[c] ^ msgbuf[c]) & 0x7f;
}
/*
* if the last one, handle it specially
*/
if ((c = getchar()) == EOF) {
if ((n = (obuf[nbytes-1] - '0')) < 0
|| n > nbytes-1)
warnx("decryption failed (block corrupt) at %d",
bn);
}
else
(void)ungetc(c, stdin);
WRITE(obuf, n);
}
if (n > 0)
warnx("decryption failed (incomplete block) at %d", bn);
}
/*
* This encrypts using the Output FeedBack mode of DES
*/
static void
ofbenc(void)
{
int n; /* number of bytes actually read */
int c; /* used to test for EOF */
int nbytes; /* number of bytes to read */
int bn; /* block number */
char ibuf[8]; /* input buffer */
char obuf[8]; /* output buffer */
DES_cblock msgbuf; /* encryption buffer */
/*
* do things in bytes, not bits
*/
nbytes = fbbits / 8;
/*
* do the transformation
*/
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (n = 0; n < 8 - nbytes; n++)
ivec[n] = ivec[n + nbytes];
for (n = 0; n < nbytes; n++) {
ivec[8 - nbytes + n] = msgbuf[n];
obuf[n] = ibuf[n] ^ msgbuf[n];
}
WRITE(obuf, nbytes);
}
/*
* at EOF or last block -- in either case, the last byte contains
* the character representation of the number of bytes in it
*/
bn++;
MEMZERO(&ibuf[n], nbytes - n);
ibuf[nbytes - 1] = n;
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (c = 0; c < nbytes; c++)
ibuf[c] ^= msgbuf[c];
WRITE(ibuf, nbytes);
}
/*
* This decrypts using the Output Block Chaining mode of DES
*/
static void
ofbdec(void)
{
int n; /* number of bytes actually read */
int c; /* used to test for EOF */
int nbytes; /* number of bytes to read */
int bn; /* block number */
char ibuf[8]; /* input buffer */
char obuf[8]; /* output buffer */
DES_cblock msgbuf; /* encryption buffer */
/*
* do things in bytes, not bits
*/
nbytes = fbbits / 8;
/*
* do the transformation
*/
for (bn = 1; (n = READ(ibuf, nbytes)) == nbytes; bn++) {
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (c = 0; c < 8 - nbytes; c++)
ivec[c] = ivec[c + nbytes];
for (c = 0; c < nbytes; c++) {
ivec[8 - nbytes + c] = msgbuf[c];
obuf[c] = ibuf[c] ^ msgbuf[c];
}
/*
* if the last one, handle it specially
*/
if ((c = getchar()) == EOF) {
n = obuf[nbytes-1];
if (n < 0 || n > nbytes-1)
warnx("decryption failed (block corrupt) at %d",
bn);
}
else
(void)ungetc(c, stdin);
/*
* dump it
*/
WRITE(obuf, n);
}
if (n > 0)
warnx("decryption failed (incomplete block) at %d", bn);
}
/*
* This authenticates using the Cipher FeedBack mode of DES
*/
static void
cfbauth(void)
{
int n, j; /* number of bytes actually read */
int nbytes; /* number of bytes to read */
char ibuf[8]; /* input buffer */
DES_cblock msgbuf; /* encryption buffer */
/*
* do things in bytes, not bits
*/
nbytes = fbbits / 8;
/*
* do the transformation
*/
while ((n = READ(ibuf, nbytes)) == nbytes) {
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (n = 0; n < 8 - nbytes; n++)
ivec[n] = ivec[n + nbytes];
for (n = 0; n < nbytes; n++)
ivec[8 - nbytes + n] = ibuf[n] ^ msgbuf[n];
}
/*
* at EOF or last block -- in either case, the last byte contains
* the character representation of the number of bytes in it
*/
MEMZERO(&ibuf[n], nbytes - n);
ibuf[nbytes - 1] = '0' + n;
MEMCPY(msgbuf, ivec, 8);
DES_XFORM(&msgbuf);
for (n = 0; n < nbytes; n++)
ibuf[n] ^= msgbuf[n];
/*
* drop the bits
* we write chars until fewer than 7 bits,
* and then pad the last one with 0 bits
*/
for (n = 0; macbits > 7; n++, macbits -= 8)
(void)putchar(msgbuf[n]);
if (macbits > 0) {
msgbuf[0] = 0x00;
for (j = 0; j < macbits; j++)
msgbuf[0] |= msgbuf[n] & bits[j];
(void)putchar(msgbuf[0]);
}
}
/*
* message about usage
*/
static void
usage(void)
{
(void)fprintf(stderr, "%s\n",
"usage: bdes [-abdp] [-F bit] [-f bit] [-k key] [-m bit] [-o bit] [-v vector]");
exit(1);
}
|