ncp_crypt.c revision 51852
1/*
2 * $FreeBSD: head/sys/netncp/ncp_crypt.c 51852 1999-10-02 04:06:24Z bp $
3 */
4#include <sys/param.h>
5#include <sys/errno.h>
6#include <sys/malloc.h>
7#include <sys/systm.h>
8#include <sys/proc.h>
9#include <sys/kernel.h>
10#include <sys/poll.h>
11#include <netncp/ncp.h>
12#include <netncp/ncp_subr.h>
13
14/*
15 *  Routines in this file based on work of Volker Lendecke
16 */
17/*$*********************************************************
18   $*
19   $* This code has been taken from DDJ 11/93, from an
20   $* article by Pawel Szczerbina.
21   $*
22   $* Password encryption routines follow.
23   $* Converted to C from Barry Nance's Pascal
24   $* prog published in the March -93 issue of Byte.
25   $*
26   $* Adapted to be useable for ncpfs by
27   $* Volker Lendecke <lendecke@namu01.gwdg.de> in
28   $* October 1995.
29   $*
30   $********************************************************* */
31
32
33
34typedef unsigned char buf32[32];
35
36static unsigned char encrypttable[256] = {
370x7, 0x8, 0x0, 0x8, 0x6, 0x4, 0xE, 0x4, 0x5, 0xC, 0x1, 0x7, 0xB, 0xF, 0xA, 0x8,
380xF, 0x8, 0xC, 0xC, 0x9, 0x4, 0x1, 0xE, 0x4, 0x6, 0x2, 0x4, 0x0, 0xA, 0xB, 0x9,
390x2, 0xF, 0xB, 0x1, 0xD, 0x2, 0x1, 0x9, 0x5, 0xE, 0x7, 0x0, 0x0, 0x2, 0x6, 0x6,
400x0, 0x7, 0x3, 0x8, 0x2, 0x9, 0x3, 0xF, 0x7, 0xF, 0xC, 0xF, 0x6, 0x4, 0xA, 0x0,
410x2, 0x3, 0xA, 0xB, 0xD, 0x8, 0x3, 0xA, 0x1, 0x7, 0xC, 0xF, 0x1, 0x8, 0x9, 0xD,
420x9, 0x1, 0x9, 0x4, 0xE, 0x4, 0xC, 0x5, 0x5, 0xC, 0x8, 0xB, 0x2, 0x3, 0x9, 0xE,
430x7, 0x7, 0x6, 0x9, 0xE, 0xF, 0xC, 0x8, 0xD, 0x1, 0xA, 0x6, 0xE, 0xD, 0x0, 0x7,
440x7, 0xA, 0x0, 0x1, 0xF, 0x5, 0x4, 0xB, 0x7, 0xB, 0xE, 0xC, 0x9, 0x5, 0xD, 0x1,
450xB, 0xD, 0x1, 0x3, 0x5, 0xD, 0xE, 0x6, 0x3, 0x0, 0xB, 0xB, 0xF, 0x3, 0x6, 0x4,
460x9, 0xD, 0xA, 0x3, 0x1, 0x4, 0x9, 0x4, 0x8, 0x3, 0xB, 0xE, 0x5, 0x0, 0x5, 0x2,
470xC, 0xB, 0xD, 0x5, 0xD, 0x5, 0xD, 0x2, 0xD, 0x9, 0xA, 0xC, 0xA, 0x0, 0xB, 0x3,
480x5, 0x3, 0x6, 0x9, 0x5, 0x1, 0xE, 0xE, 0x0, 0xE, 0x8, 0x2, 0xD, 0x2, 0x2, 0x0,
490x4, 0xF, 0x8, 0x5, 0x9, 0x6, 0x8, 0x6, 0xB, 0xA, 0xB, 0xF, 0x0, 0x7, 0x2, 0x8,
500xC, 0x7, 0x3, 0xA, 0x1, 0x4, 0x2, 0x5, 0xF, 0x7, 0xA, 0xC, 0xE, 0x5, 0x9, 0x3,
510xE, 0x7, 0x1, 0x2, 0xE, 0x1, 0xF, 0x4, 0xA, 0x6, 0xC, 0x6, 0xF, 0x4, 0x3, 0x0,
520xC, 0x0, 0x3, 0x6, 0xF, 0x8, 0x7, 0xB, 0x2, 0xD, 0xC, 0x6, 0xA, 0xA, 0x8, 0xD
53};
54
55static buf32 encryptkeys = {
56    0x48, 0x93, 0x46, 0x67, 0x98, 0x3D, 0xE6, 0x8D,
57    0xB7, 0x10, 0x7A, 0x26, 0x5A, 0xB9, 0xB1, 0x35,
58    0x6B, 0x0F, 0xD5, 0x70, 0xAE, 0xFB, 0xAD, 0x11,
59    0xF4, 0x47, 0xDC, 0xA7, 0xEC, 0xCF, 0x50, 0xC0
60};
61
62/*
63 * Create table-based 16-bytes hash from a 32-bytes array
64 */
65static void
66nw_hash(buf32 temp, unsigned char *target) {
67	short sum;
68	unsigned char b3;
69	int s, b2, i;
70
71	sum = 0;
72
73	for (b2 = 0; b2 <= 1; ++b2) {
74		for (s = 0; s <= 31; ++s) {
75			b3 = (temp[s] + sum) ^ (temp[(s + sum) & 31] - encryptkeys[s]);
76			sum += b3;
77			temp[s] = b3;
78		}
79	}
80
81	for (i = 0; i <= 15; ++i) {
82		target[i] = encrypttable[temp[2 * i]]
83		    | (encrypttable[temp[2 * i + 1]] << 4);
84	}
85}
86
87
88/*
89 * Create a 16-bytes pattern from given buffer based on a four bytes key
90 */
91void
92nw_keyhash(const u_char *key, const u_char *buf, int buflen, u_char *target) {
93	int b2, d, s;
94	buf32 temp;
95
96	while (buflen > 0 && buf[buflen - 1] == 0)
97		buflen--;
98
99	bzero(temp, sizeof(temp));
100
101	d = 0;
102	while (buflen >= 32) {
103		for (s = 0; s <= 31; ++s)
104			temp[s] ^= buf[d++];
105		buflen -= 32;
106	}
107	b2 = d;
108	if (buflen > 0)	{
109		for (s = 0; s <= 31; ++s) {
110			if (d + buflen == b2) {
111				temp[s] ^= encryptkeys[s];
112				b2 = d;
113			} else
114				temp[s] ^= buf[b2++];
115		}
116	}
117	for (s = 0; s <= 31; ++s)
118		temp[s] ^= key[s & 3];
119
120	nw_hash(temp, target);
121}
122
123/*
124 * Create an 8-bytes pattern from an 8-bytes key and 16-bytes of data
125 */
126void
127nw_encrypt(const u_char *fra, const u_char *buf, u_char *target) {
128	buf32 k;
129	int s;
130
131	nw_keyhash(fra, buf, 16, k);
132	nw_keyhash(fra + 4, buf, 16, k + 16);
133
134	for (s = 0; s < 16; s++)
135		k[s] ^= k[31 - s];
136
137	for (s = 0; s < 8; s++)
138		*target++ = k[s] ^ k[15 - s];
139}
140
141#ifdef KERNEL
142/*
143 * MD4 routine taken from libmd sources
144 */
145typedef u_int32_t	UINT4;
146typedef unsigned char *POINTER;
147
148#define PROTO_LIST(list) list
149
150static void Decode PROTO_LIST
151  ((UINT4 *, const unsigned char *, unsigned int));
152
153/* Constants for MD4Transform routine.
154 */
155#define S11 3
156#define S12 7
157#define S13 11
158#define S14 19
159#define S21 3
160#define S22 5
161#define S23 9
162#define S24 13
163#define S31 3
164#define S32 9
165#define S33 11
166#define S34 15
167
168/* F, G and H are basic MD4 functions.
169 */
170#define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
171#define G(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
172#define H(x, y, z) ((x) ^ (y) ^ (z))
173
174/* ROTATE_LEFT rotates x left n bits.
175 */
176#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
177
178/* FF, GG and HH are transformations for rounds 1, 2 and 3 */
179/* Rotation is separate from addition to prevent recomputation */
180#define FF(a, b, c, d, x, s) { \
181    (a) += F ((b), (c), (d)) + (x); \
182    (a) = ROTATE_LEFT ((a), (s)); \
183  }
184#define GG(a, b, c, d, x, s) { \
185    (a) += G ((b), (c), (d)) + (x) + (UINT4)0x5a827999; \
186    (a) = ROTATE_LEFT ((a), (s)); \
187  }
188#define HH(a, b, c, d, x, s) { \
189    (a) += H ((b), (c), (d)) + (x) + (UINT4)0x6ed9eba1; \
190    (a) = ROTATE_LEFT ((a), (s)); \
191  }
192
193void
194ncp_sign(const u_int32_t *state, const char *block, u_int32_t *ostate) {
195	UINT4 a, b, c, d, x[16];
196
197	Decode (x, block, 64);
198	a = state[0];
199	b = state[1];
200	c = state[2];
201	d = state[3];
202	/* Round 1 */
203	FF (a, b, c, d, x[ 0], S11); /* 1 */
204	FF (d, a, b, c, x[ 1], S12); /* 2 */
205	FF (c, d, a, b, x[ 2], S13); /* 3 */
206	FF (b, c, d, a, x[ 3], S14); /* 4 */
207	FF (a, b, c, d, x[ 4], S11); /* 5 */
208	FF (d, a, b, c, x[ 5], S12); /* 6 */
209	FF (c, d, a, b, x[ 6], S13); /* 7 */
210	FF (b, c, d, a, x[ 7], S14); /* 8 */
211	FF (a, b, c, d, x[ 8], S11); /* 9 */
212	FF (d, a, b, c, x[ 9], S12); /* 10 */
213	FF (c, d, a, b, x[10], S13); /* 11 */
214	FF (b, c, d, a, x[11], S14); /* 12 */
215	FF (a, b, c, d, x[12], S11); /* 13 */
216	FF (d, a, b, c, x[13], S12); /* 14 */
217	FF (c, d, a, b, x[14], S13); /* 15 */
218	FF (b, c, d, a, x[15], S14); /* 16 */
219
220	/* Round 2 */
221	GG (a, b, c, d, x[ 0], S21); /* 17 */
222	GG (d, a, b, c, x[ 4], S22); /* 18 */
223	GG (c, d, a, b, x[ 8], S23); /* 19 */
224	GG (b, c, d, a, x[12], S24); /* 20 */
225	GG (a, b, c, d, x[ 1], S21); /* 21 */
226	GG (d, a, b, c, x[ 5], S22); /* 22 */
227	GG (c, d, a, b, x[ 9], S23); /* 23 */
228	GG (b, c, d, a, x[13], S24); /* 24 */
229	GG (a, b, c, d, x[ 2], S21); /* 25 */
230	GG (d, a, b, c, x[ 6], S22); /* 26 */
231	GG (c, d, a, b, x[10], S23); /* 27 */
232	GG (b, c, d, a, x[14], S24); /* 28 */
233	GG (a, b, c, d, x[ 3], S21); /* 29 */
234	GG (d, a, b, c, x[ 7], S22); /* 30 */
235	GG (c, d, a, b, x[11], S23); /* 31 */
236	GG (b, c, d, a, x[15], S24); /* 32 */
237
238	/* Round 3 */
239	HH (a, b, c, d, x[ 0], S31); /* 33 */
240	HH (d, a, b, c, x[ 8], S32); /* 34 */
241	HH (c, d, a, b, x[ 4], S33); /* 35 */
242	HH (b, c, d, a, x[12], S34); /* 36 */
243	HH (a, b, c, d, x[ 2], S31); /* 37 */
244	HH (d, a, b, c, x[10], S32); /* 38 */
245	HH (c, d, a, b, x[ 6], S33); /* 39 */
246	HH (b, c, d, a, x[14], S34); /* 40 */
247	HH (a, b, c, d, x[ 1], S31); /* 41 */
248	HH (d, a, b, c, x[ 9], S32); /* 42 */
249	HH (c, d, a, b, x[ 5], S33); /* 43 */
250	HH (b, c, d, a, x[13], S34); /* 44 */
251	HH (a, b, c, d, x[ 3], S31); /* 45 */
252	HH (d, a, b, c, x[11], S32); /* 46 */
253	HH (c, d, a, b, x[ 7], S33); /* 47 */
254	HH (b, c, d, a, x[15], S34); /* 48 */
255
256	ostate[0] = state[0] + a;
257	ostate[1] = state[1] + b;
258	ostate[2] = state[2] + c;
259	ostate[3] = state[3] + d;
260}
261
262/* Decodes input (unsigned char) into output (UINT4). Assumes len is
263     a multiple of 4.
264 */
265static void Decode (output, input, len)
266
267UINT4 *output;
268const unsigned char *input;
269unsigned int len;
270{
271  unsigned int i, j;
272
273  for (i = 0, j = 0; j < len; i++, j += 4)
274    output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
275      (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
276}
277
278#endif /* KERNEL */
279