diff options
Diffstat (limited to '')
| -rw-r--r-- | src/lib/libcrypto/des/str2key.c | 171 |
1 files changed, 171 insertions, 0 deletions
diff --git a/src/lib/libcrypto/des/str2key.c b/src/lib/libcrypto/des/str2key.c new file mode 100644 index 0000000000..3365c1bcf3 --- /dev/null +++ b/src/lib/libcrypto/des/str2key.c | |||
| @@ -0,0 +1,171 @@ | |||
| 1 | /* crypto/des/str2key.c */ | ||
| 2 | /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) | ||
| 3 | * All rights reserved. | ||
| 4 | * | ||
| 5 | * This package is an SSL implementation written | ||
| 6 | * by Eric Young (eay@cryptsoft.com). | ||
| 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@cryptsoft.com). | ||
| 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@cryptsoft.com)" | ||
| 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@cryptsoft.com)" | ||
| 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 | des_set_key((des_cblock *)key,ks); | ||
| 96 | des_check_key=i; | ||
| 97 | des_cbc_cksum((des_cblock *)str,(des_cblock *)key,(long)length,ks, | ||
| 98 | (des_cblock *)key); | ||
| 99 | memset(ks,0,sizeof(ks)); | ||
| 100 | des_set_odd_parity((des_cblock *)key); | ||
| 101 | } | ||
| 102 | |||
| 103 | void des_string_to_2keys(str, key1, key2) | ||
| 104 | char *str; | ||
| 105 | des_cblock (*key1); | ||
| 106 | des_cblock (*key2); | ||
| 107 | { | ||
| 108 | des_key_schedule ks; | ||
| 109 | int i,length; | ||
| 110 | register unsigned char j; | ||
| 111 | |||
| 112 | memset(key1,0,8); | ||
| 113 | memset(key2,0,8); | ||
| 114 | length=strlen(str); | ||
| 115 | #ifdef OLD_STR_TO_KEY | ||
| 116 | if (length <= 8) | ||
| 117 | { | ||
| 118 | for (i=0; i<length; i++) | ||
| 119 | { | ||
| 120 | (*key2)[i]=(*key1)[i]=(str[i]<<1); | ||
| 121 | } | ||
| 122 | } | ||
| 123 | else | ||
| 124 | { | ||
| 125 | for (i=0; i<length; i++) | ||
| 126 | { | ||
| 127 | if ((i/8)&1) | ||
| 128 | (*key2)[i%8]^=(str[i]<<1); | ||
| 129 | else | ||
| 130 | (*key1)[i%8]^=(str[i]<<1); | ||
| 131 | } | ||
| 132 | } | ||
| 133 | #else /* MIT COMPATIBLE */ | ||
| 134 | for (i=0; i<length; i++) | ||
| 135 | { | ||
| 136 | j=str[i]; | ||
| 137 | if ((i%32) < 16) | ||
| 138 | { | ||
| 139 | if ((i%16) < 8) | ||
| 140 | (*key1)[i%8]^=(j<<1); | ||
| 141 | else | ||
| 142 | (*key2)[i%8]^=(j<<1); | ||
| 143 | } | ||
| 144 | else | ||
| 145 | { | ||
| 146 | j=((j<<4)&0xf0)|((j>>4)&0x0f); | ||
| 147 | j=((j<<2)&0xcc)|((j>>2)&0x33); | ||
| 148 | j=((j<<1)&0xaa)|((j>>1)&0x55); | ||
| 149 | if ((i%16) < 8) | ||
| 150 | (*key1)[7-(i%8)]^=j; | ||
| 151 | else | ||
| 152 | (*key2)[7-(i%8)]^=j; | ||
| 153 | } | ||
| 154 | } | ||
| 155 | if (length <= 8) memcpy(key2,key1,8); | ||
| 156 | #endif | ||
| 157 | des_set_odd_parity((des_cblock *)key1); | ||
| 158 | des_set_odd_parity((des_cblock *)key2); | ||
| 159 | i=des_check_key; | ||
| 160 | des_check_key=0; | ||
| 161 | des_set_key((des_cblock *)key1,ks); | ||
| 162 | des_cbc_cksum((des_cblock *)str,(des_cblock *)key1,(long)length,ks, | ||
| 163 | (des_cblock *)key1); | ||
| 164 | des_set_key((des_cblock *)key2,ks); | ||
| 165 | des_cbc_cksum((des_cblock *)str,(des_cblock *)key2,(long)length,ks, | ||
| 166 | (des_cblock *)key2); | ||
| 167 | des_check_key=i; | ||
| 168 | memset(ks,0,sizeof(ks)); | ||
| 169 | des_set_odd_parity(key1); | ||
| 170 | des_set_odd_parity(key2); | ||
| 171 | } | ||
