crypto/heimdal-0.6.3/lib/des/str2key.c

   1 /* crypto/des/str2key.c */
   2 /* Copyright (C) 1995-1997 Eric Young (eay@mincom.oz.au)
   3  * All rights reserved.
   4  *
   5  * This package is an SSL implementation written
   6  * by Eric Young (eay@mincom.oz.au).
   7  * The implementation was written so as to conform with Netscapes SSL.
   8  *
   9  * This library is free for commercial and non-commercial use as long as
  10  * the following conditions are aheared to.  The following conditions
  11  * apply to all code found in this distribution, be it the RC4, RSA,
  12  * lhash, DES, etc., code; not just the SSL code.  The SSL documentation
  13  * included with this distribution is covered by the same copyright terms
  14  * except that the holder is Tim Hudson (tjh@mincom.oz.au).
  15  *
  16  * Copyright remains Eric Young's, and as such any Copyright notices in
  17  * the code are not to be removed.
  18  * If this package is used in a product, Eric Young should be given attribution
  19  * as the author of the parts of the library used.
  20  * This can be in the form of a textual message at program startup or
  21  * in documentation (online or textual) provided with the package.
  22  *
  23  * Redistribution and use in source and binary forms, with or without
  24  * modification, are permitted provided that the following conditions
  25  * are met:
  26  * 1. Redistributions of source code must retain the copyright
  27  *    notice, this list of conditions and the following disclaimer.
  28  * 2. Redistributions in binary form must reproduce the above copyright
  29  *    notice, this list of conditions and the following disclaimer in the
  30  *    documentation and/or other materials provided with the distribution.
  31  * 3. All advertising materials mentioning features or use of this software
  32  *    must display the following acknowledgement:
  33  *    "This product includes cryptographic software written by
  34  *     Eric Young (eay@mincom.oz.au)"
  35  *    The word 'cryptographic' can be left out if the rouines from the library
  36  *    being used are not cryptographic related :-).
  37  * 4. If you include any Windows specific code (or a derivative thereof) from
  38  *    the apps directory (application code) you must include an acknowledgement:
  39  *    "This product includes software written by Tim Hudson (tjh@mincom.oz.au)"
  40  *
  41  * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND
  42  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  43  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  44  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  45  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  46  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  47  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  48  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  49  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  50  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  51  * SUCH DAMAGE.
  52  *
  53  * The licence and distribution terms for any publically available version or
  54  * derivative of this code cannot be changed.  i.e. this code cannot simply be
  55  * copied and put under another distribution licence
  56  * [including the GNU Public Licence.]
  57  */
  58
  59 #include "des_locl.h"
  60
  61 extern int des_check_key;
  62
  63 void des_string_to_key(str, key)
  64 char *str;
  65 des_cblock (*key);
  66         {
  67         des_key_schedule ks;
  68         int i,length;
  69         register unsigned char j;
  70
  71         memset(key,0,8);
  72         length=strlen(str);
  73 #ifdef OLD_STR_TO_KEY
  74         for (i=0; i<length; i++)
  75                 (*key)[i%8]^=(str[i]<<1);
  76 #else /* MIT COMPATIBLE */
  77         for (i=0; i<length; i++)
  78                 {
  79                 j=str[i];
  80                 if ((i%16) < 8)
  81                         (*key)[i%8]^=(j<<1);
  82                 else
  83                         {
  84                         /* Reverse the bit order 05/05/92 eay */
  85                         j=((j<<4)&0xf0)|((j>>4)&0x0f);
  86                         j=((j<<2)&0xcc)|((j>>2)&0x33);
  87                         j=((j<<1)&0xaa)|((j>>1)&0x55);
  88                         (*key)[7-(i%8)]^=j;
  89                         }
  90                 }
  91 #endif
  92         des_set_odd_parity((des_cblock *)key);
  93         i=des_check_key;
  94         des_check_key=0;
  95         if(des_is_weak_key((des_cblock *)key))
  96             (*key)[7] ^= 0xF0;
  97         des_set_key((des_cblock *)key,ks);
  98         des_check_key=i;
  99         des_cbc_cksum((des_cblock *)str,(des_cblock *)key,(long)length,ks,
 100                 (des_cblock *)key);
 101         memset(ks,0,sizeof(ks));
 102         des_set_odd_parity((des_cblock *)key);
 103         }
 104
 105 void des_string_to_2keys(str, key1, key2)
 106 char *str;
 107 des_cblock (*key1);
 108 des_cblock (*key2);
 109         {
 110         des_key_schedule ks;
 111         int i,length;
 112         register unsigned char j;
 113
 114         memset(key1,0,8);
 115         memset(key2,0,8);
 116         length=strlen(str);
 117 #ifdef OLD_STR_TO_KEY
 118         if (length <= 8)
 119                 {
 120                 for (i=0; i<length; i++)
 121                         {
 122                         (*key2)[i]=(*key1)[i]=(str[i]<<1);
 123                         }
 124                 }
 125         else
 126                 {
 127                 for (i=0; i<length; i++)
 128                         {
 129                         if ((i/8)&1)
 130                                 (*key2)[i%8]^=(str[i]<<1);
 131                         else
 132                                 (*key1)[i%8]^=(str[i]<<1);
 133                         }
 134                 }
 135 #else /* MIT COMPATIBLE */
 136         for (i=0; i<length; i++)
 137                 {
 138                 j=str[i];
 139                 if ((i%32) < 16)
 140                         {
 141                         if ((i%16) < 8)
 142                                 (*key1)[i%8]^=(j<<1);
 143                         else
 144                                 (*key2)[i%8]^=(j<<1);
 145                         }
 146                 else
 147                         {
 148                         j=((j<<4)&0xf0)|((j>>4)&0x0f);
 149                         j=((j<<2)&0xcc)|((j>>2)&0x33);
 150                         j=((j<<1)&0xaa)|((j>>1)&0x55);
 151                         if ((i%16) < 8)
 152                                 (*key1)[7-(i%8)]^=j;
 153                         else
 154                                 (*key2)[7-(i%8)]^=j;
 155                         }
 156                 }
 157         if (length <= 8) memcpy(key2,key1,8);
 158 #endif
 159         des_set_odd_parity((des_cblock *)key1);
 160         des_set_odd_parity((des_cblock *)key2);
 161         i=des_check_key;
 162         des_check_key=0;
 163         if(des_is_weak_key((des_cblock *)key1))
 164             (*key1)[7] ^= 0xF0;
 165         des_set_key((des_cblock *)key1,ks);
 166         des_cbc_cksum((des_cblock *)str,(des_cblock *)key1,(long)length,ks,
 167                 (des_cblock *)key1);
 168         if(des_is_weak_key((des_cblock *)key2))
 169             (*key2)[7] ^= 0xF0;
 170         des_set_key((des_cblock *)key2,ks);
 171         des_cbc_cksum((des_cblock *)str,(des_cblock *)key2,(long)length,ks,
 172                 (des_cblock *)key2);
 173         des_check_key=i;
 174         memset(ks,0,sizeof(ks));
 175         des_set_odd_parity(key1);
 176         des_set_odd_parity(key2);
 177         }