1 /* crypto/des/des_locl.h */
2 /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com)
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.
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).
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.
23 * Redistribution and use in source and binary forms, with or without
24 * modification, are permitted provided that the following conditions
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)"
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
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.]
59 #ifndef HEADER_DES_LOCL_H
60 #define HEADER_DES_LOCL_H
62 #if defined(WIN32) || defined(WIN16)
71 #include <openssl/opensslconf.h>
74 #if !defined(VMS) || defined(__DECC)
75 #include OPENSSL_UNISTD
78 #include <openssl/des.h>
80 #ifdef MSDOS /* Visual C++ 2.1 (Windows NT/95) */
95 #if __CRTL_VER < 70000000
101 #if defined(__STDC__) || defined(VMS) || defined(M_XENIX) || defined(MSDOS)
119 #define srandom(s) srand(s)
123 #define ITERATIONS 16
124 #define HALF_ITERATIONS 8
126 /* used in des_read and des_write */
127 #define MAXWRITE (1024*16)
128 #define BSIZE (MAXWRITE+4)
130 #define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \
131 l|=((DES_LONG)(*((c)++)))<< 8L, \
132 l|=((DES_LONG)(*((c)++)))<<16L, \
133 l|=((DES_LONG)(*((c)++)))<<24L)
135 /* NOTE - c is not incremented as per c2l */
136 #define c2ln(c,l1,l2,n) { \
140 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \
141 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \
142 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \
143 case 5: l2|=((DES_LONG)(*(--(c)))); \
144 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
145 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
146 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
147 case 1: l1|=((DES_LONG)(*(--(c)))); \
151 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
152 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
153 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
154 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
156 /* replacements for htonl and ntohl since I have no idea what to do
157 * when faced with machines with 8 byte longs. */
160 #define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \
161 l|=((DES_LONG)(*((c)++)))<<16L, \
162 l|=((DES_LONG)(*((c)++)))<< 8L, \
163 l|=((DES_LONG)(*((c)++))))
165 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
166 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
167 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
168 *((c)++)=(unsigned char)(((l) )&0xff))
170 /* NOTE - c is not incremented as per l2c */
171 #define l2cn(l1,l2,c,n) { \
174 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
175 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
176 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
177 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
178 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
179 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
180 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
181 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
186 #define ROTATE(a,n) (_lrotr(a,n))
188 #define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n))))
191 /* Don't worry about the LOAD_DATA() stuff, that is used by
192 * fcrypt() to add it's little bit to the front */
196 #define LOAD_DATA_tmp(R,S,u,t,E0,E1) \
197 { DES_LONG tmp; LOAD_DATA(R,S,u,t,E0,E1,tmp); }
199 #define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
202 tmp=(u<<16); u^=R^s[S ]; u^=tmp; \
203 tmp=(t<<16); t^=R^s[S+1]; t^=tmp
205 #define LOAD_DATA_tmp(a,b,c,d,e,f) LOAD_DATA(a,b,c,d,e,f,g)
206 #define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
211 /* The changes to this macro may help or hinder, depending on the
212 * compiler and the achitecture. gcc2 always seems to do well :-).
213 * Inspired by Dana How <how@isl.stanford.edu>
214 * DO NOT use the alternative version on machines with 8 byte longs.
215 * It does not seem to work on the Alpha, even when DES_LONG is 4
216 * bytes, probably an issue of accessing non-word aligned objects :-( */
219 /* It recently occured to me that 0^0^0^0^0^0^0 == 0, so there
220 * is no reason to not xor all the sub items together. This potentially
221 * saves a register since things can be xored directly into L */
223 #if defined(DES_RISC1) || defined(DES_RISC2)
225 #define D_ENCRYPT(LL,R,S) { \
226 unsigned int u1,u2,u3; \
227 LOAD_DATA(R,S,u,t,E0,E1,u1); \
233 LL^= *(const DES_LONG *)(des_SP +u1); \
234 LL^= *(const DES_LONG *)(des_SP+0x200+u2); \
238 LL^= *(const DES_LONG *)(des_SP+0x400+u1); \
239 LL^= *(const DES_LONG *)(des_SP+0x600+u3); \
244 LL^= *(const DES_LONG *)(des_SP+0x100+u1); \
245 LL^= *(const DES_LONG *)(des_SP+0x300+u2); \
249 LL^= *(const DES_LONG *)(des_SP+0x500+u1); \
250 LL^= *(const DES_LONG *)(des_SP+0x700+u3); }
253 #define D_ENCRYPT(LL,R,S) { \
254 unsigned int u1,u2,s1,s2; \
255 LOAD_DATA(R,S,u,t,E0,E1,u1); \
260 LL^= *(const DES_LONG *)(des_SP +u1); \
261 LL^= *(const DES_LONG *)(des_SP+0x200+u2); \
266 LL^= *(const DES_LONG *)(des_SP+0x400+s1); \
267 LL^= *(const DES_LONG *)(des_SP+0x600+s2); \
271 LL^= *(const DES_LONG *)(des_SP+0x100+u1); \
272 LL^= *(const DES_LONG *)(des_SP+0x300+u2); \
277 LL^= *(const DES_LONG *)(des_SP+0x500+s1); \
278 LL^= *(const DES_LONG *)(des_SP+0x700+s2); }
281 #define D_ENCRYPT(LL,R,S) { \
282 LOAD_DATA_tmp(R,S,u,t,E0,E1); \
285 *(const DES_LONG *)(des_SP +((u )&0xfc))^ \
286 *(const DES_LONG *)(des_SP+0x200+((u>> 8L)&0xfc))^ \
287 *(const DES_LONG *)(des_SP+0x400+((u>>16L)&0xfc))^ \
288 *(const DES_LONG *)(des_SP+0x600+((u>>24L)&0xfc))^ \
289 *(const DES_LONG *)(des_SP+0x100+((t )&0xfc))^ \
290 *(const DES_LONG *)(des_SP+0x300+((t>> 8L)&0xfc))^ \
291 *(const DES_LONG *)(des_SP+0x500+((t>>16L)&0xfc))^ \
292 *(const DES_LONG *)(des_SP+0x700+((t>>24L)&0xfc)); }
295 #else /* original version */
297 #if defined(DES_RISC1) || defined(DES_RISC2)
299 #define D_ENCRYPT(LL,R,S) {\
300 unsigned int u1,u2,u3; \
301 LOAD_DATA(R,S,u,t,E0,E1,u1); \
308 LL^=des_SPtrans[0][u1]; \
309 LL^=des_SPtrans[2][u2]; \
313 LL^=des_SPtrans[4][u1]; \
314 LL^=des_SPtrans[6][u3]; \
319 LL^=des_SPtrans[1][u1]; \
320 LL^=des_SPtrans[3][u2]; \
324 LL^=des_SPtrans[5][u1]; \
325 LL^=des_SPtrans[7][u3]; }
328 #define D_ENCRYPT(LL,R,S) {\
329 unsigned int u1,u2,s1,s2; \
330 LOAD_DATA(R,S,u,t,E0,E1,u1); \
336 LL^=des_SPtrans[0][u1]; \
337 LL^=des_SPtrans[2][u2]; \
342 LL^=des_SPtrans[4][s1]; \
343 LL^=des_SPtrans[6][s2]; \
347 LL^=des_SPtrans[1][u1]; \
348 LL^=des_SPtrans[3][u2]; \
353 LL^=des_SPtrans[5][s1]; \
354 LL^=des_SPtrans[7][s2]; }
359 #define D_ENCRYPT(LL,R,S) {\
360 LOAD_DATA_tmp(R,S,u,t,E0,E1); \
363 des_SPtrans[0][(u>> 2L)&0x3f]^ \
364 des_SPtrans[2][(u>>10L)&0x3f]^ \
365 des_SPtrans[4][(u>>18L)&0x3f]^ \
366 des_SPtrans[6][(u>>26L)&0x3f]^ \
367 des_SPtrans[1][(t>> 2L)&0x3f]^ \
368 des_SPtrans[3][(t>>10L)&0x3f]^ \
369 des_SPtrans[5][(t>>18L)&0x3f]^ \
370 des_SPtrans[7][(t>>26L)&0x3f]; }
375 * The problem is more of a geometric problem that random bit fiddling.
376 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6
377 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4
378 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2
379 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0
381 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7
382 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5
383 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3
384 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1
386 The output has been subject to swaps of the form
387 0 1 -> 3 1 but the odd and even bits have been put into
389 different words. The main trick is to remember that
390 t=((l>>size)^r)&(mask);
393 can be used to swap and move bits between words.
395 So l = 0 1 2 3 r = 16 17 18 19
397 8 9 10 11 24 25 26 27
398 12 13 14 15 28 29 30 31
399 becomes (for size == 2 and mask == 0x3333)
400 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19
401 6^20 7^21 -- -- 4 5 20 21 6 7 22 23
402 10^24 11^25 -- -- 8 9 24 25 10 11 24 25
403 14^28 15^29 -- -- 12 13 28 29 14 15 28 29
405 Thanks for hints from Richard Outerbridge - he told me IP&FP
406 could be done in 15 xor, 10 shifts and 5 ands.
407 When I finally started to think of the problem in 2D
408 I first got ~42 operations without xors. When I remembered
409 how to use xors :-) I got it to its final state.
411 #define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
417 register DES_LONG tt; \
418 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
419 PERM_OP(l,r,tt,16,0x0000ffffL); \
420 PERM_OP(r,l,tt, 2,0x33333333L); \
421 PERM_OP(l,r,tt, 8,0x00ff00ffL); \
422 PERM_OP(r,l,tt, 1,0x55555555L); \
427 register DES_LONG tt; \
428 PERM_OP(l,r,tt, 1,0x55555555L); \
429 PERM_OP(r,l,tt, 8,0x00ff00ffL); \
430 PERM_OP(l,r,tt, 2,0x33333333L); \
431 PERM_OP(r,l,tt,16,0x0000ffffL); \
432 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \
435 OPENSSL_EXTERN const DES_LONG des_SPtrans[8][64];
437 void fcrypt_body(DES_LONG *out,des_key_schedule ks,
438 DES_LONG Eswap0, DES_LONG Eswap1);