2 * Copyright (c) 1989 The Regents of the University of California.
5 * This code is derived from software contributed to Berkeley by
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
37 #if defined(LIBC_SCCS) && !defined(lint)
38 static char sccsid[] = "@(#)crypt.c 5.11 (Berkeley) 6/25/91";
39 #endif /* LIBC_SCCS and not lint */
48 * UNIX password, and DES, encryption.
49 * By Tom Truscott, trt@rti.rti.org,
50 * from algorithms by Robert W. Baldwin and James Gillogly.
53 * "Mathematical Cryptology for Computer Scientists and Mathematicians,"
54 * by Wayne Patterson, 1987, ISBN 0-8476-7438-X.
56 * "Password Security: A Case History," R. Morris and Ken Thompson,
57 * Communications of the ACM, vol. 22, pp. 594-597, Nov. 1979.
59 * "DES will be Totally Insecure within Ten Years," M.E. Hellman,
60 * IEEE Spectrum, vol. 16, pp. 32-39, July 1979.
63 /* ===== Configuration ==================== */
66 * define "MUST_ALIGN" if your compiler cannot load/store
67 * long integers at arbitrary (e.g. odd) memory locations.
68 * (Either that or never pass unaligned addresses to des_cipher!)
76 #error C_block structure assumes 8 bit characters
81 * define "LONG_IS_32_BITS" only if sizeof(long)==4.
82 * This avoids use of bit fields (your compiler may be sloppy with them).
85 #define LONG_IS_32_BITS
89 * define "B64" to be the declaration for a 64 bit integer.
90 * XXX this feature is currently unused, see "endian" comment below.
100 * define "LARGEDATA" to get faster permutations, by using about 72 kilobytes
101 * of lookup tables. This speeds up des_setkey() and des_cipher(), but has
102 * little effect on crypt().
108 /* compile with "-DSTATIC=int" when profiling */
110 #define STATIC static
112 STATIC void init_des();
113 STATIC void permute();
114 STATIC void init_perm();
116 /* Hide these functions for Transarc use; only export crypt() */
117 STATIC int des_setkey(const char *key);
118 STATIC int des_cipher(const char *in, char *out, long salt, int num_iter);
124 /* ==================================== */
127 * Cipher-block representation (Bob Baldwin):
129 * DES operates on groups of 64 bits, numbered 1..64 (sigh). One
130 * representation is to store one bit per byte in an array of bytes. Bit N of
131 * the NBS spec is stored as the LSB of the Nth byte (index N-1) in the array.
132 * Another representation stores the 64 bits in 8 bytes, with bits 1..8 in the
133 * first byte, 9..16 in the second, and so on. The DES spec apparently has
134 * bit 1 in the MSB of the first byte, but that is particularly noxious so we
135 * bit-reverse each byte so that bit 1 is the LSB of the first byte, bit 8 is
136 * the MSB of the first byte. Specifically, the 64-bit input data and key are
137 * converted to LSB format, and the output 64-bit block is converted back into
140 * DES operates internally on groups of 32 bits which are expanded to 48 bits
141 * by permutation E and shrunk back to 32 bits by the S boxes. To speed up
142 * the computation, the expansion is applied only once, the expanded
143 * representation is maintained during the encryption, and a compression
144 * permutation is applied only at the end. To speed up the S-box lookups,
145 * the 48 bits are maintained as eight 6 bit groups, one per byte, which
146 * directly feed the eight S-boxes. Within each byte, the 6 bits are the
147 * most significant ones. The low two bits of each byte are zero. (Thus,
148 * bit 1 of the 48 bit E expansion is stored as the "4"-valued bit of the
149 * first byte in the eight byte representation, bit 2 of the 48 bit value is
150 * the "8"-valued bit, and so on.) In fact, a combined "SPE"-box lookup is
151 * used, in which the output is the 64 bit result of an S-box lookup which
152 * has been permuted by P and expanded by E, and is ready for use in the next
153 * iteration. Two 32-bit wide tables, SPE[0] and SPE[1], are used for this
154 * lookup. Since each byte in the 48 bit path is a multiple of four, indexed
155 * lookup of SPE[0] and SPE[1] is simple and fast. The key schedule and
156 * "salt" are also converted to this 8*(6+2) format. The SPE table size is
159 * To speed up bit-parallel operations (such as XOR), the 8 byte
160 * representation is "union"ed with 32 bit values "i0" and "i1", and, on
161 * machines which support it, a 64 bit value "b64". This data structure,
162 * "C_block", has two problems. First, alignment restrictions must be
163 * honored. Second, the byte-order (e.g. little-endian or big-endian) of
164 * the architecture becomes visible.
166 * The byte-order problem is unfortunate, since on the one hand it is good
167 * to have a machine-independent C_block representation (bits 1..8 in the
168 * first byte, etc.), and on the other hand it is good for the LSB of the
169 * first byte to be the LSB of i0. We cannot have both these things, so we
170 * currently use the "little-endian" representation and avoid any multi-byte
171 * operations that depend on byte order. This largely precludes use of the
172 * 64-bit datatype since the relative order of i0 and i1 are unknown. It
173 * also inhibits grouping the SPE table to look up 12 bits at a time. (The
174 * 12 bits can be stored in a 16-bit field with 3 low-order zeroes and 1
175 * high-order zero, providing fast indexing into a 64-bit wide SPE.) On the
176 * other hand, 64-bit datatypes are currently rare, and a 12-bit SPE lookup
177 * requires a 128 kilobyte table, so perhaps this is not a big loss.
179 * Permutation representation (Jim Gillogly):
181 * A transformation is defined by its effect on each of the 8 bytes of the
182 * 64-bit input. For each byte we give a 64-bit output that has the bits in
183 * the input distributed appropriately. The transformation is then the OR
184 * of the 8 sets of 64-bits. This uses 8*256*8 = 16K bytes of storage for
185 * each transformation. Unless LARGEDATA is defined, however, a more compact
186 * table is used which looks up 16 4-bit "chunks" rather than 8 8-bit chunks.
187 * The smaller table uses 16*16*8 = 2K bytes for each transformation. This
188 * is slower but tolerable, particularly for password encryption in which
189 * the SPE transformation is iterated many times. The small tables total 9K
190 * bytes, the large tables total 72K bytes.
192 * The transformations used are:
193 * IE3264: MSB->LSB conversion, initial permutation, and expansion.
194 * This is done by collecting the 32 even-numbered bits and applying
195 * a 32->64 bit transformation, and then collecting the 32 odd-numbered
196 * bits and applying the same transformation. Since there are only
197 * 32 input bits, the IE3264 transformation table is half the size of
199 * CF6464: Compression, final permutation, and LSB->MSB conversion.
200 * This is done by two trivial 48->32 bit compressions to obtain
201 * a 64-bit block (the bit numbering is given in the "CIFP" table)
202 * followed by a 64->64 bit "cleanup" transformation. (It would
203 * be possible to group the bits in the 64-bit block so that 2
204 * identical 32->32 bit transformations could be used instead,
205 * saving a factor of 4 in space and possibly 2 in time, but
206 * byte-ordering and other complications rear their ugly head.
207 * Similar opportunities/problems arise in the key schedule
209 * PC1ROT: MSB->LSB, PC1 permutation, rotate, and PC2 permutation.
210 * This admittedly baroque 64->64 bit transformation is used to
211 * produce the first code (in 8*(6+2) format) of the key schedule.
212 * PC2ROT[0]: Inverse PC2 permutation, rotate, and PC2 permutation.
213 * It would be possible to define 15 more transformations, each
214 * with a different rotation, to generate the entire key schedule.
215 * To save space, however, we instead permute each code into the
216 * next by using a transformation that "undoes" the PC2 permutation,
217 * rotates the code, and then applies PC2. Unfortunately, PC2
218 * transforms 56 bits into 48 bits, dropping 8 bits, so PC2 is not
219 * invertible. We get around that problem by using a modified PC2
220 * which retains the 8 otherwise-lost bits in the unused low-order
221 * bits of each byte. The low-order bits are cleared when the
222 * codes are stored into the key schedule.
223 * PC2ROT[1]: Same as PC2ROT[0], but with two rotations.
224 * This is faster than applying PC2ROT[0] twice,
226 * The Bell Labs "salt" (Bob Baldwin):
228 * The salting is a simple permutation applied to the 48-bit result of E.
229 * Specifically, if bit i (1 <= i <= 24) of the salt is set then bits i and
230 * i+24 of the result are swapped. The salt is thus a 24 bit number, with
231 * 16777216 possible values. (The original salt was 12 bits and could not
232 * swap bits 13..24 with 36..48.)
234 * It is possible, but ugly, to warp the SPE table to account for the salt
235 * permutation. Fortunately, the conditional bit swapping requires only
236 * about four machine instructions and can be done on-the-fly with about an
237 * 8% performance penalty.
243 #if defined(LONG_IS_32_BITS)
244 /* long is often faster than a 32-bit bit field */
258 * Convert twenty-four-bit long in host-order
259 * to six bits (and 2 low-order zeroes) per char little-endian format.
261 #define TO_SIX_BIT(rslt, src) { \
263 cvt.b[0] = (unsigned char) src; src >>= 6; \
264 cvt.b[1] = (unsigned char) src; src >>= 6; \
265 cvt.b[2] = (unsigned char) src; src >>= 6; \
266 cvt.b[3] = (unsigned char) src; \
267 rslt = (cvt.b32.i0 & 0x3f3f3f3fL) << 2; \
271 * These macros may someday permit efficient use of 64-bit integers.
273 #define ZERO(d,d0,d1) d0 = 0, d1 = 0
274 #define LOAD(d,d0,d1,bl) d0 = (bl).b32.i0, d1 = (bl).b32.i1
275 #define LOADREG(d,d0,d1,s,s0,s1) d0 = s0, d1 = s1
276 #define OR(d,d0,d1,bl) d0 |= (bl).b32.i0, d1 |= (bl).b32.i1
277 #define STORE(s,s0,s1,bl) (bl).b32.i0 = s0, (bl).b32.i1 = s1
278 #define DCL_BLOCK(d,d0,d1) long d0, d1
280 #if defined(LARGEDATA)
281 /* Waste memory like crazy. Also, do permutations in line */
282 #define LGCHUNKBITS 3
283 #define CHUNKBITS (1<<LGCHUNKBITS)
284 #define PERM6464(d,d0,d1,cpp,p) \
285 LOAD(d,d0,d1,(p)[(0<<CHUNKBITS)+(cpp)[0]]); \
286 OR (d,d0,d1,(p)[(1<<CHUNKBITS)+(cpp)[1]]); \
287 OR (d,d0,d1,(p)[(2<<CHUNKBITS)+(cpp)[2]]); \
288 OR (d,d0,d1,(p)[(3<<CHUNKBITS)+(cpp)[3]]); \
289 OR (d,d0,d1,(p)[(4<<CHUNKBITS)+(cpp)[4]]); \
290 OR (d,d0,d1,(p)[(5<<CHUNKBITS)+(cpp)[5]]); \
291 OR (d,d0,d1,(p)[(6<<CHUNKBITS)+(cpp)[6]]); \
292 OR (d,d0,d1,(p)[(7<<CHUNKBITS)+(cpp)[7]]);
293 #define PERM3264(d,d0,d1,cpp,p) \
294 LOAD(d,d0,d1,(p)[(0<<CHUNKBITS)+(cpp)[0]]); \
295 OR (d,d0,d1,(p)[(1<<CHUNKBITS)+(cpp)[1]]); \
296 OR (d,d0,d1,(p)[(2<<CHUNKBITS)+(cpp)[2]]); \
297 OR (d,d0,d1,(p)[(3<<CHUNKBITS)+(cpp)[3]]);
300 #define LGCHUNKBITS 2
301 #define CHUNKBITS (1<<LGCHUNKBITS)
302 #define PERM6464(d,d0,d1,cpp,p) \
303 { C_block tblk; permute(cpp,&tblk,p,8); LOAD (d,d0,d1,tblk); }
304 #define PERM3264(d,d0,d1,cpp,p) \
305 { C_block tblk; permute(cpp,&tblk,p,4); LOAD (d,d0,d1,tblk); }
308 void permute(cp, out, p, chars_in)
314 register DCL_BLOCK(D,D0,D1);
315 register C_block *tp;
321 tp = &p[t&0xf]; OR(D,D0,D1,*tp); p += (1<<CHUNKBITS);
322 tp = &p[t>>4]; OR(D,D0,D1,*tp); p += (1<<CHUNKBITS);
323 } while (--chars_in > 0);
326 #endif /* LARGEDATA */
329 /* ===== (mostly) Standard DES Tables ==================== */
331 static unsigned char IP[] = { /* initial permutation */
332 58, 50, 42, 34, 26, 18, 10, 2,
333 60, 52, 44, 36, 28, 20, 12, 4,
334 62, 54, 46, 38, 30, 22, 14, 6,
335 64, 56, 48, 40, 32, 24, 16, 8,
336 57, 49, 41, 33, 25, 17, 9, 1,
337 59, 51, 43, 35, 27, 19, 11, 3,
338 61, 53, 45, 37, 29, 21, 13, 5,
339 63, 55, 47, 39, 31, 23, 15, 7,
342 /* The final permutation is the inverse of IP - no table is necessary */
344 static unsigned char ExpandTr[] = { /* expansion operation */
347 8, 9, 10, 11, 12, 13,
348 12, 13, 14, 15, 16, 17,
349 16, 17, 18, 19, 20, 21,
350 20, 21, 22, 23, 24, 25,
351 24, 25, 26, 27, 28, 29,
352 28, 29, 30, 31, 32, 1,
355 static unsigned char PC1[] = { /* permuted choice table 1 */
356 57, 49, 41, 33, 25, 17, 9,
357 1, 58, 50, 42, 34, 26, 18,
358 10, 2, 59, 51, 43, 35, 27,
359 19, 11, 3, 60, 52, 44, 36,
361 63, 55, 47, 39, 31, 23, 15,
362 7, 62, 54, 46, 38, 30, 22,
363 14, 6, 61, 53, 45, 37, 29,
364 21, 13, 5, 28, 20, 12, 4,
367 static unsigned char Rotates[] = { /* PC1 rotation schedule */
368 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1,
371 /* note: each "row" of PC2 is left-padded with bits that make it invertible */
372 static unsigned char PC2[] = { /* permuted choice table 2 */
373 9, 18, 14, 17, 11, 24, 1, 5,
374 22, 25, 3, 28, 15, 6, 21, 10,
375 35, 38, 23, 19, 12, 4, 26, 8,
376 43, 54, 16, 7, 27, 20, 13, 2,
378 0, 0, 41, 52, 31, 37, 47, 55,
379 0, 0, 30, 40, 51, 45, 33, 48,
380 0, 0, 44, 49, 39, 56, 34, 53,
381 0, 0, 46, 42, 50, 36, 29, 32,
384 static unsigned char S[8][64] = { /* 48->32 bit substitution tables */
386 { 14, 4, 13, 1, 2, 15, 11, 8, 3, 10, 6, 12, 5, 9, 0, 7,
387 0, 15, 7, 4, 14, 2, 13, 1, 10, 6, 12, 11, 9, 5, 3, 8,
388 4, 1, 14, 8, 13, 6, 2, 11, 15, 12, 9, 7, 3, 10, 5, 0,
389 15, 12, 8, 2, 4, 9, 1, 7, 5, 11, 3, 14, 10, 0, 6, 13, },
391 { 15, 1, 8, 14, 6, 11, 3, 4, 9, 7, 2, 13, 12, 0, 5, 10,
392 3, 13, 4, 7, 15, 2, 8, 14, 12, 0, 1, 10, 6, 9, 11, 5,
393 0, 14, 7, 11, 10, 4, 13, 1, 5, 8, 12, 6, 9, 3, 2, 15,
394 13, 8, 10, 1, 3, 15, 4, 2, 11, 6, 7, 12, 0, 5, 14, 9, },
396 { 10, 0, 9, 14, 6, 3, 15, 5, 1, 13, 12, 7, 11, 4, 2, 8,
397 13, 7, 0, 9, 3, 4, 6, 10, 2, 8, 5, 14, 12, 11, 15, 1,
398 13, 6, 4, 9, 8, 15, 3, 0, 11, 1, 2, 12, 5, 10, 14, 7,
399 1, 10, 13, 0, 6, 9, 8, 7, 4, 15, 14, 3, 11, 5, 2, 12, },
401 { 7, 13, 14, 3, 0, 6, 9, 10, 1, 2, 8, 5, 11, 12, 4, 15,
402 13, 8, 11, 5, 6, 15, 0, 3, 4, 7, 2, 12, 1, 10, 14, 9,
403 10, 6, 9, 0, 12, 11, 7, 13, 15, 1, 3, 14, 5, 2, 8, 4,
404 3, 15, 0, 6, 10, 1, 13, 8, 9, 4, 5, 11, 12, 7, 2, 14, },
406 { 2, 12, 4, 1, 7, 10, 11, 6, 8, 5, 3, 15, 13, 0, 14, 9,
407 14, 11, 2, 12, 4, 7, 13, 1, 5, 0, 15, 10, 3, 9, 8, 6,
408 4, 2, 1, 11, 10, 13, 7, 8, 15, 9, 12, 5, 6, 3, 0, 14,
409 11, 8, 12, 7, 1, 14, 2, 13, 6, 15, 0, 9, 10, 4, 5, 3, },
411 { 12, 1, 10, 15, 9, 2, 6, 8, 0, 13, 3, 4, 14, 7, 5, 11,
412 10, 15, 4, 2, 7, 12, 9, 5, 6, 1, 13, 14, 0, 11, 3, 8,
413 9, 14, 15, 5, 2, 8, 12, 3, 7, 0, 4, 10, 1, 13, 11, 6,
414 4, 3, 2, 12, 9, 5, 15, 10, 11, 14, 1, 7, 6, 0, 8, 13, },
416 { 4, 11, 2, 14, 15, 0, 8, 13, 3, 12, 9, 7, 5, 10, 6, 1,
417 13, 0, 11, 7, 4, 9, 1, 10, 14, 3, 5, 12, 2, 15, 8, 6,
418 1, 4, 11, 13, 12, 3, 7, 14, 10, 15, 6, 8, 0, 5, 9, 2,
419 6, 11, 13, 8, 1, 4, 10, 7, 9, 5, 0, 15, 14, 2, 3, 12, },
421 { 13, 2, 8, 4, 6, 15, 11, 1, 10, 9, 3, 14, 5, 0, 12, 7,
422 1, 15, 13, 8, 10, 3, 7, 4, 12, 5, 6, 11, 0, 14, 9, 2,
423 7, 11, 4, 1, 9, 12, 14, 2, 0, 6, 10, 13, 15, 3, 5, 8,
424 2, 1, 14, 7, 4, 10, 8, 13, 15, 12, 9, 0, 3, 5, 6, 11, }
427 static unsigned char P32Tr[] = { /* 32-bit permutation function */
438 static unsigned char CIFP[] = { /* compressed/interleaved permutation */
439 1, 2, 3, 4, 17, 18, 19, 20,
440 5, 6, 7, 8, 21, 22, 23, 24,
441 9, 10, 11, 12, 25, 26, 27, 28,
442 13, 14, 15, 16, 29, 30, 31, 32,
444 33, 34, 35, 36, 49, 50, 51, 52,
445 37, 38, 39, 40, 53, 54, 55, 56,
446 41, 42, 43, 44, 57, 58, 59, 60,
447 45, 46, 47, 48, 61, 62, 63, 64,
450 static unsigned char itoa64[] = /* 0..63 => ascii-64 */
451 "./0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz";
454 /* ===== Tables that are initialized at run time ==================== */
457 static unsigned char a64toi[128]; /* ascii-64 => 0..63 */
459 /* Initial key schedule permutation */
460 static C_block PC1ROT[64/CHUNKBITS][1<<CHUNKBITS];
462 /* Subsequent key schedule rotation permutations */
463 static C_block PC2ROT[2][64/CHUNKBITS][1<<CHUNKBITS];
465 /* Initial permutation/expansion table */
466 static C_block IE3264[32/CHUNKBITS][1<<CHUNKBITS];
468 /* Table that combines the S, P, and E operations. */
469 static long SPE[2][8][64];
471 /* compressed/interleaved => final permutation table */
472 static C_block CF6464[64/CHUNKBITS][1<<CHUNKBITS];
475 /* ==================================== */
478 static C_block constdatablock; /* encryption constant */
479 static char cryptresult[1+4+4+11+1]; /* encrypted result */
482 * Return a pointer to static data consisting of the "setting"
483 * followed by an encryption produced by the "key" and "setting".
487 register const char *key;
488 register const char *setting;
494 int num_iter, salt_size;
495 C_block keyblock, rsltblock;
497 for (i = 0; i < 8; i++) {
498 if ((t = 2*(unsigned char)(*key)) != 0)
502 if (des_setkey((char *)keyblock.b)) /* also initializes "a64toi" */
505 encp = &cryptresult[0];
507 case '_': /* was EFMT1 */
509 * Involve the rest of the password 8 characters at a time.
512 if (des_cipher((char *)&keyblock,
513 (char *)&keyblock, 0L, 1))
515 for (i = 0; i < 8; i++) {
516 if ((t = 2*(unsigned char)(*key)) != 0)
520 if (des_setkey((char *)keyblock.b))
524 *encp++ = *setting++;
526 /* get iteration count */
528 for (i = 4; --i >= 0; ) {
529 if ((t = (unsigned char)setting[i]) == '\0')
532 num_iter = (num_iter<<6) | a64toi[t];
544 for (i = salt_size; --i >= 0; ) {
545 if ((t = (unsigned char)setting[i]) == '\0')
548 salt = (salt<<6) | a64toi[t];
551 if (des_cipher((char *)&constdatablock, (char *)&rsltblock,
556 * Encode the 64 cipher bits as 11 ascii characters.
558 i = ((long)((rsltblock.b[0]<<8) | rsltblock.b[1])<<8) | rsltblock.b[2];
559 encp[3] = itoa64[i&0x3f]; i >>= 6;
560 encp[2] = itoa64[i&0x3f]; i >>= 6;
561 encp[1] = itoa64[i&0x3f]; i >>= 6;
562 encp[0] = itoa64[i]; encp += 4;
563 i = ((long)((rsltblock.b[3]<<8) | rsltblock.b[4])<<8) | rsltblock.b[5];
564 encp[3] = itoa64[i&0x3f]; i >>= 6;
565 encp[2] = itoa64[i&0x3f]; i >>= 6;
566 encp[1] = itoa64[i&0x3f]; i >>= 6;
567 encp[0] = itoa64[i]; encp += 4;
568 i = ((long)((rsltblock.b[6])<<8) | rsltblock.b[7])<<2;
569 encp[2] = itoa64[i&0x3f]; i >>= 6;
570 encp[1] = itoa64[i&0x3f]; i >>= 6;
575 return (cryptresult);
580 * The Key Schedule, filled in by des_setkey() or setkey().
583 static C_block KS[KS_SIZE];
586 * Set up the key schedule from the key.
590 register const char *key;
592 register DCL_BLOCK(K, K0, K1);
593 register C_block *ptabp;
595 static int des_ready = 0;
602 PERM6464(K,K0,K1,(unsigned char *)key,(C_block *)PC1ROT);
603 key = (char *)&KS[0];
604 STORE(K&~0x03030303L, K0&~0x03030303L, K1, *(C_block *)key);
605 for (i = 1; i < 16; i++) {
606 key += sizeof(C_block);
607 STORE(K,K0,K1,*(C_block *)key);
608 ptabp = (C_block *)PC2ROT[Rotates[i]-1];
609 PERM6464(K,K0,K1,(unsigned char *)key,ptabp);
610 STORE(K&~0x03030303L, K0&~0x03030303L, K1, *(C_block *)key);
616 * Encrypt (or decrypt if num_iter < 0) the 8 chars at "in" with abs(num_iter)
617 * iterations of DES, using the the given 24-bit salt and the pre-computed key
618 * schedule, and store the resulting 8 chars at "out" (in == out is permitted).
620 * NOTE: the performance of this routine is critically dependent on your
621 * compiler and machine architecture.
624 int des_cipher(in, out, salt, num_iter)
630 /* variables that we want in registers, most important first */
634 register long L0, L1, R0, R1, k;
635 register C_block *kp;
636 register int ks_inc, loop_count;
640 TO_SIX_BIT(salt, L0); /* convert to 4*(6+2) format */
642 #if defined(vax) || defined(pdp11)
643 salt = ~salt; /* "x &~ y" is faster than "x & y". */
649 #if defined(MUST_ALIGN)
650 B.b[0] = in[0]; B.b[1] = in[1]; B.b[2] = in[2]; B.b[3] = in[3];
651 B.b[4] = in[4]; B.b[5] = in[5]; B.b[6] = in[6]; B.b[7] = in[7];
654 LOAD(L,L0,L1,*(C_block *)in);
656 LOADREG(R,R0,R1,L,L0,L1);
659 L0 = (L0 << 1) | L1; /* L0 is the even-numbered input bits */
661 R1 = (R1 >> 1) & 0x55555555L;
662 L1 = R0 | R1; /* L1 is the odd-numbered input bits */
664 PERM3264(L,L0,L1,B.b, (C_block *)IE3264); /* even bits */
665 PERM3264(R,R0,R1,B.b+4,(C_block *)IE3264); /* odd bits */
670 ks_inc = sizeof(*kp);
674 num_iter = -num_iter;
676 ks_inc = -((long) sizeof(*kp));
679 while (--num_iter >= 0) {
683 #define SPTAB(t, i) (*(long *)((unsigned char *)t + i*(sizeof(long)/4)))
685 /* use this if B.b[i] is evaluated just once ... */
686 #define DOXOR(x,y,i) x^=SPTAB(SPE[0][i],B.b[i]); y^=SPTAB(SPE[1][i],B.b[i]);
689 /* use this if your "long" int indexing is slow */
690 #define DOXOR(x,y,i) j=B.b[i]; x^=SPTAB(SPE[0][i],j); y^=SPTAB(SPE[1][i],j);
692 /* use this if "k" is allocated to a register ... */
693 #define DOXOR(x,y,i) k=B.b[i]; x^=SPTAB(SPE[0][i],k); y^=SPTAB(SPE[1][i],k);
697 #define CRUNCH(p0, p1, q0, q1) \
698 k = (q0 ^ q1) & SALT; \
699 B.b32.i0 = k ^ q0 ^ kp->b32.i0; \
700 B.b32.i1 = k ^ q1 ^ kp->b32.i1; \
701 kp = (C_block *)((char *)kp+ks_inc); \
712 CRUNCH(L0, L1, R0, R1);
713 CRUNCH(R0, R1, L0, L1);
714 } while (--loop_count != 0);
715 kp = (C_block *)((char *)kp-(ks_inc*KS_SIZE));
724 /* store the encrypted (or decrypted) result */
725 L0 = ((L0 >> 3) & 0x0f0f0f0fL) | ((L1 << 1) & 0xf0f0f0f0L);
726 L1 = ((R0 >> 3) & 0x0f0f0f0fL) | ((R1 << 1) & 0xf0f0f0f0L);
728 PERM6464(L,L0,L1,B.b, (C_block *)CF6464);
729 #if defined(MUST_ALIGN)
731 out[0] = B.b[0]; out[1] = B.b[1]; out[2] = B.b[2]; out[3] = B.b[3];
732 out[4] = B.b[4]; out[5] = B.b[5]; out[6] = B.b[6]; out[7] = B.b[7];
734 STORE(L,L0,L1,*(C_block *)out);
741 * Initialize various tables. This need only be done once. It could even be
742 * done at compile time, if the compiler were capable of that sort of thing.
749 register int tableno;
750 static unsigned char perm[64], tmp32[32]; /* "static" for speed */
753 * table that converts chars "./0-9A-Za-z"to integers 0-63.
755 for (i = 0; i < 64; i++)
756 a64toi[itoa64[i]] = i;
759 * PC1ROT - bit reverse, then PC1, then Rotate, then PC2.
761 for (i = 0; i < 64; i++)
763 for (i = 0; i < 64; i++) {
764 if ((k = PC2[i]) == 0)
767 if ((k%28) < Rotates[0]) k -= 28;
774 perm[i] = (unsigned char) k;
777 prtab("pc1tab", perm, 8);
779 init_perm(PC1ROT, perm, 8, 8);
782 * PC2ROT - PC2 inverse, then Rotate (once or twice), then PC2.
784 for (j = 0; j < 2; j++) {
785 unsigned char pc2inv[64];
786 for (i = 0; i < 64; i++)
787 perm[i] = pc2inv[i] = 0;
788 for (i = 0; i < 64; i++) {
789 if ((k = PC2[i]) == 0)
793 for (i = 0; i < 64; i++) {
794 if ((k = PC2[i]) == 0)
797 if ((k%28) <= j) k -= 28;
801 prtab("pc2tab", perm, 8);
803 init_perm(PC2ROT[j], perm, 8, 8);
807 * Bit reverse, then initial permutation, then expansion.
809 for (i = 0; i < 8; i++) {
810 for (j = 0; j < 8; j++) {
811 k = (j < 2)? 0: IP[ExpandTr[i*6+j-2]-1];
821 perm[i*8+j] = (unsigned char) k;
825 prtab("ietab", perm, 8);
827 init_perm(IE3264, perm, 4, 8);
830 * Compression, then final permutation, then bit reverse.
832 for (i = 0; i < 64; i++) {
842 prtab("cftab", perm, 8);
844 init_perm(CF6464, perm, 8, 8);
849 for (i = 0; i < 48; i++)
850 perm[i] = P32Tr[ExpandTr[i]-1];
851 for (tableno = 0; tableno < 8; tableno++) {
852 for (j = 0; j < 64; j++) {
853 k = (((j >> 0) &01) << 5)|
854 (((j >> 1) &01) << 3)|
855 (((j >> 2) &01) << 2)|
856 (((j >> 3) &01) << 1)|
857 (((j >> 4) &01) << 0)|
858 (((j >> 5) &01) << 4);
860 k = (((k >> 3)&01) << 0)|
861 (((k >> 2)&01) << 1)|
862 (((k >> 1)&01) << 2)|
863 (((k >> 0)&01) << 3);
864 for (i = 0; i < 32; i++)
866 for (i = 0; i < 4; i++)
867 tmp32[4 * tableno + i] = (k >> i) & 01;
869 for (i = 24; --i >= 0; )
870 k = (k<<1) | tmp32[perm[i]-1];
871 TO_SIX_BIT(SPE[0][tableno][j], k);
873 for (i = 24; --i >= 0; )
874 k = (k<<1) | tmp32[perm[i+24]-1];
875 TO_SIX_BIT(SPE[1][tableno][j], k);
881 * Initialize "perm" to represent transformation "p", which rearranges
882 * (perhaps with expansion and/or contraction) one packed array of bits
883 * (of size "chars_in" characters) into another array (of size "chars_out"
886 * "perm" must be all-zeroes on entry to this routine.
889 void init_perm(perm, p, chars_in, chars_out)
890 C_block perm[64/CHUNKBITS][1<<CHUNKBITS];
892 int chars_in, chars_out;
894 register int i, j, k, l;
896 for (k = 0; k < chars_out*8; k++) { /* each output bit position */
897 l = p[k] - 1; /* where this bit comes from */
899 continue; /* output bit is always 0 */
900 i = l>>LGCHUNKBITS; /* which chunk this bit comes from */
901 l = 1<<(l&(CHUNKBITS-1)); /* mask for this bit */
902 for (j = 0; j < (1<<CHUNKBITS); j++) { /* each chunk value */
904 perm[i][j].b[k>>3] |= 1<<(k&07);
910 * "setkey" routine (for backwards compatibility)
912 #if 0 /* static and doesn't appear to be referenced */
915 register const char *key;
917 register int i, j, k;
920 for (i = 0; i < 8; i++) {
922 for (j = 0; j < 8; j++) {
924 k |= (unsigned char)*key++;
928 return (des_setkey((char *)keyblock.b));
933 * "encrypt" routine (for backwards compatibility)
935 int encrypt(block, flag)
936 register char *block;
939 register int i, j, k;
942 for (i = 0; i < 8; i++) {
944 for (j = 0; j < 8; j++) {
946 k |= (unsigned char)*block++;
950 if (des_cipher((char *)&cblock, (char *)&cblock, 0L, (flag ? -1: 1)))
952 for (i = 7; i >= 0; i--) {
954 for (j = 7; j >= 0; j--) {
964 prtab(s, t, num_rows)
971 (void)printf("%s:\n", s);
972 for (i = 0; i < num_rows; i++) {
973 for (j = 0; j < 8; j++) {
974 (void)printf("%3d", t[i*8+j]);