1 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
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.
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).
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.
22 * Redistribution and use in source and binary forms, with or without
23 * modification, are permitted provided that the following conditions
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)"
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
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.]
58 #ifndef HEADER_DES_LOCL_H
59 # define HEADER_DES_LOCL_H
61 # include <openssl/e_os2.h>
67 # include <openssl/des.h>
69 # ifdef OPENSSL_BUILD_SHLIBCRYPTO
70 # undef OPENSSL_EXTERN
71 # define OPENSSL_EXTERN OPENSSL_EXPORT
74 # define ITERATIONS 16
75 # define HALF_ITERATIONS 8
77 /* used in des_read and des_write */
78 # define MAXWRITE (1024*16)
79 # define BSIZE (MAXWRITE+4)
81 # define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \
82 l|=((DES_LONG)(*((c)++)))<< 8L, \
83 l|=((DES_LONG)(*((c)++)))<<16L, \
84 l|=((DES_LONG)(*((c)++)))<<24L)
86 /* NOTE - c is not incremented as per c2l */
87 # define c2ln(c,l1,l2,n) { \
91 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \
92 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \
93 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \
94 case 5: l2|=((DES_LONG)(*(--(c)))); \
95 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
96 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
97 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
98 case 1: l1|=((DES_LONG)(*(--(c)))); \
102 # define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
103 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
104 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
105 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
108 * replacements for htonl and ntohl since I have no idea what to do when
109 * faced with machines with 8 byte longs.
113 # define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \
114 l|=((DES_LONG)(*((c)++)))<<16L, \
115 l|=((DES_LONG)(*((c)++)))<< 8L, \
116 l|=((DES_LONG)(*((c)++))))
118 # define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
119 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
120 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
121 *((c)++)=(unsigned char)(((l) )&0xff))
123 /* NOTE - c is not incremented as per l2c */
124 # define l2cn(l1,l2,c,n) { \
127 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
128 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
129 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
130 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
131 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
132 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
133 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
134 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
138 # if (defined(OPENSSL_SYS_WIN32) && defined(_MSC_VER))
139 # define ROTATE(a,n) (_lrotr(a,n))
140 # elif defined(__ICC)
141 # define ROTATE(a,n) (_rotr(a,n))
142 # elif defined(__GNUC__) && __GNUC__>=2 && !defined(__STRICT_ANSI__) && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) && !defined(PEDANTIC)
143 # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
144 # define ROTATE(a,n) ({ register unsigned int ret; \
154 # define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n))))
158 * Don't worry about the LOAD_DATA() stuff, that is used by fcrypt() to add
159 * it's little bit to the front
164 # define LOAD_DATA_tmp(R,S,u,t,E0,E1) \
165 { DES_LONG tmp; LOAD_DATA(R,S,u,t,E0,E1,tmp); }
167 # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
170 tmp=(u<<16); u^=R^s[S ]; u^=tmp; \
171 tmp=(t<<16); t^=R^s[S+1]; t^=tmp
173 # define LOAD_DATA_tmp(a,b,c,d,e,f) LOAD_DATA(a,b,c,d,e,f,g)
174 # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
180 * It recently occurred to me that 0^0^0^0^0^0^0 == 0, so there is no reason
181 * to not xor all the sub items together. This potentially saves a register
182 * since things can be xored directly into L
185 # define D_ENCRYPT(LL,R,S) { \
186 LOAD_DATA_tmp(R,S,u,t,E0,E1); \
189 DES_SPtrans[0][(u>> 2L)&0x3f]^ \
190 DES_SPtrans[2][(u>>10L)&0x3f]^ \
191 DES_SPtrans[4][(u>>18L)&0x3f]^ \
192 DES_SPtrans[6][(u>>26L)&0x3f]^ \
193 DES_SPtrans[1][(t>> 2L)&0x3f]^ \
194 DES_SPtrans[3][(t>>10L)&0x3f]^ \
195 DES_SPtrans[5][(t>>18L)&0x3f]^ \
196 DES_SPtrans[7][(t>>26L)&0x3f]; }
200 * The problem is more of a geometric problem that random bit fiddling.
201 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6
202 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4
203 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2
204 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0
206 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7
207 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5
208 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3
209 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1
211 The output has been subject to swaps of the form
212 0 1 -> 3 1 but the odd and even bits have been put into
214 different words. The main trick is to remember that
215 t=((l>>size)^r)&(mask);
218 can be used to swap and move bits between words.
220 So l = 0 1 2 3 r = 16 17 18 19
222 8 9 10 11 24 25 26 27
223 12 13 14 15 28 29 30 31
224 becomes (for size == 2 and mask == 0x3333)
225 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19
226 6^20 7^21 -- -- 4 5 20 21 6 7 22 23
227 10^24 11^25 -- -- 8 9 24 25 10 11 24 25
228 14^28 15^29 -- -- 12 13 28 29 14 15 28 29
230 Thanks for hints from Richard Outerbridge - he told me IP&FP
231 could be done in 15 xor, 10 shifts and 5 ands.
232 When I finally started to think of the problem in 2D
233 I first got ~42 operations without xors. When I remembered
234 how to use xors :-) I got it to its final state.
236 # define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
242 register DES_LONG tt; \
243 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
244 PERM_OP(l,r,tt,16,0x0000ffffL); \
245 PERM_OP(r,l,tt, 2,0x33333333L); \
246 PERM_OP(l,r,tt, 8,0x00ff00ffL); \
247 PERM_OP(r,l,tt, 1,0x55555555L); \
252 register DES_LONG tt; \
253 PERM_OP(l,r,tt, 1,0x55555555L); \
254 PERM_OP(r,l,tt, 8,0x00ff00ffL); \
255 PERM_OP(l,r,tt, 2,0x33333333L); \
256 PERM_OP(r,l,tt,16,0x0000ffffL); \
257 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \
260 extern const DES_LONG DES_SPtrans[8][64];
262 void fcrypt_body(DES_LONG *out, DES_key_schedule *ks,
263 DES_LONG Eswap0, DES_LONG Eswap1);