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) 63extern "C" { 64#endif 65 66 67#define c2l(c, l) \ 68 (l = ((uint32_t)(*((c)++))), l |= ((uint32_t)(*((c)++))) << 8L, \ 69 l |= ((uint32_t)(*((c)++))) << 16L, l |= ((uint32_t)(*((c)++))) << 24L) 70 71#define l2c(l, c) \ 72 (*((c)++) = (unsigned char)(((l)) & 0xff), \ 73 *((c)++) = (unsigned char)(((l) >> 8L) & 0xff), \ 74 *((c)++) = (unsigned char)(((l) >> 16L) & 0xff), \ 75 *((c)++) = (unsigned char)(((l) >> 24L) & 0xff)) 76 77/* NOTE - c is not incremented as per c2l */ 78#define c2ln(c, l1, l2, n) \ 79 { \ 80 c += n; \ 81 l1 = l2 = 0; \ 82 switch (n) { \ 83 case 8: \ 84 l2 = ((uint32_t)(*(--(c)))) << 24L; \ 85 case 7: \ 86 l2 |= ((uint32_t)(*(--(c)))) << 16L; \ 87 case 6: \ 88 l2 |= ((uint32_t)(*(--(c)))) << 8L; \ 89 case 5: \ 90 l2 |= ((uint32_t)(*(--(c)))); \ 91 case 4: \ 92 l1 = ((uint32_t)(*(--(c)))) << 24L; \ 93 case 3: \ 94 l1 |= ((uint32_t)(*(--(c)))) << 16L; \ 95 case 2: \ 96 l1 |= ((uint32_t)(*(--(c)))) << 8L; \ 97 case 1: \ 98 l1 |= ((uint32_t)(*(--(c)))); \ 99 } \ 100 } 101 102/* NOTE - c is not incremented as per l2c */ 103#define l2cn(l1, l2, c, n) \ 104 { \ 105 c += n; \ 106 switch (n) { \ 107 case 8: \ 108 *(--(c)) = (unsigned char)(((l2) >> 24L) & 0xff); \ 109 case 7: \ 110 *(--(c)) = (unsigned char)(((l2) >> 16L) & 0xff); \ 111 case 6: \ 112 *(--(c)) = (unsigned char)(((l2) >> 8L) & 0xff); \ 113 case 5: \ 114 *(--(c)) = (unsigned char)(((l2)) & 0xff); \ 115 case 4: \ 116 *(--(c)) = (unsigned char)(((l1) >> 24L) & 0xff); \ 117 case 3: \ 118 *(--(c)) = (unsigned char)(((l1) >> 16L) & 0xff); \ 119 case 2: \ 120 *(--(c)) = (unsigned char)(((l1) >> 8L) & 0xff); \ 121 case 1: \ 122 *(--(c)) = (unsigned char)(((l1)) & 0xff); \ 123 } \ 124 } 125 126/* IP and FP 127 * The problem is more of a geometric problem that random bit fiddling. 128 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6 129 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4 13016 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2 13124 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0 132 13332 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7 13440 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5 13548 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3 13656 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1 137 138The output has been subject to swaps of the form 1390 1 -> 3 1 but the odd and even bits have been put into 1402 3 2 0 141different words. The main trick is to remember that 142t=((l>>size)^r)&(mask); 143r^=t; 144l^=(t<<size); 145can be used to swap and move bits between words. 146 147So l = 0 1 2 3 r = 16 17 18 19 148 4 5 6 7 20 21 22 23 149 8 9 10 11 24 25 26 27 150 12 13 14 15 28 29 30 31 151becomes (for size == 2 and mask == 0x3333) 152 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19 153 6^20 7^21 -- -- 4 5 20 21 6 7 22 23 154 10^24 11^25 -- -- 8 9 24 25 10 11 24 25 155 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 156 157Thanks for hints from Richard Outerbridge - he told me IP&FP 158could be done in 15 xor, 10 shifts and 5 ands. 159When I finally started to think of the problem in 2D 160I first got ~42 operations without xors. When I remembered 161how to use xors :-) I got it to its final state. 162*/ 163#define PERM_OP(a, b, t, n, m) \ 164 ((t) = ((((a) >> (n)) ^ (b)) & (m)), (b) ^= (t), (a) ^= ((t) << (n))) 165 166#define IP(l, r) \ 167 { \ 168 uint32_t tt; \ 169 PERM_OP(r, l, tt, 4, 0x0f0f0f0fL); \ 170 PERM_OP(l, r, tt, 16, 0x0000ffffL); \ 171 PERM_OP(r, l, tt, 2, 0x33333333L); \ 172 PERM_OP(l, r, tt, 8, 0x00ff00ffL); \ 173 PERM_OP(r, l, tt, 1, 0x55555555L); \ 174 } 175 176#define FP(l, r) \ 177 { \ 178 uint32_t tt; \ 179 PERM_OP(l, r, tt, 1, 0x55555555L); \ 180 PERM_OP(r, l, tt, 8, 0x00ff00ffL); \ 181 PERM_OP(l, r, tt, 2, 0x33333333L); \ 182 PERM_OP(r, l, tt, 16, 0x0000ffffL); \ 183 PERM_OP(l, r, tt, 4, 0x0f0f0f0fL); \ 184 } 185 186#define LOAD_DATA(R, S, u, t, E0, E1) \ 187 u = R ^ s[S]; \ 188 t = R ^ s[S + 1] 189 190#define D_ENCRYPT(LL, R, S) \ 191 { \ 192 LOAD_DATA(R, S, u, t, E0, E1); \ 193 t = ROTATE(t, 4); \ 194 LL ^= \ 195 DES_SPtrans[0][(u >> 2L) & 0x3f] ^ DES_SPtrans[2][(u >> 10L) & 0x3f] ^ \ 196 DES_SPtrans[4][(u >> 18L) & 0x3f] ^ \ 197 DES_SPtrans[6][(u >> 26L) & 0x3f] ^ DES_SPtrans[1][(t >> 2L) & 0x3f] ^ \ 198 DES_SPtrans[3][(t >> 10L) & 0x3f] ^ \ 199 DES_SPtrans[5][(t >> 18L) & 0x3f] ^ DES_SPtrans[7][(t >> 26L) & 0x3f]; \ 200 } 201 202#define ITERATIONS 16 203#define HALF_ITERATIONS 8 204 205#if defined(_MSC_VER) 206#define ROTATE(a, n) (_lrotr(a, n)) 207#elif defined(__ICC) 208#define ROTATE(a, n) (_rotr(a, n)) 209#elif defined(__GNUC__) && __GNUC__ >= 2 && !defined(OPENSSL_NO_ASM) && \ 210 !defined(__STRICT_ANSI__) && \ 211 (defined(OPENSSL_X86) || defined(OPENSSL_X86_64)) 212#define ROTATE(a, n) \ 213 ({ \ 214 unsigned int ret; \ 215 asm("rorl %1,%0" : "=r"(ret) : "I"(n), "0"(a) : "cc"); \ 216 ret; \ 217 }) 218#endif 219 220#ifndef ROTATE 221#define ROTATE(a, n) (((a) >> (n)) + ((a) << (32 - (n)))) 222#endif 223 224 225#if defined(__cplusplus) 226} /* extern C */ 227#endif 228 229#endif /* OPENSSL_HEADER_DES_INTERNAL_H */ 230