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
|
/*-
* Copyright (c) 1989, 1993
* The Regents of the University of California. All rights reserved.
*
* 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.
* 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.
*/
#ifdef HAVE_CONFIG_H
# include <config.h>
#endif
#ifdef ENCRYPTION
# ifdef KERBEROS
# include <sys/param.h>
# include <kerberosIV/des.h>
# include <kerberosIV/krb.h>
# include <stdlib.h>
# include <string.h>
# include <time.h>
# include <unistd.h>
static unsigned char des_inbuf[10240], storage[10240], *store_ptr;
static bit_64 *key;
static u_char *key_schedule;
/* XXX these should be in a kerberos include file */
int krb_net_read (int, char *, int);
/*
* NB: These routines will not function properly if NBIO
* is set
*/
void
des_clear_key ()
{
bzero ((char *) key, sizeof (C_Block));
bzero ((char *) key_schedule, sizeof (Key_schedule));
}
int
des_read (fd, buf, len)
int fd;
register char *buf;
int len;
{
int nreturned = 0;
long net_len, rd_len;
int nstored = 0;
if (nstored >= len)
{
bcopy (store_ptr, buf, len);
store_ptr += len;
nstored -= len;
return (len);
}
else if (nstored)
{
bcopy (store_ptr, buf, nstored);
nreturned += nstored;
buf += nstored;
len -= nstored;
nstored = 0;
}
if (krb_net_read (fd, (char *) &net_len, sizeof (net_len)) !=
sizeof (net_len))
{
/* XXX can't read enough, pipe
must have closed */
return (0);
}
net_len = ntohl (net_len);
if (net_len <= 0 || net_len > sizeof (des_inbuf))
{
/* preposterous length; assume out-of-sync; only
recourse is to close connection, so return 0 */
return (0);
}
/* the writer tells us how much real data we are getting, but
we need to read the pad bytes (8-byte boundary) */
rd_len = roundup (net_len, 8);
if (krb_net_read (fd, (char *) des_inbuf, rd_len) != rd_len)
{
/* pipe must have closed, return 0 */
return (0);
}
des_pcbc_encrypt (des_inbuf, /* inbuf */
storage, /* outbuf */
net_len, /* length */
key_schedule, /* DES key */
key, /* IV */
DECRYPT); /* direction */
if (net_len < 8)
store_ptr = storage + 8 - net_len;
else
store_ptr = storage;
nstored = net_len;
if (nstored > len)
{
bcopy (store_ptr, buf, len);
nreturned += len;
store_ptr += len;
nstored -= len;
}
else
{
bcopy (store_ptr, buf, nstored);
nreturned += nstored;
nstored = 0;
}
return (nreturned);
}
static unsigned char des_outbuf[10240]; /* > longest write */
int
des_write (fd, buf, len)
int fd;
char *buf;
int len;
{
static int seeded = 0;
static char garbage_buf[8];
long net_len, garbage;
if (len < 8)
{
if (!seeded)
{
seeded = 1;
srandom ((int) time ((long *) 0));
}
garbage = random ();
/* insert random garbage */
bcopy (&garbage, garbage_buf, MIN (sizeof (long), 8));
/* this "right-justifies" the data in the buffer */
bcopy (buf, garbage_buf + 8 - len, len);
}
/* pcbc_encrypt outputs in 8-byte (64 bit) increments */
des_pcbc_encrypt ((len < 8) ? garbage_buf : buf, des_outbuf, (len < 8) ? 8 : len, key_schedule, /* DES key */
key, /* IV */
ENCRYPT);
/* tell the other end the real amount, but send an 8-byte padded
packet */
net_len = htonl (len);
write (fd, &net_len, sizeof (net_len));
write (fd, des_outbuf, roundup (len, 8));
return (len);
}
# endif /* KERBEROS */
#endif /* CRYPT */
|
