Samba 3: added Samba 3.0.24 sources
[tomato.git] / release / src / router / samba3 / source / libsmb / smbdes.c
blobee43f4beee5981d0324df4f1e237033bc94c62b8
1 /*
2 Unix SMB/CIFS implementation.
4 a partial implementation of DES designed for use in the
5 SMB authentication protocol
7 Copyright (C) Andrew Tridgell 1998
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 2 of the License, or
12 (at your option) any later version.
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
19 You should have received a copy of the GNU General Public License
20 along with this program; if not, write to the Free Software
21 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
24 #include "includes.h"
26 /* NOTES:
28 This code makes no attempt to be fast! In fact, it is a very
29 slow implementation
31 This code is NOT a complete DES implementation. It implements only
32 the minimum necessary for SMB authentication, as used by all SMB
33 products (including every copy of Microsoft Windows95 ever sold)
35 In particular, it can only do a unchained forward DES pass. This
36 means it is not possible to use this code for encryption/decryption
37 of data, instead it is only useful as a "hash" algorithm.
39 There is no entry point into this code that allows normal DES operation.
41 I believe this means that this code does not come under ITAR
42 regulations but this is NOT a legal opinion. If you are concerned
43 about the applicability of ITAR regulations to this code then you
44 should confirm it for yourself (and maybe let me know if you come
45 up with a different answer to the one above)
49 #define uchar unsigned char
51 static const uchar perm1[56] = {57, 49, 41, 33, 25, 17, 9,
52 1, 58, 50, 42, 34, 26, 18,
53 10, 2, 59, 51, 43, 35, 27,
54 19, 11, 3, 60, 52, 44, 36,
55 63, 55, 47, 39, 31, 23, 15,
56 7, 62, 54, 46, 38, 30, 22,
57 14, 6, 61, 53, 45, 37, 29,
58 21, 13, 5, 28, 20, 12, 4};
60 static const uchar perm2[48] = {14, 17, 11, 24, 1, 5,
61 3, 28, 15, 6, 21, 10,
62 23, 19, 12, 4, 26, 8,
63 16, 7, 27, 20, 13, 2,
64 41, 52, 31, 37, 47, 55,
65 30, 40, 51, 45, 33, 48,
66 44, 49, 39, 56, 34, 53,
67 46, 42, 50, 36, 29, 32};
69 static const uchar perm3[64] = {58, 50, 42, 34, 26, 18, 10, 2,
70 60, 52, 44, 36, 28, 20, 12, 4,
71 62, 54, 46, 38, 30, 22, 14, 6,
72 64, 56, 48, 40, 32, 24, 16, 8,
73 57, 49, 41, 33, 25, 17, 9, 1,
74 59, 51, 43, 35, 27, 19, 11, 3,
75 61, 53, 45, 37, 29, 21, 13, 5,
76 63, 55, 47, 39, 31, 23, 15, 7};
78 static const uchar perm4[48] = { 32, 1, 2, 3, 4, 5,
79 4, 5, 6, 7, 8, 9,
80 8, 9, 10, 11, 12, 13,
81 12, 13, 14, 15, 16, 17,
82 16, 17, 18, 19, 20, 21,
83 20, 21, 22, 23, 24, 25,
84 24, 25, 26, 27, 28, 29,
85 28, 29, 30, 31, 32, 1};
87 static const uchar perm5[32] = { 16, 7, 20, 21,
88 29, 12, 28, 17,
89 1, 15, 23, 26,
90 5, 18, 31, 10,
91 2, 8, 24, 14,
92 32, 27, 3, 9,
93 19, 13, 30, 6,
94 22, 11, 4, 25};
97 static const uchar perm6[64] ={ 40, 8, 48, 16, 56, 24, 64, 32,
98 39, 7, 47, 15, 55, 23, 63, 31,
99 38, 6, 46, 14, 54, 22, 62, 30,
100 37, 5, 45, 13, 53, 21, 61, 29,
101 36, 4, 44, 12, 52, 20, 60, 28,
102 35, 3, 43, 11, 51, 19, 59, 27,
103 34, 2, 42, 10, 50, 18, 58, 26,
104 33, 1, 41, 9, 49, 17, 57, 25};
107 static const uchar sc[16] = {1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1};
109 static const uchar sbox[8][4][16] = {
110 {{14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7},
111 {0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8},
112 {4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0},
113 {15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13}},
115 {{15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10},
116 {3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5},
117 {0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15},
118 {13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9}},
120 {{10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8},
121 {13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1},
122 {13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7},
123 {1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12}},
125 {{7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15},
126 {13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9},
127 {10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4},
128 {3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14}},
130 {{2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9},
131 {14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6},
132 {4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14},
133 {11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3}},
135 {{12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11},
136 {10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8},
137 {9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6},
138 {4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13}},
140 {{4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1},
141 {13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6},
142 {1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2},
143 {6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12}},
145 {{13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7},
146 {1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2},
147 {7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8},
148 {2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11}}};
150 static void permute(char *out, const char *in, const uchar *p, int n)
152 int i;
153 for (i=0;i<n;i++)
154 out[i] = in[p[i]-1];
157 static void lshift(char *d, int count, int n)
159 char out[64];
160 int i;
161 for (i=0;i<n;i++)
162 out[i] = d[(i+count)%n];
163 for (i=0;i<n;i++)
164 d[i] = out[i];
167 static void concat(char *out, char *in1, char *in2, int l1, int l2)
169 while (l1--)
170 *out++ = *in1++;
171 while (l2--)
172 *out++ = *in2++;
175 static void xor(char *out, char *in1, char *in2, int n)
177 int i;
178 for (i=0;i<n;i++)
179 out[i] = in1[i] ^ in2[i];
182 static void dohash(char *out, char *in, char *key, int forw)
184 int i, j, k;
185 char pk1[56];
186 char c[28];
187 char d[28];
188 char cd[56];
189 char ki[16][48];
190 char pd1[64];
191 char l[32], r[32];
192 char rl[64];
194 permute(pk1, key, perm1, 56);
196 for (i=0;i<28;i++)
197 c[i] = pk1[i];
198 for (i=0;i<28;i++)
199 d[i] = pk1[i+28];
201 for (i=0;i<16;i++) {
202 lshift(c, sc[i], 28);
203 lshift(d, sc[i], 28);
205 concat(cd, c, d, 28, 28);
206 permute(ki[i], cd, perm2, 48);
209 permute(pd1, in, perm3, 64);
211 for (j=0;j<32;j++) {
212 l[j] = pd1[j];
213 r[j] = pd1[j+32];
216 for (i=0;i<16;i++) {
217 char er[48];
218 char erk[48];
219 char b[8][6];
220 char cb[32];
221 char pcb[32];
222 char r2[32];
224 permute(er, r, perm4, 48);
226 xor(erk, er, ki[forw ? i : 15 - i], 48);
228 for (j=0;j<8;j++)
229 for (k=0;k<6;k++)
230 b[j][k] = erk[j*6 + k];
232 for (j=0;j<8;j++) {
233 int m, n;
234 m = (b[j][0]<<1) | b[j][5];
236 n = (b[j][1]<<3) | (b[j][2]<<2) | (b[j][3]<<1) | b[j][4];
238 for (k=0;k<4;k++)
239 b[j][k] = (sbox[j][m][n] & (1<<(3-k)))?1:0;
242 for (j=0;j<8;j++)
243 for (k=0;k<4;k++)
244 cb[j*4+k] = b[j][k];
245 permute(pcb, cb, perm5, 32);
247 xor(r2, l, pcb, 32);
249 for (j=0;j<32;j++)
250 l[j] = r[j];
252 for (j=0;j<32;j++)
253 r[j] = r2[j];
256 concat(rl, r, l, 32, 32);
258 permute(out, rl, perm6, 64);
261 /* Convert a 7 byte string to an 8 byte key. */
262 static void str_to_key(const unsigned char str[7], unsigned char key[8])
264 int i;
266 key[0] = str[0]>>1;
267 key[1] = ((str[0]&0x01)<<6) | (str[1]>>2);
268 key[2] = ((str[1]&0x03)<<5) | (str[2]>>3);
269 key[3] = ((str[2]&0x07)<<4) | (str[3]>>4);
270 key[4] = ((str[3]&0x0F)<<3) | (str[4]>>5);
271 key[5] = ((str[4]&0x1F)<<2) | (str[5]>>6);
272 key[6] = ((str[5]&0x3F)<<1) | (str[6]>>7);
273 key[7] = str[6]&0x7F;
274 for (i=0;i<8;i++) {
275 key[i] = (key[i]<<1);
280 void des_crypt56(unsigned char *out, const unsigned char *in, const unsigned char *key, int forw)
282 int i;
283 char outb[64];
284 char inb[64];
285 char keyb[64];
286 unsigned char key2[8];
288 str_to_key(key, key2);
290 for (i=0;i<64;i++) {
291 inb[i] = (in[i/8] & (1<<(7-(i%8)))) ? 1 : 0;
292 keyb[i] = (key2[i/8] & (1<<(7-(i%8)))) ? 1 : 0;
293 outb[i] = 0;
296 dohash(outb, inb, keyb, forw);
298 for (i=0;i<8;i++) {
299 out[i] = 0;
302 for (i=0;i<64;i++) {
303 if (outb[i])
304 out[i/8] |= (1<<(7-(i%8)));
308 void E_P16(const unsigned char *p14,unsigned char *p16)
310 unsigned char sp8[8] = {0x4b, 0x47, 0x53, 0x21, 0x40, 0x23, 0x24, 0x25};
311 des_crypt56(p16, sp8, p14, 1);
312 des_crypt56(p16+8, sp8, p14+7, 1);
315 void E_P24(const unsigned char *p21, const unsigned char *c8, unsigned char *p24)
317 des_crypt56(p24, c8, p21, 1);
318 des_crypt56(p24+8, c8, p21+7, 1);
319 des_crypt56(p24+16, c8, p21+14, 1);
322 void D_P16(const unsigned char *p14, const unsigned char *in, unsigned char *out)
324 des_crypt56(out, in, p14, 0);
325 des_crypt56(out+8, in+8, p14+7, 0);
328 void E_old_pw_hash( unsigned char *p14, const unsigned char *in, unsigned char *out)
330 des_crypt56(out, in, p14, 1);
331 des_crypt56(out+8, in+8, p14+7, 1);
334 /* forward des encryption with a 128 bit key */
335 void des_crypt128(unsigned char out[8], const unsigned char in[8], const unsigned char key[16])
337 unsigned char buf[8];
339 des_crypt56(buf, in, key, 1);
340 des_crypt56(out, buf, key+9, 1);
343 /* forward des encryption with a 64 bit key */
344 void des_crypt64(unsigned char out[8], const unsigned char in[8], const unsigned char key[8])
346 unsigned char buf[8];
347 unsigned char key2[8];
349 memset(key2,'\0',8);
350 des_crypt56(buf, in, key, 1);
351 key2[0] = key[7];
352 des_crypt56(out, buf, key2, 1);
355 /* des encryption with a 112 bit (14 byte) key */
356 /* Note that if the forw is 1, and key is actually 8 bytes of key, followed by 6 bytes of zeros,
357 this is identical to des_crypt64(). JRA. */
359 void des_crypt112(unsigned char out[8], const unsigned char in[8], const unsigned char key[14], int forw)
361 unsigned char buf[8];
362 des_crypt56(buf, in, key, forw);
363 des_crypt56(out, buf, key+7, forw);
366 void cred_hash3(unsigned char *out, const unsigned char *in, const unsigned char *key, int forw)
368 unsigned char key2[8];
370 memset(key2,'\0',8);
371 des_crypt56(out, in, key, forw);
372 key2[0] = key[7];
373 des_crypt56(out + 8, in + 8, key2, forw);
376 /* des encryption of a 16 byte lump of data with a 112 bit key */
377 /* Note that if the key is actually 8 bytes of key, followed by 6 bytes of zeros,
378 this is identical to cred_hash3(). JRA. */
380 void des_crypt112_16(unsigned char out[16], unsigned char in[16], const unsigned char key[14], int forw)
382 des_crypt56(out, in, key, forw);
383 des_crypt56(out + 8, in + 8, key+7, forw);
386 /*****************************************************************
387 arc4 crypt/decrypt with a 16 byte key.
388 *****************************************************************/
390 void SamOEMhash( unsigned char *data, const unsigned char key[16], size_t len)
392 unsigned char arc4_state[258];
394 smb_arc4_init(arc4_state, key, 16);
395 smb_arc4_crypt(arc4_state, data, len);
398 void SamOEMhashBlob( unsigned char *data, size_t len, DATA_BLOB *key)
400 unsigned char arc4_state[258];
402 smb_arc4_init(arc4_state, key->data, key->length);
403 smb_arc4_crypt(arc4_state, data, len);
406 /* Decode a sam password hash into a password. The password hash is the
407 same method used to store passwords in the NT registry. The DES key
408 used is based on the RID of the user. */
410 void sam_pwd_hash(unsigned int rid, const uchar *in, uchar *out, int forw)
412 uchar s[14];
414 s[0] = s[4] = s[8] = s[12] = (uchar)(rid & 0xFF);
415 s[1] = s[5] = s[9] = s[13] = (uchar)((rid >> 8) & 0xFF);
416 s[2] = s[6] = s[10] = (uchar)((rid >> 16) & 0xFF);
417 s[3] = s[7] = s[11] = (uchar)((rid >> 24) & 0xFF);
419 des_crypt56(out, in, s, forw);
420 des_crypt56(out+8, in+8, s+7, forw);