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 # include <openssl/e_os2.h>
64 # include "internal/des_conf.h"
66 # if defined(OPENSSL_SYS_WIN32)
67 # ifndef OPENSSL_SYS_MSDOS
68 # define OPENSSL_SYS_MSDOS
75 # ifndef OPENSSL_SYS_MSDOS
76 # if !defined(OPENSSL_SYS_VMS) || defined(__DECC)
77 # ifdef OPENSSL_UNISTD
78 # include OPENSSL_UNISTD
85 # include <openssl/des.h>
87 # ifdef OPENSSL_SYS_MSDOS /* Visual C++ 2.1 (Windows NT/95) */
94 # if defined(__STDC__) || defined(OPENSSL_SYS_VMS) || defined(M_XENIX) || defined(OPENSSL_SYS_MSDOS)
98 # ifdef OPENSSL_BUILD_SHLIBCRYPTO
99 # undef OPENSSL_EXTERN
100 # define OPENSSL_EXTERN OPENSSL_EXPORT
103 # define ITERATIONS 16
104 # define HALF_ITERATIONS 8
106 /* used in des_read and des_write */
107 # define MAXWRITE (1024*16)
108 # define BSIZE (MAXWRITE+4)
110 # define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \
111 l|=((DES_LONG)(*((c)++)))<< 8L, \
112 l|=((DES_LONG)(*((c)++)))<<16L, \
113 l|=((DES_LONG)(*((c)++)))<<24L)
115 /* NOTE - c is not incremented as per c2l */
116 # define c2ln(c,l1,l2,n) { \
120 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \
121 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \
122 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \
123 case 5: l2|=((DES_LONG)(*(--(c)))); \
124 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
125 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
126 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
127 case 1: l1|=((DES_LONG)(*(--(c)))); \
131 # define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
132 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
133 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
134 *((c)++)=(unsigned char)(((l)>>24L)&0xff))
137 * replacements for htonl and ntohl since I have no idea what to do when
138 * faced with machines with 8 byte longs.
142 # define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \
143 l|=((DES_LONG)(*((c)++)))<<16L, \
144 l|=((DES_LONG)(*((c)++)))<< 8L, \
145 l|=((DES_LONG)(*((c)++))))
147 # define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
148 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
149 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
150 *((c)++)=(unsigned char)(((l) )&0xff))
152 /* NOTE - c is not incremented as per l2c */
153 # define l2cn(l1,l2,c,n) { \
156 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
157 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
158 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
159 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
160 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
161 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
162 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
163 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
167 # if (defined(OPENSSL_SYS_WIN32) && defined(_MSC_VER))
168 # define ROTATE(a,n) (_lrotr(a,n))
169 # elif defined(__ICC)
170 # define ROTATE(a,n) (_rotr(a,n))
171 # elif defined(__GNUC__) && __GNUC__>=2 && !defined(__STRICT_ANSI__) && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) && !defined(PEDANTIC)
172 # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__)
173 # define ROTATE(a,n) ({ register unsigned int ret; \
183 # define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n))))
187 * Don't worry about the LOAD_DATA() stuff, that is used by fcrypt() to add
188 * it's little bit to the front
193 # define LOAD_DATA_tmp(R,S,u,t,E0,E1) \
194 { DES_LONG tmp; LOAD_DATA(R,S,u,t,E0,E1,tmp); }
196 # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
199 tmp=(u<<16); u^=R^s[S ]; u^=tmp; \
200 tmp=(t<<16); t^=R^s[S+1]; t^=tmp
202 # define LOAD_DATA_tmp(a,b,c,d,e,f) LOAD_DATA(a,b,c,d,e,f,g)
203 # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
209 * The changes to this macro may help or hinder, depending on the compiler
210 * and the architecture. gcc2 always seems to do well :-). Inspired by Dana
211 * How <how@isl.stanford.edu> DO NOT use the alternative version on machines
212 * with 8 byte longs. It does not seem to work on the Alpha, even when
213 * DES_LONG is 4 bytes, probably an issue of accessing non-word aligned
219 * It recently occurred to me that 0^0^0^0^0^0^0 == 0, so there is no reason
220 * to not xor all the sub items together. This potentially saves a register
221 * since things can be xored directly into L
224 # if defined(DES_RISC1) || defined(DES_RISC2)
226 # define D_ENCRYPT(LL,R,S) { \
227 unsigned int u1,u2,u3; \
228 LOAD_DATA(R,S,u,t,E0,E1,u1); \
234 LL^= *(const DES_LONG *)(des_SP +u1); \
235 LL^= *(const DES_LONG *)(des_SP+0x200+u2); \
239 LL^= *(const DES_LONG *)(des_SP+0x400+u1); \
240 LL^= *(const DES_LONG *)(des_SP+0x600+u3); \
245 LL^= *(const DES_LONG *)(des_SP+0x100+u1); \
246 LL^= *(const DES_LONG *)(des_SP+0x300+u2); \
250 LL^= *(const DES_LONG *)(des_SP+0x500+u1); \
251 LL^= *(const DES_LONG *)(des_SP+0x700+u3); }
254 # define D_ENCRYPT(LL,R,S) { \
255 unsigned int u1,u2,s1,s2; \
256 LOAD_DATA(R,S,u,t,E0,E1,u1); \
261 LL^= *(const DES_LONG *)(des_SP +u1); \
262 LL^= *(const DES_LONG *)(des_SP+0x200+u2); \
267 LL^= *(const DES_LONG *)(des_SP+0x400+s1); \
268 LL^= *(const DES_LONG *)(des_SP+0x600+s2); \
272 LL^= *(const DES_LONG *)(des_SP+0x100+u1); \
273 LL^= *(const DES_LONG *)(des_SP+0x300+u2); \
278 LL^= *(const DES_LONG *)(des_SP+0x500+s1); \
279 LL^= *(const DES_LONG *)(des_SP+0x700+s2); }
282 # define D_ENCRYPT(LL,R,S) { \
283 LOAD_DATA_tmp(R,S,u,t,E0,E1); \
286 *(const DES_LONG *)(des_SP +((u )&0xfc))^ \
287 *(const DES_LONG *)(des_SP+0x200+((u>> 8L)&0xfc))^ \
288 *(const DES_LONG *)(des_SP+0x400+((u>>16L)&0xfc))^ \
289 *(const DES_LONG *)(des_SP+0x600+((u>>24L)&0xfc))^ \
290 *(const DES_LONG *)(des_SP+0x100+((t )&0xfc))^ \
291 *(const DES_LONG *)(des_SP+0x300+((t>> 8L)&0xfc))^ \
292 *(const DES_LONG *)(des_SP+0x500+((t>>16L)&0xfc))^ \
293 *(const DES_LONG *)(des_SP+0x700+((t>>24L)&0xfc)); }
296 # else /* original version */
298 # if defined(DES_RISC1) || defined(DES_RISC2)
300 # define D_ENCRYPT(LL,R,S) {\
301 unsigned int u1,u2,u3; \
302 LOAD_DATA(R,S,u,t,E0,E1,u1); \
309 LL^=DES_SPtrans[0][u1]; \
310 LL^=DES_SPtrans[2][u2]; \
314 LL^=DES_SPtrans[4][u1]; \
315 LL^=DES_SPtrans[6][u3]; \
320 LL^=DES_SPtrans[1][u1]; \
321 LL^=DES_SPtrans[3][u2]; \
325 LL^=DES_SPtrans[5][u1]; \
326 LL^=DES_SPtrans[7][u3]; }
329 # define D_ENCRYPT(LL,R,S) {\
330 unsigned int u1,u2,s1,s2; \
331 LOAD_DATA(R,S,u,t,E0,E1,u1); \
337 LL^=DES_SPtrans[0][u1]; \
338 LL^=DES_SPtrans[2][u2]; \
343 LL^=DES_SPtrans[4][s1]; \
344 LL^=DES_SPtrans[6][s2]; \
348 LL^=DES_SPtrans[1][u1]; \
349 LL^=DES_SPtrans[3][u2]; \
354 LL^=DES_SPtrans[5][s1]; \
355 LL^=DES_SPtrans[7][s2]; }
360 # define D_ENCRYPT(LL,R,S) {\
361 LOAD_DATA_tmp(R,S,u,t,E0,E1); \
364 DES_SPtrans[0][(u>> 2L)&0x3f]^ \
365 DES_SPtrans[2][(u>>10L)&0x3f]^ \
366 DES_SPtrans[4][(u>>18L)&0x3f]^ \
367 DES_SPtrans[6][(u>>26L)&0x3f]^ \
368 DES_SPtrans[1][(t>> 2L)&0x3f]^ \
369 DES_SPtrans[3][(t>>10L)&0x3f]^ \
370 DES_SPtrans[5][(t>>18L)&0x3f]^ \
371 DES_SPtrans[7][(t>>26L)&0x3f]; }
377 * The problem is more of a geometric problem that random bit fiddling.
378 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6
379 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4
380 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2
381 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0
383 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7
384 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5
385 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3
386 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1
388 The output has been subject to swaps of the form
389 0 1 -> 3 1 but the odd and even bits have been put into
391 different words. The main trick is to remember that
392 t=((l>>size)^r)&(mask);
395 can be used to swap and move bits between words.
397 So l = 0 1 2 3 r = 16 17 18 19
399 8 9 10 11 24 25 26 27
400 12 13 14 15 28 29 30 31
401 becomes (for size == 2 and mask == 0x3333)
402 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19
403 6^20 7^21 -- -- 4 5 20 21 6 7 22 23
404 10^24 11^25 -- -- 8 9 24 25 10 11 24 25
405 14^28 15^29 -- -- 12 13 28 29 14 15 28 29
407 Thanks for hints from Richard Outerbridge - he told me IP&FP
408 could be done in 15 xor, 10 shifts and 5 ands.
409 When I finally started to think of the problem in 2D
410 I first got ~42 operations without xors. When I remembered
411 how to use xors :-) I got it to its final state.
413 # define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
419 register DES_LONG tt; \
420 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
421 PERM_OP(l,r,tt,16,0x0000ffffL); \
422 PERM_OP(r,l,tt, 2,0x33333333L); \
423 PERM_OP(l,r,tt, 8,0x00ff00ffL); \
424 PERM_OP(r,l,tt, 1,0x55555555L); \
429 register DES_LONG tt; \
430 PERM_OP(l,r,tt, 1,0x55555555L); \
431 PERM_OP(r,l,tt, 8,0x00ff00ffL); \
432 PERM_OP(l,r,tt, 2,0x33333333L); \
433 PERM_OP(r,l,tt,16,0x0000ffffL); \
434 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \
437 extern const DES_LONG DES_SPtrans[8][64];
439 void fcrypt_body(DES_LONG *out, DES_key_schedule *ks,
440 DES_LONG Eswap0, DES_LONG Eswap1);
442 # ifdef OPENSSL_SMALL_FOOTPRINT