posix/crypt/crypt_util.c

51  * Permutation done once on the 56 bit
62  * How much to rotate each 28 bit half of the pc1 permutated
63  *  56 bit key before using pc2 to give the i' key
82  * bits from the 32 bit intermediate result.
189 /* Macro to set a bit (0..23) */
196  * They do sbox lookup, shifting of this  value, 32 bit
213  * eperm32tab: do 32 bit permutation and E selection
215  * The first index is the byte number in the 32 bit value to be permuted
217  *  -  third   -   selects the two 32 bit values
230  * The result is kept with 28 bit per 32 bit with the 4 most significant
238  * The first   index is the septet number in the two 28 bit intermediate values
243  * The result is kept with 28 bit per 32 bit with the 4 most significant
252  *      Invoked 6 bit a time on two 48 bit values
253  *      giving two 32 bit longs.
260  *           Invoked 6 bit a time on DES output
261  *           giving 4 32 bit longs.
327 /* lookup a 6 bit value in sbox */
338     int bit, sg;
347     for(bit = 0; bit < 56; bit++) {
348       comes_from_bit  = pc1[bit] - 1;
350       mask2 = longmask[bit % 28 + 4];
353 	  do_pc1[comes_from_bit / 8][bit / 28][j] |= mask2;
362     for(bit = 0; bit < 48; bit++) {
363       comes_from_bit  = pc2[bit] - 1;
365       mask2 = BITMASK(bit % 24);
374      * 32 bit permutation and e expansion
376      * We use it because we have to permute 16384 32 bit
377      * longs into 48 bit in order to initialize sb.
386     for(bit = 0; bit < 48; bit++) {
389       comes_from = perm32[esel[bit]-1]-1;
394 	  eperm32tab[comes_from / 8][j][bit / 24] |= BITMASK(bit % 24);
401      * For each 12 bit segment of an 48 bit intermediate
402      * result, the sb table precomputes the two 4 bit
404      * bit halves, shifts them to their proper place,
457     for(bit=48; bit--;) {
458       e_inverse[esel[bit] - 1     ] = bit;
459       e_inverse[esel[bit] - 1 + 32] = bit + 48;
467     for(bit = 0; bit < 64; bit++) {
473       /* See where bit i belongs in the two 32 bit long's */
474       o_long = bit / 32; /* 0..1  */
475       o_bit  = bit % 32; /* 0..31 */
478        * And find a bit in the e permutated value setting this bit.
480        * Note: the e selection may have selected the same bit several
484       comes_from_f_bit = final_perm[bit] - 1;         /* 0..63 */
504     for(bit = 0; bit < 96; bit++) {
505       int ibit = initial_perm[esel[bit % 48] - 1 + ((bit >= 48) ? 32 : 0)] - 1;
507       mask2 = BITMASK(bit % 24);
510           revfinal[ibit / 6][j][bit / 24] |= mask2;
692  * crypt only: convert from 64 bit to 11 bit ASCII
758      * And convert back to 6 bit ASCII
776  * represented by one byte per bit and
850      * And convert to bit array
863  * UNIX setkey function. Take a 64 bit DES
912      * And convert back to 6 bit ASCII
926      * And convert back to 6 bit ASCII