cbc.c revision 1.4 1 1.1 cgd /* cbc.c: This file contains the encryption routines for the ed line editor */
2 1.1 cgd /*-
3 1.1 cgd * Copyright (c) 1991 The Regents of the University of California.
4 1.1 cgd * All rights reserved.
5 1.1 cgd *
6 1.1 cgd * This code is derived from software contributed to Berkeley by
7 1.1 cgd * Matt Bishop of Dartmouth College.
8 1.1 cgd *
9 1.1 cgd * The United States Government has rights in this work pursuant
10 1.1 cgd * to contract no. NAG 2-680 between the National Aeronautics and
11 1.1 cgd * Space Administration and Dartmouth College.
12 1.1 cgd *
13 1.1 cgd * Redistribution and use in source and binary forms, with or without
14 1.1 cgd * modification, are permitted provided that the following conditions
15 1.1 cgd * are met:
16 1.1 cgd * 1. Redistributions of source code must retain the above copyright
17 1.1 cgd * notice, this list of conditions and the following disclaimer.
18 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
19 1.1 cgd * notice, this list of conditions and the following disclaimer in the
20 1.1 cgd * documentation and/or other materials provided with the distribution.
21 1.1 cgd * 3. All advertising materials mentioning features or use of this software
22 1.1 cgd * must display the following acknowledgement:
23 1.1 cgd * This product includes software developed by the University of
24 1.1 cgd * California, Berkeley and its contributors.
25 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
26 1.1 cgd * may be used to endorse or promote products derived from this software
27 1.1 cgd * without specific prior written permission.
28 1.1 cgd *
29 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
30 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
31 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
32 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
33 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
34 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
35 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
36 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
37 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
38 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
39 1.1 cgd * SUCH DAMAGE.
40 1.1 cgd */
41 1.1 cgd
42 1.1 cgd #ifndef lint
43 1.1 cgd static char sccsid[] = "@(#)cbc.c 5.5 (Berkeley) 6/27/91";
44 1.1 cgd #endif /* not lint */
45 1.1 cgd
46 1.1 cgd /* Author: Matt Bishop
47 1.1 cgd * Department of Mathematics and Computer Science
48 1.1 cgd * Dartmouth College
49 1.1 cgd * Hanover, NH 03755
50 1.1 cgd * Email: Matt.Bishop (at) dartmouth.edu
51 1.1 cgd * ...!decvax!dartvax!Matt.Bishop
52 1.1 cgd *
53 1.1 cgd * See Technical Report PCS-TR91-158, Department of Mathematics and Computer
54 1.1 cgd * Science, Dartmouth College, for a detailed description of the implemen-
55 1.1 cgd * tation and differences between it and Sun's. The DES is described in
56 1.1 cgd * FIPS PUB 46, and the modes in FIPS PUB 81 (see either the manual page
57 1.1 cgd * or the technical report for a complete reference).
58 1.1 cgd */
59 1.1 cgd
60 1.1 cgd #include <errno.h>
61 1.1 cgd #include <pwd.h>
62 1.1 cgd #include <unistd.h>
63 1.1 cgd #include <stdio.h>
64 1.1 cgd #include <ctype.h>
65 1.1 cgd #include <stdlib.h>
66 1.1 cgd #include <string.h>
67 1.1 cgd #include <sys/types.h>
68 1.1 cgd
69 1.3 alm #include "ed.h"
70 1.3 alm
71 1.1 cgd /*
72 1.1 cgd * Define a divisor for rand() that yields a uniform distribution in the
73 1.1 cgd * range 0-255.
74 1.1 cgd */
75 1.1 cgd #define RAND_DIV (((unsigned) RAND_MAX + 1) >> 8)
76 1.1 cgd
77 1.1 cgd /*
78 1.1 cgd * BSD and System V systems offer special library calls that do
79 1.1 cgd * block moves and fills, so if possible we take advantage of them
80 1.1 cgd */
81 1.4 alm #define MEMCPY(dest,src,len) memcpy((dest),(src),(len))
82 1.4 alm #define MEMZERO(dest,len) memset((dest), 0, (len))
83 1.1 cgd
84 1.1 cgd /* Hide the calls to the primitive encryption routines. */
85 1.1 cgd #define DES_KEY(buf) \
86 1.1 cgd if (des_setkey(buf)) \
87 1.1 cgd err("des_setkey");
88 1.1 cgd #define DES_XFORM(buf) \
89 1.1 cgd if (des_cipher(buf, buf, 0L, (inverse ? -1 : 1))) \
90 1.1 cgd err("des_cipher");
91 1.1 cgd
92 1.1 cgd /*
93 1.1 cgd * read/write - no error checking
94 1.1 cgd */
95 1.1 cgd #define READ(buf, n, fp) fread(buf, sizeof(char), n, fp)
96 1.1 cgd #define WRITE(buf, n, fp) fwrite(buf, sizeof(char), n, fp)
97 1.1 cgd
98 1.1 cgd /*
99 1.1 cgd * some things to make references easier
100 1.1 cgd */
101 1.1 cgd typedef char Desbuf[8];
102 1.1 cgd #define CHAR(x,i) (x[i])
103 1.1 cgd #define UCHAR(x,i) (x[i])
104 1.1 cgd #define BUFFER(x) (x)
105 1.1 cgd #define UBUFFER(x) (x)
106 1.1 cgd
107 1.1 cgd /*
108 1.1 cgd * global variables and related macros
109 1.1 cgd */
110 1.1 cgd
111 1.1 cgd enum { /* encrypt, decrypt, authenticate */
112 1.1 cgd MODE_ENCRYPT, MODE_DECRYPT, MODE_AUTHENTICATE
113 1.1 cgd } mode = MODE_ENCRYPT;
114 1.1 cgd
115 1.1 cgd Desbuf ivec; /* initialization vector */
116 1.1 cgd Desbuf pvec; /* padding vector */
117 1.1 cgd char bits[] = { /* used to extract bits from a char */
118 1.1 cgd '\200', '\100', '\040', '\020', '\010', '\004', '\002', '\001'
119 1.1 cgd };
120 1.1 cgd int pflag; /* 1 to preserve parity bits */
121 1.1 cgd
122 1.4 alm char des_buf[8]; /* shared buffer for desgetc/desputc */
123 1.4 alm int des_ct = 0; /* count for desgetc/desputc */
124 1.4 alm int des_n = 0; /* index for desputc/desgetc */
125 1.4 alm
126 1.4 alm
127 1.4 alm /* desinit: initialize DES */
128 1.1 cgd void
129 1.4 alm desinit()
130 1.1 cgd {
131 1.4 alm #ifdef DES
132 1.1 cgd int i;
133 1.1 cgd
134 1.4 alm des_ct = des_n = 0;
135 1.4 alm
136 1.1 cgd /* initialize the initialization vctor */
137 1.1 cgd MEMZERO(ivec, 8);
138 1.1 cgd
139 1.1 cgd /* intialize the padding vector */
140 1.1 cgd srand((unsigned) time((time_t *) 0));
141 1.1 cgd for (i = 0; i < 8; i++)
142 1.1 cgd CHAR(pvec, i) = (char) (rand()/RAND_DIV);
143 1.4 alm #endif
144 1.4 alm }
145 1.4 alm
146 1.4 alm
147 1.4 alm /* desgetc: return next char in an encrypted file */
148 1.4 alm desgetc(fp)
149 1.4 alm FILE *fp;
150 1.4 alm {
151 1.4 alm #ifdef DES
152 1.4 alm if (des_n >= des_ct) {
153 1.4 alm des_n = 0;
154 1.4 alm des_ct = cbcdec(des_buf, fp);
155 1.4 alm }
156 1.4 alm return (des_ct > 0) ? des_buf[des_n++] : EOF;
157 1.4 alm #endif
158 1.4 alm }
159 1.4 alm
160 1.4 alm
161 1.4 alm /* desputc: write a char to an encrypted file; return char written */
162 1.4 alm desputc(c, fp)
163 1.4 alm int c;
164 1.4 alm FILE *fp;
165 1.4 alm {
166 1.4 alm #ifdef DES
167 1.4 alm if (des_n == sizeof des_buf) {
168 1.4 alm des_ct = cbcenc(des_buf, des_n, fp);
169 1.4 alm des_n = 0;
170 1.4 alm }
171 1.4 alm return (des_ct >= 0) ? (des_buf[des_n++] = c) : EOF;
172 1.4 alm #endif
173 1.4 alm }
174 1.4 alm
175 1.4 alm
176 1.4 alm /* desflush: flush an encrypted file's output; return status */
177 1.4 alm desflush(fp)
178 1.4 alm FILE *fp;
179 1.4 alm {
180 1.4 alm #ifdef DES
181 1.4 alm if (des_n == sizeof des_buf) {
182 1.4 alm des_ct = cbcenc(des_buf, des_n, fp);
183 1.4 alm des_n = 0;
184 1.4 alm }
185 1.4 alm return (des_ct >= 0 && cbcenc(des_buf, des_n, fp) >= 0) ? 0 : EOF;
186 1.4 alm #endif
187 1.1 cgd }
188 1.1 cgd
189 1.4 alm #ifdef DES
190 1.1 cgd /*
191 1.1 cgd * get keyword from tty or stdin
192 1.1 cgd */
193 1.1 cgd getkey()
194 1.1 cgd {
195 1.1 cgd register char *p; /* used to obtain the key */
196 1.1 cgd Desbuf msgbuf; /* I/O buffer */
197 1.1 cgd
198 1.1 cgd /*
199 1.1 cgd * get the key
200 1.1 cgd */
201 1.1 cgd if (*(p = getpass("Enter key: "))) {
202 1.1 cgd
203 1.1 cgd /*
204 1.1 cgd * copy it, nul-padded, into the key area
205 1.1 cgd */
206 1.1 cgd cvtkey(BUFFER(msgbuf), p);
207 1.1 cgd MEMZERO(p, _PASSWORD_LEN);
208 1.1 cgd makekey(msgbuf);
209 1.1 cgd MEMZERO(msgbuf, sizeof msgbuf);
210 1.1 cgd return 1;
211 1.1 cgd }
212 1.1 cgd return 0;
213 1.1 cgd }
214 1.1 cgd
215 1.2 cgd
216 1.2 cgd extern char errmsg[];
217 1.2 cgd
218 1.1 cgd /*
219 1.1 cgd * print a warning message and, possibly, terminate
220 1.1 cgd */
221 1.4 alm void
222 1.1 cgd err(s)
223 1.1 cgd char *s; /* the message */
224 1.1 cgd {
225 1.2 cgd (void)sprintf(errmsg, "%s", s ? s : strerror(errno));
226 1.1 cgd }
227 1.1 cgd
228 1.1 cgd /*
229 1.1 cgd * map a hex character to an integer
230 1.1 cgd */
231 1.1 cgd tobinhex(c, radix)
232 1.3 alm int c; /* char to be converted */
233 1.1 cgd int radix; /* base (2 to 16) */
234 1.1 cgd {
235 1.1 cgd switch(c) {
236 1.1 cgd case '0': return(0x0);
237 1.1 cgd case '1': return(0x1);
238 1.1 cgd case '2': return(radix > 2 ? 0x2 : -1);
239 1.1 cgd case '3': return(radix > 3 ? 0x3 : -1);
240 1.1 cgd case '4': return(radix > 4 ? 0x4 : -1);
241 1.1 cgd case '5': return(radix > 5 ? 0x5 : -1);
242 1.1 cgd case '6': return(radix > 6 ? 0x6 : -1);
243 1.1 cgd case '7': return(radix > 7 ? 0x7 : -1);
244 1.1 cgd case '8': return(radix > 8 ? 0x8 : -1);
245 1.1 cgd case '9': return(radix > 9 ? 0x9 : -1);
246 1.1 cgd case 'A': case 'a': return(radix > 10 ? 0xa : -1);
247 1.1 cgd case 'B': case 'b': return(radix > 11 ? 0xb : -1);
248 1.1 cgd case 'C': case 'c': return(radix > 12 ? 0xc : -1);
249 1.1 cgd case 'D': case 'd': return(radix > 13 ? 0xd : -1);
250 1.1 cgd case 'E': case 'e': return(radix > 14 ? 0xe : -1);
251 1.1 cgd case 'F': case 'f': return(radix > 15 ? 0xf : -1);
252 1.1 cgd }
253 1.1 cgd /*
254 1.1 cgd * invalid character
255 1.1 cgd */
256 1.1 cgd return(-1);
257 1.1 cgd }
258 1.1 cgd
259 1.1 cgd /*
260 1.1 cgd * convert the key to a bit pattern
261 1.1 cgd */
262 1.4 alm void
263 1.1 cgd cvtkey(obuf, ibuf)
264 1.1 cgd char *obuf; /* bit pattern */
265 1.1 cgd char *ibuf; /* the key itself */
266 1.1 cgd {
267 1.1 cgd register int i, j; /* counter in a for loop */
268 1.1 cgd int nbuf[64]; /* used for hex/key translation */
269 1.1 cgd
270 1.1 cgd /*
271 1.1 cgd * leading '0x' or '0X' == hex key
272 1.1 cgd */
273 1.1 cgd if (ibuf[0] == '0' && (ibuf[1] == 'x' || ibuf[1] == 'X')) {
274 1.1 cgd ibuf = &ibuf[2];
275 1.1 cgd /*
276 1.1 cgd * now translate it, bombing on any illegal hex digit
277 1.1 cgd */
278 1.1 cgd for (i = 0; ibuf[i] && i < 16; i++)
279 1.3 alm if ((nbuf[i] = tobinhex((int) ibuf[i], 16)) == -1)
280 1.1 cgd err("bad hex digit in key");
281 1.1 cgd while (i < 16)
282 1.1 cgd nbuf[i++] = 0;
283 1.1 cgd for (i = 0; i < 8; i++)
284 1.1 cgd obuf[i] =
285 1.1 cgd ((nbuf[2*i]&0xf)<<4) | (nbuf[2*i+1]&0xf);
286 1.1 cgd /* preserve parity bits */
287 1.1 cgd pflag = 1;
288 1.1 cgd return;
289 1.1 cgd }
290 1.1 cgd /*
291 1.1 cgd * leading '0b' or '0B' == binary key
292 1.1 cgd */
293 1.1 cgd if (ibuf[0] == '0' && (ibuf[1] == 'b' || ibuf[1] == 'B')) {
294 1.1 cgd ibuf = &ibuf[2];
295 1.1 cgd /*
296 1.1 cgd * now translate it, bombing on any illegal binary digit
297 1.1 cgd */
298 1.1 cgd for (i = 0; ibuf[i] && i < 16; i++)
299 1.3 alm if ((nbuf[i] = tobinhex((int) ibuf[i], 2)) == -1)
300 1.1 cgd err("bad binary digit in key");
301 1.1 cgd while (i < 64)
302 1.1 cgd nbuf[i++] = 0;
303 1.1 cgd for (i = 0; i < 8; i++)
304 1.1 cgd for (j = 0; j < 8; j++)
305 1.1 cgd obuf[i] = (obuf[i]<<1)|nbuf[8*i+j];
306 1.1 cgd /* preserve parity bits */
307 1.1 cgd pflag = 1;
308 1.1 cgd return;
309 1.1 cgd }
310 1.1 cgd /*
311 1.1 cgd * no special leader -- ASCII
312 1.1 cgd */
313 1.1 cgd (void)strncpy(obuf, ibuf, 8);
314 1.1 cgd }
315 1.1 cgd
316 1.1 cgd /*****************
317 1.1 cgd * DES FUNCTIONS *
318 1.1 cgd *****************/
319 1.1 cgd /*
320 1.1 cgd * This sets the DES key and (if you're using the deszip version)
321 1.1 cgd * the direction of the transformation. This uses the Sun
322 1.1 cgd * to map the 64-bit key onto the 56 bits that the key schedule
323 1.1 cgd * generation routines use: the old way, which just uses the user-
324 1.1 cgd * supplied 64 bits as is, and the new way, which resets the parity
325 1.1 cgd * bit to be the same as the low-order bit in each character. The
326 1.1 cgd * new way generates a greater variety of key schedules, since many
327 1.1 cgd * systems set the parity (high) bit of each character to 0, and the
328 1.1 cgd * DES ignores the low order bit of each character.
329 1.1 cgd */
330 1.4 alm void
331 1.1 cgd makekey(buf)
332 1.1 cgd Desbuf buf; /* key block */
333 1.1 cgd {
334 1.1 cgd register int i, j; /* counter in a for loop */
335 1.1 cgd register int par; /* parity counter */
336 1.1 cgd
337 1.1 cgd /*
338 1.1 cgd * if the parity is not preserved, flip it
339 1.1 cgd */
340 1.1 cgd if (!pflag) {
341 1.1 cgd for (i = 0; i < 8; i++) {
342 1.1 cgd par = 0;
343 1.1 cgd for (j = 1; j < 8; j++)
344 1.1 cgd if ((bits[j]&UCHAR(buf, i)) != 0)
345 1.1 cgd par++;
346 1.1 cgd if ((par&01) == 01)
347 1.1 cgd UCHAR(buf, i) = UCHAR(buf, i)&0177;
348 1.1 cgd else
349 1.1 cgd UCHAR(buf, i) = (UCHAR(buf, i)&0177)|0200;
350 1.1 cgd }
351 1.1 cgd }
352 1.1 cgd
353 1.1 cgd DES_KEY(UBUFFER(buf));
354 1.1 cgd }
355 1.1 cgd
356 1.1 cgd
357 1.1 cgd /*
358 1.1 cgd * This encrypts using the Cipher Block Chaining mode of DES
359 1.1 cgd */
360 1.1 cgd cbcenc(msgbuf, n, fp)
361 1.1 cgd char *msgbuf;
362 1.1 cgd int n;
363 1.1 cgd FILE *fp;
364 1.1 cgd {
365 1.1 cgd int inverse = 0; /* 0 to encrypt, 1 to decrypt */
366 1.1 cgd
367 1.1 cgd /*
368 1.1 cgd * do the transformation
369 1.1 cgd */
370 1.1 cgd if (n == 8) {
371 1.1 cgd for (n = 0; n < 8; n++)
372 1.1 cgd CHAR(msgbuf, n) ^= CHAR(ivec, n);
373 1.1 cgd DES_XFORM(UBUFFER(msgbuf));
374 1.1 cgd MEMCPY(BUFFER(ivec), BUFFER(msgbuf), 8);
375 1.1 cgd return WRITE(BUFFER(msgbuf), 8, fp);
376 1.1 cgd }
377 1.1 cgd /*
378 1.1 cgd * at EOF or last block -- in either case, the last byte contains
379 1.1 cgd * the character representation of the number of bytes in it
380 1.1 cgd */
381 1.1 cgd /*
382 1.1 cgd MEMZERO(msgbuf + n, 8 - n);
383 1.1 cgd */
384 1.1 cgd /*
385 1.1 cgd * Pad the last block randomly
386 1.1 cgd */
387 1.1 cgd (void)MEMCPY(BUFFER(msgbuf + n), BUFFER(pvec), 8 - n);
388 1.1 cgd CHAR(msgbuf, 7) = n;
389 1.1 cgd for (n = 0; n < 8; n++)
390 1.1 cgd CHAR(msgbuf, n) ^= CHAR(ivec, n);
391 1.1 cgd DES_XFORM(UBUFFER(msgbuf));
392 1.1 cgd return WRITE(BUFFER(msgbuf), 8, fp);
393 1.1 cgd }
394 1.1 cgd
395 1.1 cgd /*
396 1.1 cgd * This decrypts using the Cipher Block Chaining mode of DES
397 1.1 cgd */
398 1.1 cgd cbcdec(msgbuf, fp)
399 1.1 cgd char *msgbuf; /* I/O buffer */
400 1.1 cgd FILE *fp; /* input file descriptor */
401 1.1 cgd {
402 1.1 cgd Desbuf ibuf; /* temp buffer for initialization vector */
403 1.1 cgd register int n; /* number of bytes actually read */
404 1.1 cgd register int c; /* used to test for EOF */
405 1.1 cgd int inverse = 1; /* 0 to encrypt, 1 to decrypt */
406 1.1 cgd
407 1.1 cgd if ((n = READ(BUFFER(msgbuf), 8, fp)) == 8) {
408 1.1 cgd /*
409 1.1 cgd * do the transformation
410 1.1 cgd */
411 1.1 cgd MEMCPY(BUFFER(ibuf), BUFFER(msgbuf), 8);
412 1.1 cgd DES_XFORM(UBUFFER(msgbuf));
413 1.1 cgd for (c = 0; c < 8; c++)
414 1.1 cgd UCHAR(msgbuf, c) ^= UCHAR(ivec, c);
415 1.1 cgd MEMCPY(BUFFER(ivec), BUFFER(ibuf), 8);
416 1.1 cgd /*
417 1.1 cgd * if the last one, handle it specially
418 1.1 cgd */
419 1.1 cgd if ((c = fgetc(fp)) == EOF) {
420 1.1 cgd n = CHAR(msgbuf, 7);
421 1.1 cgd if (n < 0 || n > 7) {
422 1.1 cgd err("decryption failed (block corrupted)");
423 1.1 cgd return EOF;
424 1.1 cgd }
425 1.1 cgd } else
426 1.1 cgd (void)ungetc(c, fp);
427 1.1 cgd return n;
428 1.1 cgd }
429 1.1 cgd if (n > 0)
430 1.1 cgd err("decryption failed (incomplete block)");
431 1.2 cgd else if (n < 0)
432 1.2 cgd err("cannot read file");
433 1.1 cgd return EOF;
434 1.1 cgd }
435 1.1 cgd #endif /* DES */
436