cryptlib  3.4.1
 All Classes Namespaces Files Functions Variables Typedefs Enumerations Enumerator Properties Macros
deslocl.h
Go to the documentation of this file.
1 /* crypto/des/des_locl.h */
2 /* Copyright (C) 1995-1997 Eric Young ([email protected])
3  * All rights reserved.
4  *
5  * This package is an SSL implementation written
6  * by Eric Young ([email protected]).
7  * The implementation was written so as to conform with Netscapes SSL.
8  *
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 ([email protected]).
15  *
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.
22  *
23  * Redistribution and use in source and binary forms, with or without
24  * modification, are permitted provided that the following conditions
25  * are met:
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 ([email protected])"
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 ([email protected])"
40  *
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
51  * SUCH DAMAGE.
52  *
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.]
57  */
58 
59 #ifndef HEADER_DES_LOCL_H
60 #define HEADER_DES_LOCL_H
61 
62 #if defined(WIN32) || defined(WIN16)
63 #ifndef MSDOS
64 #define MSDOS
65 #endif
66 #endif
67 
68 #include <stdio.h>
69 #include <stdlib.h>
70 
71 #if defined( INC_ALL )
72  #include "osconfig.h"
73  #include "des.h"
74 #else
75  #include "crypt/osconfig.h"
76  #include "crypt/des.h"
77 #endif /* Compiler-specific includes */
78 
79 #if defined(__STDC__) || defined(VMS) || defined(M_XENIX) || defined(MSDOS)
80 #include <string.h>
81 #endif
82 
83 #define ITERATIONS 16
84 #define HALF_ITERATIONS 8
85 
86 /* used in des_read and des_write */
87 #define MAXWRITE (1024*16)
88 #ifdef BSIZE
89  /* If it's already defined, undefine it completely so that it can be
90  * resolved by the user. This macro is redefined on HP-UX 10.20 using
91  * gcc 2.95.2. Fortunately, BSIZE is not used in the DES code. */
92  #undef BSIZE
93 #else
94  #define BSIZE (MAXWRITE+4)
95 #endif
96 
97 #define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \
98  l|=((DES_LONG)(*((c)++)))<< 8L, \
99  l|=((DES_LONG)(*((c)++)))<<16L, \
100  l|=((DES_LONG)(*((c)++)))<<24L)
101 
102 /* NOTE - c is not incremented as per c2l */
103 #define c2ln(c,l1,l2,n) { \
104  c+=n; \
105  l1=l2=0; \
106  switch (n) { \
107  case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \
108  case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \
109  case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \
110  case 5: l2|=((DES_LONG)(*(--(c)))); \
111  case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \
112  case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \
113  case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \
114  case 1: l1|=((DES_LONG)(*(--(c)))); \
115  } \
116  }
117 
118 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \
119  *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
120  *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
121  *((c)++)=(unsigned char)(((l)>>24L)&0xff))
122 
123 /* replacements for htonl and ntohl since I have no idea what to do
124  * when faced with machines with 8 byte longs. */
125 #define HDRSIZE 4
126 
127 #define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \
128  l|=((DES_LONG)(*((c)++)))<<16L, \
129  l|=((DES_LONG)(*((c)++)))<< 8L, \
130  l|=((DES_LONG)(*((c)++))))
131 
132 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \
133  *((c)++)=(unsigned char)(((l)>>16L)&0xff), \
134  *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \
135  *((c)++)=(unsigned char)(((l) )&0xff))
136 
137 /* NOTE - c is not incremented as per l2c */
138 #define l2cn(l1,l2,c,n) { \
139  c+=n; \
140  switch (n) { \
141  case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \
142  case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \
143  case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \
144  case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \
145  case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \
146  case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \
147  case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \
148  case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \
149  } \
150  }
151 
152 #if defined(WIN32) && defined(_MSC_VER)
153 #define ROTATE(a,n) (_lrotr(a,n))
154 #else
155 #define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n))))
156 #endif
157 
158 /* Don't worry about the LOAD_DATA() stuff, that is used by
159  * fcrypt() to add it's little bit to the front */
160 
161 #ifdef DES_FCRYPT
162 
163 #define LOAD_DATA_tmp(R,S,u,t,E0,E1) \
164  { DES_LONG tmp; LOAD_DATA(R,S,u,t,E0,E1,tmp); }
165 
166 #define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
167  t=R^(R>>16L); \
168  u=t&E0; t&=E1; \
169  tmp=(u<<16); u^=R^s[S ]; u^=tmp; \
170  tmp=(t<<16); t^=R^s[S+1]; t^=tmp
171 #else
172 #define LOAD_DATA_tmp(a,b,c,d,e,f) LOAD_DATA(a,b,c,d,e,f,g)
173 #define LOAD_DATA(R,S,u,t,E0,E1,tmp) \
174  u=R^s[S ]; \
175  t=R^s[S+1]
176 #endif
177 
178 /* The changes to this macro may help or hinder, depending on the
179  * compiler and the architecture. gcc2 always seems to do well :-).
180  * Inspired by Dana How <[email protected]>
181  * DO NOT use the alternative version on machines with 8 byte longs.
182  * It does not seem to work on the Alpha, even when DES_LONG is 4
183  * bytes, probably an issue of accessing non-word aligned objects :-( */
184 #ifdef DES_PTR
185 
186 /* It recently occurred to me that 0^0^0^0^0^0^0 == 0, so there
187  * is no reason to not xor all the sub items together. This potentially
188  * saves a register since things can be xored directly into L */
189 
190 #if defined(DES_RISC1) || defined(DES_RISC2)
191 #ifdef DES_RISC1
192 #define D_ENCRYPT(LL,R,S) { \
193  unsigned int u1,u2,u3; \
194  LOAD_DATA(R,S,u,t,E0,E1,u1); \
195  u2=(int)u>>8L; \
196  u1=(int)u&0xfc; \
197  u2&=0xfc; \
198  t=ROTATE(t,4); \
199  u>>=16L; \
200  LL^= *(const DES_LONG *)(des_SP +u1); \
201  LL^= *(const DES_LONG *)(des_SP+0x200+u2); \
202  u3=(int)(u>>8L); \
203  u1=(int)u&0xfc; \
204  u3&=0xfc; \
205  LL^= *(const DES_LONG *)(des_SP+0x400+u1); \
206  LL^= *(const DES_LONG *)(des_SP+0x600+u3); \
207  u2=(int)t>>8L; \
208  u1=(int)t&0xfc; \
209  u2&=0xfc; \
210  t>>=16L; \
211  LL^= *(const DES_LONG *)(des_SP+0x100+u1); \
212  LL^= *(const DES_LONG *)(des_SP+0x300+u2); \
213  u3=(int)t>>8L; \
214  u1=(int)t&0xfc; \
215  u3&=0xfc; \
216  LL^= *(const DES_LONG *)(des_SP+0x500+u1); \
217  LL^= *(const DES_LONG *)(des_SP+0x700+u3); }
218 #endif
219 #ifdef DES_RISC2
220 #define D_ENCRYPT(LL,R,S) { \
221  unsigned int u1,u2,s1,s2; \
222  LOAD_DATA(R,S,u,t,E0,E1,u1); \
223  u2=(int)u>>8L; \
224  u1=(int)u&0xfc; \
225  u2&=0xfc; \
226  t=ROTATE(t,4); \
227  LL^= *(const DES_LONG *)(des_SP +u1); \
228  LL^= *(const DES_LONG *)(des_SP+0x200+u2); \
229  s1=(int)(u>>16L); \
230  s2=(int)(u>>24L); \
231  s1&=0xfc; \
232  s2&=0xfc; \
233  LL^= *(const DES_LONG *)(des_SP+0x400+s1); \
234  LL^= *(const DES_LONG *)(des_SP+0x600+s2); \
235  u2=(int)t>>8L; \
236  u1=(int)t&0xfc; \
237  u2&=0xfc; \
238  LL^= *(const DES_LONG *)(des_SP+0x100+u1); \
239  LL^= *(const DES_LONG *)(des_SP+0x300+u2); \
240  s1=(int)(t>>16L); \
241  s2=(int)(t>>24L); \
242  s1&=0xfc; \
243  s2&=0xfc; \
244  LL^= *(const DES_LONG *)(des_SP+0x500+s1); \
245  LL^= *(const DES_LONG *)(des_SP+0x700+s2); }
246 #endif
247 #else
248 #define D_ENCRYPT(LL,R,S) { \
249  LOAD_DATA_tmp(R,S,u,t,E0,E1); \
250  t=ROTATE(t,4); \
251  LL^= \
252  *(const DES_LONG *)(des_SP +((u )&0xfc))^ \
253  *(const DES_LONG *)(des_SP+0x200+((u>> 8L)&0xfc))^ \
254  *(const DES_LONG *)(des_SP+0x400+((u>>16L)&0xfc))^ \
255  *(const DES_LONG *)(des_SP+0x600+((u>>24L)&0xfc))^ \
256  *(const DES_LONG *)(des_SP+0x100+((t )&0xfc))^ \
257  *(const DES_LONG *)(des_SP+0x300+((t>> 8L)&0xfc))^ \
258  *(const DES_LONG *)(des_SP+0x500+((t>>16L)&0xfc))^ \
259  *(const DES_LONG *)(des_SP+0x700+((t>>24L)&0xfc)); }
260 #endif
261 
262 #else /* original version */
263 
264 #if defined(DES_RISC1) || defined(DES_RISC2)
265 #ifdef DES_RISC1
266 #define D_ENCRYPT(LL,R,S) {\
267  unsigned int u1,u2,u3; \
268  LOAD_DATA(R,S,u,t,E0,E1,u1); \
269  u>>=2L; \
270  t=ROTATE(t,6); \
271  u2=(int)u>>8L; \
272  u1=(int)u&0x3f; \
273  u2&=0x3f; \
274  u>>=16L; \
275  LL^=des_SPtrans[0][u1]; \
276  LL^=des_SPtrans[2][u2]; \
277  u3=(int)u>>8L; \
278  u1=(int)u&0x3f; \
279  u3&=0x3f; \
280  LL^=des_SPtrans[4][u1]; \
281  LL^=des_SPtrans[6][u3]; \
282  u2=(int)t>>8L; \
283  u1=(int)t&0x3f; \
284  u2&=0x3f; \
285  t>>=16L; \
286  LL^=des_SPtrans[1][u1]; \
287  LL^=des_SPtrans[3][u2]; \
288  u3=(int)t>>8L; \
289  u1=(int)t&0x3f; \
290  u3&=0x3f; \
291  LL^=des_SPtrans[5][u1]; \
292  LL^=des_SPtrans[7][u3]; }
293 #endif
294 #ifdef DES_RISC2
295 #define D_ENCRYPT(LL,R,S) {\
296  unsigned int u1,u2,s1,s2; \
297  LOAD_DATA(R,S,u,t,E0,E1,u1); \
298  u>>=2L; \
299  t=ROTATE(t,6); \
300  u2=(int)u>>8L; \
301  u1=(int)u&0x3f; \
302  u2&=0x3f; \
303  LL^=des_SPtrans[0][u1]; \
304  LL^=des_SPtrans[2][u2]; \
305  s1=(int)u>>16L; \
306  s2=(int)u>>24L; \
307  s1&=0x3f; \
308  s2&=0x3f; \
309  LL^=des_SPtrans[4][s1]; \
310  LL^=des_SPtrans[6][s2]; \
311  u2=(int)t>>8L; \
312  u1=(int)t&0x3f; \
313  u2&=0x3f; \
314  LL^=des_SPtrans[1][u1]; \
315  LL^=des_SPtrans[3][u2]; \
316  s1=(int)t>>16; \
317  s2=(int)t>>24L; \
318  s1&=0x3f; \
319  s2&=0x3f; \
320  LL^=des_SPtrans[5][s1]; \
321  LL^=des_SPtrans[7][s2]; }
322 #endif
323 
324 #else
325 
326 #define D_ENCRYPT(LL,R,S) {\
327  LOAD_DATA_tmp(R,S,u,t,E0,E1); \
328  t=ROTATE(t,4); \
329  LL^=\
330  des_SPtrans[0][(u>> 2L)&0x3f]^ \
331  des_SPtrans[2][(u>>10L)&0x3f]^ \
332  des_SPtrans[4][(u>>18L)&0x3f]^ \
333  des_SPtrans[6][(u>>26L)&0x3f]^ \
334  des_SPtrans[1][(t>> 2L)&0x3f]^ \
335  des_SPtrans[3][(t>>10L)&0x3f]^ \
336  des_SPtrans[5][(t>>18L)&0x3f]^ \
337  des_SPtrans[7][(t>>26L)&0x3f]; }
338 #endif
339 #endif
340 
341  /* IP and FP
342  * The problem is more of a geometric problem that random bit fiddling.
343  0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6
344  8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4
345  16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2
346  24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0
347 
348  32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7
349  40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5
350  48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3
351  56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1
352 
353  The output has been subject to swaps of the form
354  0 1 -> 3 1 but the odd and even bits have been put into
355  2 3 2 0
356  different words. The main trick is to remember that
357  t=((l>>size)^r)&(mask);
358  r^=t;
359  l^=(t<<size);
360  can be used to swap and move bits between words.
361 
362  So l = 0 1 2 3 r = 16 17 18 19
363  4 5 6 7 20 21 22 23
364  8 9 10 11 24 25 26 27
365  12 13 14 15 28 29 30 31
366  becomes (for size == 2 and mask == 0x3333)
367  t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19
368  6^20 7^21 -- -- 4 5 20 21 6 7 22 23
369  10^24 11^25 -- -- 8 9 24 25 10 11 24 25
370  14^28 15^29 -- -- 12 13 28 29 14 15 28 29
371 
372  Thanks for hints from Richard Outerbridge - he told me IP&FP
373  could be done in 15 xor, 10 shifts and 5 ands.
374  When I finally started to think of the problem in 2D
375  I first got ~42 operations without xors. When I remembered
376  how to use xors :-) I got it to its final state.
377  */
378 #define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\
379  (b)^=(t),\
380  (a)^=((t)<<(n)))
381 
382 #define IP(l,r) \
383  { \
384  register DES_LONG tt; \
385  PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \
386  PERM_OP(l,r,tt,16,0x0000ffffL); \
387  PERM_OP(r,l,tt, 2,0x33333333L); \
388  PERM_OP(l,r,tt, 8,0x00ff00ffL); \
389  PERM_OP(r,l,tt, 1,0x55555555L); \
390  }
391 
392 #define FP(l,r) \
393  { \
394  register DES_LONG tt; \
395  PERM_OP(l,r,tt, 1,0x55555555L); \
396  PERM_OP(r,l,tt, 8,0x00ff00ffL); \
397  PERM_OP(l,r,tt, 2,0x33333333L); \
398  PERM_OP(r,l,tt,16,0x0000ffffL); \
399  PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \
400  }
401 
403 
405  DES_LONG Eswap0, DES_LONG Eswap1);
406 #endif