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