1 : /*
2 : $Id: crypt_freesec.c 265467 2008-08-25 13:42:46Z jani $
3 : */
4 : /*
5 : * This version is derived from the original implementation of FreeSec
6 : * (release 1.1) by David Burren. I've reviewed the changes made in
7 : * OpenBSD (as of 2.7) and modified the original code in a similar way
8 : * where applicable. I've also made it reentrant and did a number of
9 : * other changes -- SD.
10 : */
11 :
12 : /*
13 : * FreeSec: libcrypt for NetBSD
14 : *
15 : * Copyright (c) 1994 David Burren
16 : * All rights reserved.
17 : *
18 : * Redistribution and use in source and binary forms, with or without
19 : * modification, are permitted provided that the following conditions
20 : * are met:
21 : * 1. Redistributions of source code must retain the above copyright
22 : * notice, this list of conditions and the following disclaimer.
23 : * 2. Redistributions in binary form must reproduce the above copyright
24 : * notice, this list of conditions and the following disclaimer in the
25 : * documentation and/or other materials provided with the distribution.
26 : * 3. Neither the name of the author nor the names of other contributors
27 : * may be used to endorse or promote products derived from this software
28 : * without specific prior written permission.
29 : *
30 : * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
31 : * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 : * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 : * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
34 : * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 : * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 : * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 : * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 : * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 : * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 : * SUCH DAMAGE.
41 : *
42 : * $Owl: Owl/packages/glibc/crypt_freesec.c,v 1.4 2005/11/16 13:08:32 solar Exp $
43 : * $Id: crypt_freesec.c 265467 2008-08-25 13:42:46Z jani $
44 : *
45 : * This is an original implementation of the DES and the crypt(3) interfaces
46 : * by David Burren <davidb at werj.com.au>.
47 : *
48 : * An excellent reference on the underlying algorithm (and related
49 : * algorithms) is:
50 : *
51 : * B. Schneier, Applied Cryptography: protocols, algorithms,
52 : * and source code in C, John Wiley & Sons, 1994.
53 : *
54 : * Note that in that book's description of DES the lookups for the initial,
55 : * pbox, and final permutations are inverted (this has been brought to the
56 : * attention of the author). A list of errata for this book has been
57 : * posted to the sci.crypt newsgroup by the author and is available for FTP.
58 : *
59 : * ARCHITECTURE ASSUMPTIONS:
60 : * This code used to have some nasty ones, but I believe these have
61 : * been removed by now. The code isn't very portable and requires a
62 : * 32-bit integer type, though -- SD.
63 : */
64 :
65 : #include <sys/types.h>
66 : #include <string.h>
67 :
68 : #include "crypt_freesec.h"
69 :
70 : #define _PASSWORD_EFMT1 '_'
71 :
72 : static u_char IP[64] = {
73 : 58, 50, 42, 34, 26, 18, 10, 2, 60, 52, 44, 36, 28, 20, 12, 4,
74 : 62, 54, 46, 38, 30, 22, 14, 6, 64, 56, 48, 40, 32, 24, 16, 8,
75 : 57, 49, 41, 33, 25, 17, 9, 1, 59, 51, 43, 35, 27, 19, 11, 3,
76 : 61, 53, 45, 37, 29, 21, 13, 5, 63, 55, 47, 39, 31, 23, 15, 7
77 : };
78 :
79 : static u_char key_perm[56] = {
80 : 57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18,
81 : 10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36,
82 : 63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22,
83 : 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4
84 : };
85 :
86 : static u_char key_shifts[16] = {
87 : 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
88 : };
89 :
90 : static u_char comp_perm[48] = {
91 : 14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10,
92 : 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2,
93 : 41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48,
94 : 44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32
95 : };
96 :
97 : /*
98 : * No E box is used, as it's replaced by some ANDs, shifts, and ORs.
99 : */
100 :
101 : static u_char sbox[8][64] = {
102 : {
103 : 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
104 : 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
105 : 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
106 : 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13
107 : },
108 : {
109 : 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
110 : 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5,
111 : 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
112 : 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9
113 : },
114 : {
115 : 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
116 : 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
117 : 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
118 : 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12
119 : },
120 : {
121 : 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
122 : 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
123 : 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
124 : 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14
125 : },
126 : {
127 : 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
128 : 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
129 : 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
130 : 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3
131 : },
132 : {
133 : 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
134 : 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
135 : 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
136 : 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13
137 : },
138 : {
139 : 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
140 : 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
141 : 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
142 : 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12
143 : },
144 : {
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
149 : }
150 : };
151 :
152 : static u_char pbox[32] = {
153 : 16, 7, 20, 21, 29, 12, 28, 17, 1, 15, 23, 26, 5, 18, 31, 10,
154 : 2, 8, 24, 14, 32, 27, 3, 9, 19, 13, 30, 6, 22, 11, 4, 25
155 : };
156 :
157 : static uint32_t bits32[32] =
158 : {
159 : 0x80000000, 0x40000000, 0x20000000, 0x10000000,
160 : 0x08000000, 0x04000000, 0x02000000, 0x01000000,
161 : 0x00800000, 0x00400000, 0x00200000, 0x00100000,
162 : 0x00080000, 0x00040000, 0x00020000, 0x00010000,
163 : 0x00008000, 0x00004000, 0x00002000, 0x00001000,
164 : 0x00000800, 0x00000400, 0x00000200, 0x00000100,
165 : 0x00000080, 0x00000040, 0x00000020, 0x00000010,
166 : 0x00000008, 0x00000004, 0x00000002, 0x00000001
167 : };
168 :
169 : static u_char bits8[8] = { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 };
170 :
171 : static unsigned char ascii64[] =
172 : "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
173 : /* 0000000000111111111122222222223333333333444444444455555555556666 */
174 : /* 0123456789012345678901234567890123456789012345678901234567890123 */
175 :
176 : static u_char m_sbox[4][4096];
177 : static uint32_t psbox[4][256];
178 : static uint32_t ip_maskl[8][256], ip_maskr[8][256];
179 : static uint32_t fp_maskl[8][256], fp_maskr[8][256];
180 : static uint32_t key_perm_maskl[8][128], key_perm_maskr[8][128];
181 : static uint32_t comp_maskl[8][128], comp_maskr[8][128];
182 :
183 : static inline int
184 : ascii_to_bin(char ch)
185 10 : {
186 10 : if (ch > 'z')
187 0 : return(0);
188 10 : if (ch >= 'a')
189 6 : return(ch - 'a' + 38);
190 4 : if (ch > 'Z')
191 0 : return(0);
192 4 : if (ch >= 'A')
193 1 : return(ch - 'A' + 12);
194 3 : if (ch > '9')
195 0 : return(0);
196 3 : if (ch >= '.')
197 3 : return(ch - '.');
198 0 : return(0);
199 : }
200 :
201 : void
202 : _crypt_extended_init(void)
203 1 : {
204 : int i, j, b, k, inbit, obit;
205 : uint32_t *p, *il, *ir, *fl, *fr;
206 : uint32_t *bits28, *bits24;
207 : u_char inv_key_perm[64];
208 : u_char u_key_perm[56];
209 : u_char inv_comp_perm[56];
210 : u_char init_perm[64], final_perm[64];
211 : u_char u_sbox[8][64];
212 : u_char un_pbox[32];
213 :
214 1 : bits24 = (bits28 = bits32 + 4) + 4;
215 :
216 : /*
217 : * Invert the S-boxes, reordering the input bits.
218 : */
219 9 : for (i = 0; i < 8; i++)
220 520 : for (j = 0; j < 64; j++) {
221 512 : b = (j & 0x20) | ((j & 1) << 4) | ((j >> 1) & 0xf);
222 512 : u_sbox[i][j] = sbox[i][b];
223 : }
224 :
225 : /*
226 : * Convert the inverted S-boxes into 4 arrays of 8 bits.
227 : * Each will handle 12 bits of the S-box input.
228 : */
229 5 : for (b = 0; b < 4; b++)
230 260 : for (i = 0; i < 64; i++)
231 16640 : for (j = 0; j < 64; j++)
232 16384 : m_sbox[b][(i << 6) | j] =
233 : (u_sbox[(b << 1)][i] << 4) |
234 : u_sbox[(b << 1) + 1][j];
235 :
236 : /*
237 : * Set up the initial & final permutations into a useful form, and
238 : * initialise the inverted key permutation.
239 : */
240 65 : for (i = 0; i < 64; i++) {
241 64 : init_perm[final_perm[i] = IP[i] - 1] = i;
242 64 : inv_key_perm[i] = 255;
243 : }
244 :
245 : /*
246 : * Invert the key permutation and initialise the inverted key
247 : * compression permutation.
248 : */
249 57 : for (i = 0; i < 56; i++) {
250 56 : u_key_perm[i] = key_perm[i] - 1;
251 56 : inv_key_perm[key_perm[i] - 1] = i;
252 56 : inv_comp_perm[i] = 255;
253 : }
254 :
255 : /*
256 : * Invert the key compression permutation.
257 : */
258 49 : for (i = 0; i < 48; i++) {
259 48 : inv_comp_perm[comp_perm[i] - 1] = i;
260 : }
261 :
262 : /*
263 : * Set up the OR-mask arrays for the initial and final permutations,
264 : * and for the key initial and compression permutations.
265 : */
266 9 : for (k = 0; k < 8; k++) {
267 2056 : for (i = 0; i < 256; i++) {
268 2048 : *(il = &ip_maskl[k][i]) = 0;
269 2048 : *(ir = &ip_maskr[k][i]) = 0;
270 2048 : *(fl = &fp_maskl[k][i]) = 0;
271 2048 : *(fr = &fp_maskr[k][i]) = 0;
272 18432 : for (j = 0; j < 8; j++) {
273 16384 : inbit = 8 * k + j;
274 16384 : if (i & bits8[j]) {
275 8192 : if ((obit = init_perm[inbit]) < 32)
276 4096 : *il |= bits32[obit];
277 : else
278 4096 : *ir |= bits32[obit-32];
279 8192 : if ((obit = final_perm[inbit]) < 32)
280 4096 : *fl |= bits32[obit];
281 : else
282 4096 : *fr |= bits32[obit - 32];
283 : }
284 : }
285 : }
286 1032 : for (i = 0; i < 128; i++) {
287 1024 : *(il = &key_perm_maskl[k][i]) = 0;
288 1024 : *(ir = &key_perm_maskr[k][i]) = 0;
289 8192 : for (j = 0; j < 7; j++) {
290 7168 : inbit = 8 * k + j;
291 7168 : if (i & bits8[j + 1]) {
292 3584 : if ((obit = inv_key_perm[inbit]) == 255)
293 0 : continue;
294 3584 : if (obit < 28)
295 1792 : *il |= bits28[obit];
296 : else
297 1792 : *ir |= bits28[obit - 28];
298 : }
299 : }
300 1024 : *(il = &comp_maskl[k][i]) = 0;
301 1024 : *(ir = &comp_maskr[k][i]) = 0;
302 8192 : for (j = 0; j < 7; j++) {
303 7168 : inbit = 7 * k + j;
304 7168 : if (i & bits8[j + 1]) {
305 3584 : if ((obit=inv_comp_perm[inbit]) == 255)
306 512 : continue;
307 3072 : if (obit < 24)
308 1536 : *il |= bits24[obit];
309 : else
310 1536 : *ir |= bits24[obit - 24];
311 : }
312 : }
313 : }
314 : }
315 :
316 : /*
317 : * Invert the P-box permutation, and convert into OR-masks for
318 : * handling the output of the S-box arrays setup above.
319 : */
320 33 : for (i = 0; i < 32; i++)
321 32 : un_pbox[pbox[i] - 1] = i;
322 :
323 5 : for (b = 0; b < 4; b++)
324 1028 : for (i = 0; i < 256; i++) {
325 1024 : *(p = &psbox[b][i]) = 0;
326 9216 : for (j = 0; j < 8; j++) {
327 8192 : if (i & bits8[j])
328 4096 : *p |= bits32[un_pbox[8 * b + j]];
329 : }
330 : }
331 1 : }
332 :
333 : static void
334 : des_init_local(struct php_crypt_extended_data *data)
335 2 : {
336 2 : data->old_rawkey0 = data->old_rawkey1 = 0;
337 2 : data->saltbits = 0;
338 2 : data->old_salt = 0;
339 :
340 2 : data->initialized = 1;
341 2 : }
342 :
343 : static void
344 : setup_salt(uint32_t salt, struct php_crypt_extended_data *data)
345 3 : {
346 : uint32_t obit, saltbit, saltbits;
347 : int i;
348 :
349 3 : if (salt == data->old_salt)
350 1 : return;
351 2 : data->old_salt = salt;
352 :
353 2 : saltbits = 0;
354 2 : saltbit = 1;
355 2 : obit = 0x800000;
356 50 : for (i = 0; i < 24; i++) {
357 48 : if (salt & saltbit)
358 22 : saltbits |= obit;
359 48 : saltbit <<= 1;
360 48 : obit >>= 1;
361 : }
362 2 : data->saltbits = saltbits;
363 : }
364 :
365 : static int
366 : des_setkey(const char *key, struct php_crypt_extended_data *data)
367 3 : {
368 : uint32_t k0, k1, rawkey0, rawkey1;
369 : int shifts, round;
370 :
371 3 : rawkey0 =
372 : (uint32_t)(u_char)key[3] |
373 : ((uint32_t)(u_char)key[2] << 8) |
374 : ((uint32_t)(u_char)key[1] << 16) |
375 : ((uint32_t)(u_char)key[0] << 24);
376 3 : rawkey1 =
377 : (uint32_t)(u_char)key[7] |
378 : ((uint32_t)(u_char)key[6] << 8) |
379 : ((uint32_t)(u_char)key[5] << 16) |
380 : ((uint32_t)(u_char)key[4] << 24);
381 :
382 3 : if ((rawkey0 | rawkey1)
383 : && rawkey0 == data->old_rawkey0
384 : && rawkey1 == data->old_rawkey1) {
385 : /*
386 : * Already setup for this key.
387 : * This optimisation fails on a zero key (which is weak and
388 : * has bad parity anyway) in order to simplify the starting
389 : * conditions.
390 : */
391 0 : return(0);
392 : }
393 3 : data->old_rawkey0 = rawkey0;
394 3 : data->old_rawkey1 = rawkey1;
395 :
396 : /*
397 : * Do key permutation and split into two 28-bit subkeys.
398 : */
399 3 : k0 = key_perm_maskl[0][rawkey0 >> 25]
400 : | key_perm_maskl[1][(rawkey0 >> 17) & 0x7f]
401 : | key_perm_maskl[2][(rawkey0 >> 9) & 0x7f]
402 : | key_perm_maskl[3][(rawkey0 >> 1) & 0x7f]
403 : | key_perm_maskl[4][rawkey1 >> 25]
404 : | key_perm_maskl[5][(rawkey1 >> 17) & 0x7f]
405 : | key_perm_maskl[6][(rawkey1 >> 9) & 0x7f]
406 : | key_perm_maskl[7][(rawkey1 >> 1) & 0x7f];
407 3 : k1 = key_perm_maskr[0][rawkey0 >> 25]
408 : | key_perm_maskr[1][(rawkey0 >> 17) & 0x7f]
409 : | key_perm_maskr[2][(rawkey0 >> 9) & 0x7f]
410 : | key_perm_maskr[3][(rawkey0 >> 1) & 0x7f]
411 : | key_perm_maskr[4][rawkey1 >> 25]
412 : | key_perm_maskr[5][(rawkey1 >> 17) & 0x7f]
413 : | key_perm_maskr[6][(rawkey1 >> 9) & 0x7f]
414 : | key_perm_maskr[7][(rawkey1 >> 1) & 0x7f];
415 : /*
416 : * Rotate subkeys and do compression permutation.
417 : */
418 3 : shifts = 0;
419 51 : for (round = 0; round < 16; round++) {
420 : uint32_t t0, t1;
421 :
422 48 : shifts += key_shifts[round];
423 :
424 48 : t0 = (k0 << shifts) | (k0 >> (28 - shifts));
425 48 : t1 = (k1 << shifts) | (k1 >> (28 - shifts));
426 :
427 48 : data->de_keysl[15 - round] =
428 : data->en_keysl[round] = comp_maskl[0][(t0 >> 21) & 0x7f]
429 : | comp_maskl[1][(t0 >> 14) & 0x7f]
430 : | comp_maskl[2][(t0 >> 7) & 0x7f]
431 : | comp_maskl[3][t0 & 0x7f]
432 : | comp_maskl[4][(t1 >> 21) & 0x7f]
433 : | comp_maskl[5][(t1 >> 14) & 0x7f]
434 : | comp_maskl[6][(t1 >> 7) & 0x7f]
435 : | comp_maskl[7][t1 & 0x7f];
436 :
437 48 : data->de_keysr[15 - round] =
438 : data->en_keysr[round] = comp_maskr[0][(t0 >> 21) & 0x7f]
439 : | comp_maskr[1][(t0 >> 14) & 0x7f]
440 : | comp_maskr[2][(t0 >> 7) & 0x7f]
441 : | comp_maskr[3][t0 & 0x7f]
442 : | comp_maskr[4][(t1 >> 21) & 0x7f]
443 : | comp_maskr[5][(t1 >> 14) & 0x7f]
444 : | comp_maskr[6][(t1 >> 7) & 0x7f]
445 : | comp_maskr[7][t1 & 0x7f];
446 : }
447 3 : return(0);
448 : }
449 :
450 : static int
451 : do_des(uint32_t l_in, uint32_t r_in, uint32_t *l_out, uint32_t *r_out,
452 : int count, struct php_crypt_extended_data *data)
453 3 : {
454 : /*
455 : * l_in, r_in, l_out, and r_out are in pseudo-"big-endian" format.
456 : */
457 : uint32_t l, r, *kl, *kr, *kl1, *kr1;
458 : uint32_t f, r48l, r48r, saltbits;
459 : int round;
460 :
461 3 : if (count == 0) {
462 0 : return(1);
463 3 : } else if (count > 0) {
464 : /*
465 : * Encrypting
466 : */
467 3 : kl1 = data->en_keysl;
468 3 : kr1 = data->en_keysr;
469 : } else {
470 : /*
471 : * Decrypting
472 : */
473 0 : count = -count;
474 0 : kl1 = data->de_keysl;
475 0 : kr1 = data->de_keysr;
476 : }
477 :
478 : /*
479 : * Do initial permutation (IP).
480 : */
481 3 : l = ip_maskl[0][l_in >> 24]
482 : | ip_maskl[1][(l_in >> 16) & 0xff]
483 : | ip_maskl[2][(l_in >> 8) & 0xff]
484 : | ip_maskl[3][l_in & 0xff]
485 : | ip_maskl[4][r_in >> 24]
486 : | ip_maskl[5][(r_in >> 16) & 0xff]
487 : | ip_maskl[6][(r_in >> 8) & 0xff]
488 : | ip_maskl[7][r_in & 0xff];
489 3 : r = ip_maskr[0][l_in >> 24]
490 : | ip_maskr[1][(l_in >> 16) & 0xff]
491 : | ip_maskr[2][(l_in >> 8) & 0xff]
492 : | ip_maskr[3][l_in & 0xff]
493 : | ip_maskr[4][r_in >> 24]
494 : | ip_maskr[5][(r_in >> 16) & 0xff]
495 : | ip_maskr[6][(r_in >> 8) & 0xff]
496 : | ip_maskr[7][r_in & 0xff];
497 :
498 3 : saltbits = data->saltbits;
499 757 : while (count--) {
500 : /*
501 : * Do each round.
502 : */
503 751 : kl = kl1;
504 751 : kr = kr1;
505 751 : round = 16;
506 13518 : while (round--) {
507 : /*
508 : * Expand R to 48 bits (simulate the E-box).
509 : */
510 12016 : r48l = ((r & 0x00000001) << 23)
511 : | ((r & 0xf8000000) >> 9)
512 : | ((r & 0x1f800000) >> 11)
513 : | ((r & 0x01f80000) >> 13)
514 : | ((r & 0x001f8000) >> 15);
515 :
516 12016 : r48r = ((r & 0x0001f800) << 7)
517 : | ((r & 0x00001f80) << 5)
518 : | ((r & 0x000001f8) << 3)
519 : | ((r & 0x0000001f) << 1)
520 : | ((r & 0x80000000) >> 31);
521 : /*
522 : * Do salting for crypt() and friends, and
523 : * XOR with the permuted key.
524 : */
525 12016 : f = (r48l ^ r48r) & saltbits;
526 12016 : r48l ^= f ^ *kl++;
527 12016 : r48r ^= f ^ *kr++;
528 : /*
529 : * Do sbox lookups (which shrink it back to 32 bits)
530 : * and do the pbox permutation at the same time.
531 : */
532 12016 : f = psbox[0][m_sbox[0][r48l >> 12]]
533 : | psbox[1][m_sbox[1][r48l & 0xfff]]
534 : | psbox[2][m_sbox[2][r48r >> 12]]
535 : | psbox[3][m_sbox[3][r48r & 0xfff]];
536 : /*
537 : * Now that we've permuted things, complete f().
538 : */
539 12016 : f ^= l;
540 12016 : l = r;
541 12016 : r = f;
542 : }
543 751 : r = l;
544 751 : l = f;
545 : }
546 : /*
547 : * Do final permutation (inverse of IP).
548 : */
549 3 : *l_out = fp_maskl[0][l >> 24]
550 : | fp_maskl[1][(l >> 16) & 0xff]
551 : | fp_maskl[2][(l >> 8) & 0xff]
552 : | fp_maskl[3][l & 0xff]
553 : | fp_maskl[4][r >> 24]
554 : | fp_maskl[5][(r >> 16) & 0xff]
555 : | fp_maskl[6][(r >> 8) & 0xff]
556 : | fp_maskl[7][r & 0xff];
557 3 : *r_out = fp_maskr[0][l >> 24]
558 : | fp_maskr[1][(l >> 16) & 0xff]
559 : | fp_maskr[2][(l >> 8) & 0xff]
560 : | fp_maskr[3][l & 0xff]
561 : | fp_maskr[4][r >> 24]
562 : | fp_maskr[5][(r >> 16) & 0xff]
563 : | fp_maskr[6][(r >> 8) & 0xff]
564 : | fp_maskr[7][r & 0xff];
565 3 : return(0);
566 : }
567 :
568 : static int
569 : des_cipher(const char *in, char *out, uint32_t salt, int count,
570 : struct php_crypt_extended_data *data)
571 1 : {
572 : uint32_t l_out, r_out, rawl, rawr;
573 : int retval;
574 :
575 1 : setup_salt(salt, data);
576 :
577 1 : rawl =
578 : (uint32_t)(u_char)in[3] |
579 : ((uint32_t)(u_char)in[2] << 8) |
580 : ((uint32_t)(u_char)in[1] << 16) |
581 : ((uint32_t)(u_char)in[0] << 24);
582 1 : rawr =
583 : (uint32_t)(u_char)in[7] |
584 : ((uint32_t)(u_char)in[6] << 8) |
585 : ((uint32_t)(u_char)in[5] << 16) |
586 : ((uint32_t)(u_char)in[4] << 24);
587 :
588 1 : retval = do_des(rawl, rawr, &l_out, &r_out, count, data);
589 :
590 1 : out[0] = l_out >> 24;
591 1 : out[1] = l_out >> 16;
592 1 : out[2] = l_out >> 8;
593 1 : out[3] = l_out;
594 1 : out[4] = r_out >> 24;
595 1 : out[5] = r_out >> 16;
596 1 : out[6] = r_out >> 8;
597 1 : out[7] = r_out;
598 :
599 1 : return(retval);
600 : }
601 :
602 : char *
603 : _crypt_extended_r(const char *key, const char *setting,
604 : struct php_crypt_extended_data *data)
605 2 : {
606 : int i;
607 : uint32_t count, salt, l, r0, r1, keybuf[2];
608 : u_char *p, *q;
609 :
610 2 : if (!data->initialized)
611 2 : des_init_local(data);
612 :
613 : /*
614 : * Copy the key, shifting each character up by one bit
615 : * and padding with zeros.
616 : */
617 2 : q = (u_char *) keybuf;
618 20 : while (q - (u_char *) keybuf < sizeof(keybuf)) {
619 16 : if ((*q++ = *key << 1))
620 16 : key++;
621 : }
622 2 : if (des_setkey((u_char *) keybuf, data))
623 0 : return(NULL);
624 :
625 2 : if (*setting == _PASSWORD_EFMT1) {
626 : /*
627 : * "new"-style:
628 : * setting - underscore, 4 bytes of count, 4 bytes of salt
629 : * key - unlimited characters
630 : */
631 5 : for (i = 1, count = 0; i < 5; i++)
632 4 : count |= ascii_to_bin(setting[i]) << (i - 1) * 6;
633 :
634 5 : for (i = 5, salt = 0; i < 9; i++)
635 4 : salt |= ascii_to_bin(setting[i]) << (i - 5) * 6;
636 :
637 3 : while (*key) {
638 : /*
639 : * Encrypt the key with itself.
640 : */
641 1 : if (des_cipher((u_char *) keybuf, (u_char *) keybuf,
642 : 0, 1, data))
643 0 : return(NULL);
644 : /*
645 : * And XOR with the next 8 characters of the key.
646 : */
647 1 : q = (u_char *) keybuf;
648 7 : while (q - (u_char *) keybuf < sizeof(keybuf) && *key)
649 5 : *q++ ^= *key++ << 1;
650 :
651 1 : if (des_setkey((u_char *) keybuf, data))
652 0 : return(NULL);
653 : }
654 1 : strncpy(data->output, setting, 9);
655 : /*
656 : * Double check that we weren't given a short setting.
657 : * If we were, the above code will probably have created
658 : * wierd values for count and salt, but we don't really care.
659 : * Just make sure the output string doesn't have an extra
660 : * NUL in it.
661 : */
662 1 : data->output[9] = '\0';
663 1 : p = (u_char *) data->output + strlen(data->output);
664 : } else {
665 : /*
666 : * "old"-style:
667 : * setting - 2 bytes of salt
668 : * key - up to 8 characters
669 : */
670 1 : count = 25;
671 :
672 1 : salt = (ascii_to_bin(setting[1]) << 6)
673 : | ascii_to_bin(setting[0]);
674 :
675 1 : data->output[0] = setting[0];
676 : /*
677 : * If the encrypted password that the salt was extracted from
678 : * is only 1 character long, the salt will be corrupted. We
679 : * need to ensure that the output string doesn't have an extra
680 : * NUL in it!
681 : */
682 1 : data->output[1] = setting[1] ? setting[1] : data->output[0];
683 1 : p = (u_char *) data->output + 2;
684 : }
685 2 : setup_salt(salt, data);
686 : /*
687 : * Do it.
688 : */
689 2 : if (do_des(0, 0, &r0, &r1, count, data))
690 0 : return(NULL);
691 : /*
692 : * Now encode the result...
693 : */
694 2 : l = (r0 >> 8);
695 2 : *p++ = ascii64[(l >> 18) & 0x3f];
696 2 : *p++ = ascii64[(l >> 12) & 0x3f];
697 2 : *p++ = ascii64[(l >> 6) & 0x3f];
698 2 : *p++ = ascii64[l & 0x3f];
699 :
700 2 : l = (r0 << 16) | ((r1 >> 16) & 0xffff);
701 2 : *p++ = ascii64[(l >> 18) & 0x3f];
702 2 : *p++ = ascii64[(l >> 12) & 0x3f];
703 2 : *p++ = ascii64[(l >> 6) & 0x3f];
704 2 : *p++ = ascii64[l & 0x3f];
705 :
706 2 : l = r1 << 2;
707 2 : *p++ = ascii64[(l >> 12) & 0x3f];
708 2 : *p++ = ascii64[(l >> 6) & 0x3f];
709 2 : *p++ = ascii64[l & 0x3f];
710 2 : *p = 0;
711 :
712 2 : return(data->output);
713 : }
714 :
715 : #ifdef TEST
716 : static char *
717 : _crypt_extended(const char *key, const char *setting)
718 : {
719 : static int initialized = 0;
720 : static struct php_crypt_extended_data data;
721 :
722 : if (!initialized) {
723 : _crypt_extended_init();
724 : initialized = 1;
725 : data.initialized = 0;
726 : }
727 : return _crypt_extended_r(key, setting, &data);
728 : }
729 :
730 : #define crypt _crypt_extended
731 :
732 : static struct {
733 : char *hash;
734 : char *pw;
735 : } tests[] = {
736 : {"_J9..CCCCXBrJUJV154M", "U*U*U*U*"},
737 : {"_J9..CCCCXUhOBTXzaiE", "U*U***U"},
738 : {"_J9..CCCC4gQ.mB/PffM", "U*U***U*"},
739 : {"_J9..XXXXvlzQGqpPPdk", "*U*U*U*U"},
740 : {"_J9..XXXXsqM/YSSP..Y", "*U*U*U*U*"},
741 : {"_J9..XXXXVL7qJCnku0I", "*U*U*U*U*U*U*U*U"},
742 : {"_J9..XXXXAj8cFbP5scI", "*U*U*U*U*U*U*U*U*"},
743 : {"_J9..SDizh.vll5VED9g", "ab1234567"},
744 : {"_J9..SDizRjWQ/zePPHc", "cr1234567"},
745 : {"_J9..SDizxmRI1GjnQuE", "zxyDPWgydbQjgq"},
746 : {"_K9..SaltNrQgIYUAeoY", "726 even"},
747 : {"_J9..SDSD5YGyRCr4W4c", ""},
748 : {NULL}
749 : };
750 :
751 : int main(void)
752 : {
753 : int i;
754 :
755 : for (i = 0; tests[i].hash; i++)
756 : if (strcmp(crypt(tests[i].pw, tests[i].hash), tests[i].hash)) {
757 : puts("FAILED");
758 : return 1;
759 : }
760 :
761 : puts("PASSED");
762 :
763 : return 0;
764 : }
765 : #endif
|
