1 /* Copyright (C) 1995-1998 Eric Young (eay@cryptsoft.com) 2 * All rights reserved. 3 * 4 * This package is an SSL implementation written 5 * by Eric Young (eay@cryptsoft.com). 6 * The implementation was written so as to conform with Netscapes SSL. 7 * 8 * This library is free for commercial and non-commercial use as long as 9 * the following conditions are aheared to. The following conditions 10 * apply to all code found in this distribution, be it the RC4, RSA, 11 * lhash, DES, etc., code; not just the SSL code. The SSL documentation 12 * included with this distribution is covered by the same copyright terms 13 * except that the holder is Tim Hudson (tjh@cryptsoft.com). 14 * 15 * Copyright remains Eric Young's, and as such any Copyright notices in 16 * the code are not to be removed. 17 * If this package is used in a product, Eric Young should be given attribution 18 * as the author of the parts of the library used. 19 * This can be in the form of a textual message at program startup or 20 * in documentation (online or textual) provided with the package. 21 * 22 * Redistribution and use in source and binary forms, with or without 23 * modification, are permitted provided that the following conditions 24 * are met: 25 * 1. Redistributions of source code must retain the copyright 26 * notice, this list of conditions and the following disclaimer. 27 * 2. Redistributions in binary form must reproduce the above copyright 28 * notice, this list of conditions and the following disclaimer in the 29 * documentation and/or other materials provided with the distribution. 30 * 3. All advertising materials mentioning features or use of this software 31 * must display the following acknowledgement: 32 * "This product includes cryptographic software written by 33 * Eric Young (eay@cryptsoft.com)" 34 * The word 'cryptographic' can be left out if the rouines from the library 35 * being used are not cryptographic related :-). 36 * 4. If you include any Windows specific code (or a derivative thereof) from 37 * the apps directory (application code) you must include an acknowledgement: 38 * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" 39 * 40 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 41 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 42 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 43 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 44 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 45 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 46 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 47 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 48 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 49 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 50 * SUCH DAMAGE. 51 * 52 * The licence and distribution terms for any publically available version or 53 * derivative of this code cannot be changed. i.e. this code cannot simply be 54 * copied and put under another distribution licence 55 * [including the GNU Public Licence.] */ 56 57 #ifndef OPENSSL_HEADER_DES_INTERNAL_H 58 #define OPENSSL_HEADER_DES_INTERNAL_H 59 60 #include <openssl/base.h> 61 62 #if defined(__cplusplus) 63 extern "C" { 64 #endif 65 66 67 #define c2l(c, l) \ 68 do { \ 69 (l) = ((uint32_t)(*((c)++))); \ 70 (l) |= ((uint32_t)(*((c)++))) << 8L; \ 71 (l) |= ((uint32_t)(*((c)++))) << 16L; \ 72 (l) |= ((uint32_t)(*((c)++))) << 24L; \ 73 } while (0) 74 75 #define l2c(l, c) \ 76 do { \ 77 *((c)++) = (unsigned char)(((l)) & 0xff); \ 78 *((c)++) = (unsigned char)(((l) >> 8L) & 0xff); \ 79 *((c)++) = (unsigned char)(((l) >> 16L) & 0xff); \ 80 *((c)++) = (unsigned char)(((l) >> 24L) & 0xff); \ 81 } while (0) 82 83 /* NOTE - c is not incremented as per c2l */ 84 #define c2ln(c, l1, l2, n) \ 85 do { \ 86 (c) += (n); \ 87 (l1) = (l2) = 0; \ 88 switch (n) { \ 89 case 8: \ 90 (l2) = ((uint32_t)(*(--(c)))) << 24L; \ 91 case 7: \ 92 (l2) |= ((uint32_t)(*(--(c)))) << 16L; \ 93 case 6: \ 94 (l2) |= ((uint32_t)(*(--(c)))) << 8L; \ 95 case 5: \ 96 (l2) |= ((uint32_t)(*(--(c)))); \ 97 case 4: \ 98 (l1) = ((uint32_t)(*(--(c)))) << 24L; \ 99 case 3: \ 100 (l1) |= ((uint32_t)(*(--(c)))) << 16L; \ 101 case 2: \ 102 (l1) |= ((uint32_t)(*(--(c)))) << 8L; \ 103 case 1: \ 104 (l1) |= ((uint32_t)(*(--(c)))); \ 105 } \ 106 } while (0) 107 108 /* NOTE - c is not incremented as per l2c */ 109 #define l2cn(l1, l2, c, n) \ 110 do { \ 111 (c) += (n); \ 112 switch (n) { \ 113 case 8: \ 114 *(--(c)) = (unsigned char)(((l2) >> 24L) & 0xff); \ 115 case 7: \ 116 *(--(c)) = (unsigned char)(((l2) >> 16L) & 0xff); \ 117 case 6: \ 118 *(--(c)) = (unsigned char)(((l2) >> 8L) & 0xff); \ 119 case 5: \ 120 *(--(c)) = (unsigned char)(((l2)) & 0xff); \ 121 case 4: \ 122 *(--(c)) = (unsigned char)(((l1) >> 24L) & 0xff); \ 123 case 3: \ 124 *(--(c)) = (unsigned char)(((l1) >> 16L) & 0xff); \ 125 case 2: \ 126 *(--(c)) = (unsigned char)(((l1) >> 8L) & 0xff); \ 127 case 1: \ 128 *(--(c)) = (unsigned char)(((l1)) & 0xff); \ 129 } \ 130 } while (0) 131 132 /* IP and FP 133 * The problem is more of a geometric problem that random bit fiddling. 134 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6 135 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4 136 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2 137 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0 138 139 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7 140 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5 141 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3 142 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1 143 144 The output has been subject to swaps of the form 145 0 1 -> 3 1 but the odd and even bits have been put into 146 2 3 2 0 147 different words. The main trick is to remember that 148 t=((l>>size)^r)&(mask); 149 r^=t; 150 l^=(t<<size); 151 can be used to swap and move bits between words. 152 153 So l = 0 1 2 3 r = 16 17 18 19 154 4 5 6 7 20 21 22 23 155 8 9 10 11 24 25 26 27 156 12 13 14 15 28 29 30 31 157 becomes (for size == 2 and mask == 0x3333) 158 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19 159 6^20 7^21 -- -- 4 5 20 21 6 7 22 23 160 10^24 11^25 -- -- 8 9 24 25 10 11 24 25 161 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 162 163 Thanks for hints from Richard Outerbridge - he told me IP&FP 164 could be done in 15 xor, 10 shifts and 5 ands. 165 When I finally started to think of the problem in 2D 166 I first got ~42 operations without xors. When I remembered 167 how to use xors :-) I got it to its final state. 168 */ 169 #define PERM_OP(a, b, t, n, m) \ 170 do { \ 171 (t) = ((((a) >> (n)) ^ (b)) & (m)); \ 172 (b) ^= (t); \ 173 (a) ^= ((t) << (n)); \ 174 } while (0) 175 176 #define IP(l, r) \ 177 do { \ 178 uint32_t tt; \ 179 PERM_OP(r, l, tt, 4, 0x0f0f0f0fL); \ 180 PERM_OP(l, r, tt, 16, 0x0000ffffL); \ 181 PERM_OP(r, l, tt, 2, 0x33333333L); \ 182 PERM_OP(l, r, tt, 8, 0x00ff00ffL); \ 183 PERM_OP(r, l, tt, 1, 0x55555555L); \ 184 } while (0) 185 186 #define FP(l, r) \ 187 do { \ 188 uint32_t tt; \ 189 PERM_OP(l, r, tt, 1, 0x55555555L); \ 190 PERM_OP(r, l, tt, 8, 0x00ff00ffL); \ 191 PERM_OP(l, r, tt, 2, 0x33333333L); \ 192 PERM_OP(r, l, tt, 16, 0x0000ffffL); \ 193 PERM_OP(l, r, tt, 4, 0x0f0f0f0fL); \ 194 } while (0) 195 196 #define LOAD_DATA(ks, R, S, u, t, E0, E1) \ 197 do { \ 198 (u) = (R) ^ (ks)->subkeys[S][0]; \ 199 (t) = (R) ^ (ks)->subkeys[S][1]; \ 200 } while (0) 201 202 #define D_ENCRYPT(ks, LL, R, S) \ 203 do { \ 204 LOAD_DATA(ks, R, S, u, t, E0, E1); \ 205 t = ROTATE(t, 4); \ 206 (LL) ^= \ 207 DES_SPtrans[0][(u >> 2L) & 0x3f] ^ DES_SPtrans[2][(u >> 10L) & 0x3f] ^ \ 208 DES_SPtrans[4][(u >> 18L) & 0x3f] ^ \ 209 DES_SPtrans[6][(u >> 26L) & 0x3f] ^ DES_SPtrans[1][(t >> 2L) & 0x3f] ^ \ 210 DES_SPtrans[3][(t >> 10L) & 0x3f] ^ \ 211 DES_SPtrans[5][(t >> 18L) & 0x3f] ^ DES_SPtrans[7][(t >> 26L) & 0x3f]; \ 212 } while (0) 213 214 #define ITERATIONS 16 215 #define HALF_ITERATIONS 8 216 217 #define ROTATE(a, n) (((a) >> (n)) + ((a) << (32 - (n)))) 218 219 220 #if defined(__cplusplus) 221 } /* extern C */ 222 #endif 223 224 #endif /* OPENSSL_HEADER_DES_INTERNAL_H */ 225