Mercurial > hg > early-roguelike

comparison srogue/xcrypt.c @ 36:2128c7dc8a40

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
Import Super-Rogue 9.0 from the Roguelike Restoration Project (r1490)
author elwin
date Thu, 25 Nov 2010 12:21:41 +0000
parents
children 458df24e973d
comparison
equal deleted inserted replaced
35:05018c63a721 36:2128c7dc8a40
1 /*
2 * FreeSec: libcrypt
3 *
4 * Copyright (C) 1994 David Burren
5 * All rights reserved.
6 *
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted provided that the following conditions
9 * are met:
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
12 * 2. Redistributions in binary form must reproduce the above copyright
13 * notice, this list of conditions and the following disclaimer in the
14 * documentation and/or other materials provided with the distribution.
15 * 3. Neither the name(s) of the author(s) nor the names of other contributors
16 * may be used to endorse or promote products derived from this software
17 * without specific prior written permission.
18 *
19 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR(S) AND CONTRIBUTORS ``AS IS'' AND
20 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
21 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
22 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR(S) OR CONTRIBUTORS BE LIABLE
23 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
24 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
25 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
26 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
27 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
28 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 * SUCH DAMAGE.
30 *
31 *
32 * This is an original implementation of the DES and the crypt(3) interfaces
33 * by David Burren <davidb@werj.com.au>.
34 *
35 * An excellent reference on the underlying algorithm (and related
36 * algorithms) is:
37 *
38 * B. Schneier, Applied Cryptography: protocols, algorithms,
39 * and source code in C, John Wiley & Sons, 1994.
40 *
41 * Note that in that book's description of DES the lookups for the initial,
42 * pbox, and final permutations are inverted (this has been brought to the
43 * attention of the author). A list of errata for this book has been
44 * posted to the sci.crypt newsgroup by the author and is available for FTP.
45 *
46 * NOTE:
47 * This file has a static version of des_setkey() so that crypt.o exports
48 * only the crypt() interface. This is required to make binaries linked
49 * against crypt.o exportable or re-exportable from the USA.
50 */
51
52 #include <sys/types.h>
53 #include <sys/param.h>
54 #include <pwd.h>
55 #include <string.h>
56
57 #ifdef DEBUG
58 # include <stdio.h>
59 #endif
60 #define _PASSWORD_EFMT1 '_'
61
62 static unsigned char IP[64] = {
63 58, 50, 42, 34, 26, 18, 10, 2, 60, 52, 44, 36, 28, 20, 12, 4,
64 62, 54, 46, 38, 30, 22, 14, 6, 64, 56, 48, 40, 32, 24, 16, 8,
65 57, 49, 41, 33, 25, 17, 9, 1, 59, 51, 43, 35, 27, 19, 11, 3,
66 61, 53, 45, 37, 29, 21, 13, 5, 63, 55, 47, 39, 31, 23, 15, 7
67 };
68
69 static unsigned char inv_key_perm[64];
70 static unsigned char key_perm[56] = {
71 57, 49, 41, 33, 25, 17, 9, 1, 58, 50, 42, 34, 26, 18,
72 10, 2, 59, 51, 43, 35, 27, 19, 11, 3, 60, 52, 44, 36,
73 63, 55, 47, 39, 31, 23, 15, 7, 62, 54, 46, 38, 30, 22,
74 14, 6, 61, 53, 45, 37, 29, 21, 13, 5, 28, 20, 12, 4
75 };
76
77 static unsigned char key_shifts[16] = {
78 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1
79 };
80
81 static unsigned char inv_comp_perm[56];
82 static unsigned char comp_perm[48] = {
83 14, 17, 11, 24, 1, 5, 3, 28, 15, 6, 21, 10,
84 23, 19, 12, 4, 26, 8, 16, 7, 27, 20, 13, 2,
85 41, 52, 31, 37, 47, 55, 30, 40, 51, 45, 33, 48,
86 44, 49, 39, 56, 34, 53, 46, 42, 50, 36, 29, 32
87 };
88
89 /*
90 * No E box is used, as it's replaced by some ANDs, shifts, and ORs.
91 */
92
93 static unsigned char u_sbox[8][64];
94 static unsigned char sbox[8][64] = {
95 {
96 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
97 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
98 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
99 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13
100 },
101 {
102 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
103 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5,
104 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
105 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9
106 },
107 {
108 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
109 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
110 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
111 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12
112 },
113 {
114 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
115 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
116 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
117 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14
118 },
119 {
120 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
121 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
122 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
123 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3
124 },
125 {
126 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
127 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
128 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
129 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13
130 },
131 {
132 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
133 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
134 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
135 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12
136 },
137 {
138 13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7,
139 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2,
140 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8,
141 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11
142 }
143 };
144
145 static unsigned char un_pbox[32];
146 static unsigned char pbox[32] = {
147 16, 7, 20, 21, 29, 12, 28, 17, 1, 15, 23, 26, 5, 18, 31, 10,
148 2, 8, 24, 14, 32, 27, 3, 9, 19, 13, 30, 6, 22, 11, 4, 25
149 };
150
151 static unsigned int bits32[32] =
152 {
153 0x80000000, 0x40000000, 0x20000000, 0x10000000,
154 0x08000000, 0x04000000, 0x02000000, 0x01000000,
155 0x00800000, 0x00400000, 0x00200000, 0x00100000,
156 0x00080000, 0x00040000, 0x00020000, 0x00010000,
157 0x00008000, 0x00004000, 0x00002000, 0x00001000,
158 0x00000800, 0x00000400, 0x00000200, 0x00000100,
159 0x00000080, 0x00000040, 0x00000020, 0x00000010,
160 0x00000008, 0x00000004, 0x00000002, 0x00000001
161 };
162
163 static unsigned char bits8[8] = { 0x80, 0x40, 0x20, 0x10, 0x08, 0x04, 0x02, 0x01 };
164
165 static unsigned int saltbits;
166 static int old_salt;
167 static unsigned int *bits28, *bits24;
168 static unsigned char init_perm[64], final_perm[64];
169 static unsigned int en_keysl[16], en_keysr[16];
170 static unsigned int de_keysl[16], de_keysr[16];
171 static int des_initialised = 0;
172 static unsigned char m_sbox[4][4096];
173 static unsigned int psbox[4][256];
174 static unsigned int ip_maskl[8][256], ip_maskr[8][256];
175 static unsigned int fp_maskl[8][256], fp_maskr[8][256];
176 static unsigned int key_perm_maskl[8][128], key_perm_maskr[8][128];
177 static unsigned int comp_maskl[8][128], comp_maskr[8][128];
178 static unsigned int old_rawkey0, old_rawkey1;
179
180 static unsigned char ascii64[] =
181 "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
182 /* 0000000000111111111122222222223333333333444444444455555555556666 */
183 /* 0123456789012345678901234567890123456789012345678901234567890123 */
184
185 static __inline int
186 ascii_to_bin(ch)
187 char ch;
188 {
189 if (ch > 'z')
190 return(0);
191 if (ch >= 'a')
192 return(ch - 'a' + 38);
193 if (ch > 'Z')
194 return(0);
195 if (ch >= 'A')
196 return(ch - 'A' + 12);
197 if (ch > '9')
198 return(0);
199 if (ch >= '.')
200 return(ch - '.');
201 return(0);
202 }
203
204 static void
205 des_init()
206 {
207 int i, j, b, k, inbit, obit;
208 unsigned int *p, *il, *ir, *fl, *fr;
209
210 old_rawkey0 = old_rawkey1 = 0;
211 saltbits = 0;
212 old_salt = 0;
213 bits24 = (bits28 = bits32 + 4) + 4;
214
215 /*
216 * Invert the S-boxes, reordering the input bits.
217 */
218 for (i = 0; i < 8; i++)
219 for (j = 0; j < 64; j++) {
220 b = (j & 0x20) | ((j & 1) << 4) | ((j >> 1) & 0xf);
221 u_sbox[i][j] = sbox[i][b];
222 }
223
224 /*
225 * Convert the inverted S-boxes into 4 arrays of 8 bits.
226 * Each will handle 12 bits of the S-box input.
227 */
228 for (b = 0; b < 4; b++)
229 for (i = 0; i < 64; i++)
230 for (j = 0; j < 64; j++)
231 m_sbox[b][(i << 6) | j] =
232 (u_sbox[(b << 1)][i] << 4) |
233 u_sbox[(b << 1) + 1][j];
234
235 /*
236 * Set up the initial & final permutations into a useful form, and
237 * initialise the inverted key permutation.
238 */
239 for (i = 0; i < 64; i++) {
240 init_perm[final_perm[i] = IP[i] - 1] = i;
241 inv_key_perm[i] = 255;
242 }
243
244 /*
245 * Invert the key permutation and initialise the inverted key
246 * compression permutation.
247 */
248 for (i = 0; i < 56; i++) {
249 inv_key_perm[key_perm[i] - 1] = i;
250 inv_comp_perm[i] = 255;
251 }
252
253 /*
254 * Invert the key compression permutation.
255 */
256 for (i = 0; i < 48; i++) {
257 inv_comp_perm[comp_perm[i] - 1] = i;
258 }
259
260 /*
261 * Set up the OR-mask arrays for the initial and final permutations,
262 * and for the key initial and compression permutations.
263 */
264 for (k = 0; k < 8; k++) {
265 for (i = 0; i < 256; i++) {
266 *(il = &ip_maskl[k][i]) = 0;
267 *(ir = &ip_maskr[k][i]) = 0;
268 *(fl = &fp_maskl[k][i]) = 0;
269 *(fr = &fp_maskr[k][i]) = 0;
270 for (j = 0; j < 8; j++) {
271 inbit = 8 * k + j;
272 if (i & bits8[j]) {
273 if ((obit = init_perm[inbit]) < 32)
274 *il |= bits32[obit];
275 else
276 *ir |= bits32[obit-32];
277 if ((obit = final_perm[inbit]) < 32)
278 *fl |= bits32[obit];
279 else
280 *fr |= bits32[obit - 32];
281 }
282 }
283 }
284 for (i = 0; i < 128; i++) {
285 *(il = &key_perm_maskl[k][i]) = 0;
286 *(ir = &key_perm_maskr[k][i]) = 0;
287 for (j = 0; j < 7; j++) {
288 inbit = 8 * k + j;
289 if (i & bits8[j + 1]) {
290 if ((obit = inv_key_perm[inbit]) == 255)
291 continue;
292 if (obit < 28)
293 *il |= bits28[obit];
294 else
295 *ir |= bits28[obit - 28];
296 }
297 }
298 *(il = &comp_maskl[k][i]) = 0;
299 *(ir = &comp_maskr[k][i]) = 0;
300 for (j = 0; j < 7; j++) {
301 inbit = 7 * k + j;
302 if (i & bits8[j + 1]) {
303 if ((obit=inv_comp_perm[inbit]) == 255)
304 continue;
305 if (obit < 24)
306 *il |= bits24[obit];
307 else
308 *ir |= bits24[obit - 24];
309 }
310 }
311 }
312 }
313
314 /*
315 * Invert the P-box permutation, and convert into OR-masks for
316 * handling the output of the S-box arrays setup above.
317 */
318 for (i = 0; i < 32; i++)
319 un_pbox[pbox[i] - 1] = i;
320
321 for (b = 0; b < 4; b++)
322 for (i = 0; i < 256; i++) {
323 *(p = &psbox[b][i]) = 0;
324 for (j = 0; j < 8; j++) {
325 if (i & bits8[j])
326 *p |= bits32[un_pbox[8 * b + j]];
327 }
328 }
329
330 des_initialised = 1;
331 }
332
333 static void
334 setup_salt(salt)
335 int salt;
336 {
337 unsigned int obit, saltbit;
338 int i;
339
340 if (salt == old_salt)
341 return;
342 old_salt = salt;
343
344 saltbits = 0;
345 saltbit = 1;
346 obit = 0x800000;
347 for (i = 0; i < 24; i++) {
348 if (salt & saltbit)
349 saltbits |= obit;
350 saltbit <<= 1;
351 obit >>= 1;
352 }
353 }
354
355 static int
356 des_setkey(key)
357 const char *key;
358 {
359 unsigned int k0, k1, rawkey0, rawkey1;
360 int shifts, round;
361
362 if (!des_initialised)
363 des_init();
364
365 rawkey0 = ntohl(*(unsigned int *) key);