]>
Commit | Line | Data |
---|---|---|
169cc7a1 | 1 | /* crypto/des/des_locl.h */ |
d02b48c6 RE |
2 | /* Copyright (C) 1995-1997 Eric Young (eay@cryptsoft.com) |
3 | * All rights reserved. | |
4 | * | |
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. | |
40720ce3 | 8 | * |
d02b48c6 RE |
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). | |
40720ce3 | 15 | * |
d02b48c6 RE |
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. | |
40720ce3 | 22 | * |
d02b48c6 RE |
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 (eay@cryptsoft.com)" | |
35 | * The word 'cryptographic' can be left out if the rouines from the library | |
36 | * being used are not cryptographic related :-). | |
40720ce3 | 37 | * 4. If you include any Windows specific code (or a derivative thereof) from |
d02b48c6 RE |
38 | * the apps directory (application code) you must include an acknowledgement: |
39 | * "This product includes software written by Tim Hudson (tjh@cryptsoft.com)" | |
40720ce3 | 40 | * |
d02b48c6 RE |
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. | |
40720ce3 | 52 | * |
d02b48c6 RE |
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 | ||
d02b48c6 | 59 | #ifndef HEADER_DES_LOCL_H |
40720ce3 | 60 | # define HEADER_DES_LOCL_H |
d02b48c6 | 61 | |
40720ce3 | 62 | # include <openssl/e_os2.h> |
a5bc1e85 | 63 | |
40720ce3 MC |
64 | # if defined(OPENSSL_SYS_WIN32) || defined(OPENSSL_SYS_WIN16) |
65 | # ifndef OPENSSL_SYS_MSDOS | |
66 | # define OPENSSL_SYS_MSDOS | |
67 | # endif | |
68 | # endif | |
e766a681 | 69 | |
40720ce3 MC |
70 | # include <stdio.h> |
71 | # include <stdlib.h> | |
72 | ||
73 | # ifndef OPENSSL_SYS_MSDOS | |
74 | # if !defined(OPENSSL_SYS_VMS) || defined(__DECC) | |
75 | # ifdef OPENSSL_UNISTD | |
76 | # include OPENSSL_UNISTD | |
77 | # else | |
78 | # include <unistd.h> | |
79 | # endif | |
80 | # include <math.h> | |
81 | # endif | |
82 | # endif | |
83 | # include <openssl/des.h> | |
d02b48c6 | 84 | |
40720ce3 MC |
85 | # ifdef OPENSSL_SYS_MSDOS /* Visual C++ 2.1 (Windows NT/95) */ |
86 | # include <stdlib.h> | |
87 | # include <errno.h> | |
88 | # include <time.h> | |
89 | # include <io.h> | |
90 | # endif | |
7d7d2cbc | 91 | |
40720ce3 MC |
92 | # if defined(__STDC__) || defined(OPENSSL_SYS_VMS) || defined(M_XENIX) || defined(OPENSSL_SYS_MSDOS) |
93 | # include <string.h> | |
94 | # endif | |
a5a01e90 | 95 | |
40720ce3 MC |
96 | # ifdef OPENSSL_BUILD_SHLIBCRYPTO |
97 | # undef OPENSSL_EXTERN | |
98 | # define OPENSSL_EXTERN OPENSSL_EXPORT | |
99 | # endif | |
26da3e65 | 100 | |
40720ce3 MC |
101 | # define ITERATIONS 16 |
102 | # define HALF_ITERATIONS 8 | |
d02b48c6 RE |
103 | |
104 | /* used in des_read and des_write */ | |
40720ce3 MC |
105 | # define MAXWRITE (1024*16) |
106 | # define BSIZE (MAXWRITE+4) | |
d02b48c6 | 107 | |
40720ce3 MC |
108 | # define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \ |
109 | l|=((DES_LONG)(*((c)++)))<< 8L, \ | |
110 | l|=((DES_LONG)(*((c)++)))<<16L, \ | |
111 | l|=((DES_LONG)(*((c)++)))<<24L) | |
d02b48c6 RE |
112 | |
113 | /* NOTE - c is not incremented as per c2l */ | |
40720ce3 MC |
114 | # define c2ln(c,l1,l2,n) { \ |
115 | c+=n; \ | |
116 | l1=l2=0; \ | |
117 | switch (n) { \ | |
118 | case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \ | |
119 | case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \ | |
120 | case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \ | |
121 | case 5: l2|=((DES_LONG)(*(--(c)))); \ | |
122 | case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \ | |
123 | case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \ | |
124 | case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \ | |
125 | case 1: l1|=((DES_LONG)(*(--(c)))); \ | |
126 | } \ | |
127 | } | |
128 | ||
129 | # define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ | |
130 | *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ | |
131 | *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ | |
132 | *((c)++)=(unsigned char)(((l)>>24L)&0xff)) | |
133 | ||
134 | /* | |
135 | * replacements for htonl and ntohl since I have no idea what to do when | |
136 | * faced with machines with 8 byte longs. | |
137 | */ | |
138 | # define HDRSIZE 4 | |
d02b48c6 | 139 | |
40720ce3 MC |
140 | # define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \ |
141 | l|=((DES_LONG)(*((c)++)))<<16L, \ | |
142 | l|=((DES_LONG)(*((c)++)))<< 8L, \ | |
143 | l|=((DES_LONG)(*((c)++)))) | |
d02b48c6 | 144 | |
40720ce3 MC |
145 | # define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ |
146 | *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ | |
147 | *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ | |
148 | *((c)++)=(unsigned char)(((l) )&0xff)) | |
d02b48c6 | 149 | |
40720ce3 MC |
150 | /* NOTE - c is not incremented as per l2c */ |
151 | # define l2cn(l1,l2,c,n) { \ | |
152 | c+=n; \ | |
153 | switch (n) { \ | |
154 | case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ | |
155 | case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ | |
156 | case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ | |
157 | case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ | |
158 | case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ | |
159 | case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ | |
160 | case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \ | |
161 | case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \ | |
162 | } \ | |
163 | } | |
164 | ||
165 | # if (defined(OPENSSL_SYS_WIN32) && defined(_MSC_VER)) || defined(__ICC) | |
166 | # define ROTATE(a,n) (_lrotr(a,n)) | |
167 | # elif defined(__GNUC__) && __GNUC__>=2 && !defined(__STRICT_ANSI__) && !defined(OPENSSL_NO_ASM) && !defined(OPENSSL_NO_INLINE_ASM) && !defined(PEDANTIC) | |
168 | # if defined(__i386) || defined(__i386__) || defined(__x86_64) || defined(__x86_64__) | |
169 | # define ROTATE(a,n) ({ register unsigned int ret; \ | |
170 | asm ("rorl %1,%0" \ | |
171 | : "=r"(ret) \ | |
172 | : "I"(n),"0"(a) \ | |
173 | : "cc"); \ | |
174 | ret; \ | |
175 | }) | |
176 | # endif | |
177 | # endif | |
178 | # ifndef ROTATE | |
179 | # define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n)))) | |
180 | # endif | |
d02b48c6 | 181 | |
40720ce3 MC |
182 | /* |
183 | * Don't worry about the LOAD_DATA() stuff, that is used by fcrypt() to add | |
184 | * it's little bit to the front | |
185 | */ | |
d02b48c6 | 186 | |
40720ce3 MC |
187 | # ifdef DES_FCRYPT |
188 | ||
189 | # define LOAD_DATA_tmp(R,S,u,t,E0,E1) \ | |
190 | { DES_LONG tmp; LOAD_DATA(R,S,u,t,E0,E1,tmp); } | |
191 | ||
192 | # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \ | |
193 | t=R^(R>>16L); \ | |
194 | u=t&E0; t&=E1; \ | |
195 | tmp=(u<<16); u^=R^s[S ]; u^=tmp; \ | |
196 | tmp=(t<<16); t^=R^s[S+1]; t^=tmp | |
197 | # else | |
198 | # define LOAD_DATA_tmp(a,b,c,d,e,f) LOAD_DATA(a,b,c,d,e,f,g) | |
199 | # define LOAD_DATA(R,S,u,t,E0,E1,tmp) \ | |
200 | u=R^s[S ]; \ | |
201 | t=R^s[S+1] | |
202 | # endif | |
d02b48c6 | 203 | |
40720ce3 MC |
204 | /* |
205 | * The changes to this macro may help or hinder, depending on the compiler | |
206 | * and the architecture. gcc2 always seems to do well :-). Inspired by Dana | |
207 | * How <how@isl.stanford.edu> DO NOT use the alternative version on machines | |
208 | * with 8 byte longs. It does not seem to work on the Alpha, even when | |
209 | * DES_LONG is 4 bytes, probably an issue of accessing non-word aligned | |
210 | * objects :-( | |
211 | */ | |
212 | # ifdef DES_PTR | |
d02b48c6 | 213 | |
40720ce3 MC |
214 | /* |
215 | * It recently occurred to me that 0^0^0^0^0^0^0 == 0, so there is no reason | |
216 | * to not xor all the sub items together. This potentially saves a register | |
217 | * since things can be xored directly into L | |
218 | */ | |
d02b48c6 | 219 | |
40720ce3 MC |
220 | # if defined(DES_RISC1) || defined(DES_RISC2) |
221 | # ifdef DES_RISC1 | |
222 | # define D_ENCRYPT(LL,R,S) { \ | |
223 | unsigned int u1,u2,u3; \ | |
224 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
225 | u2=(int)u>>8L; \ | |
226 | u1=(int)u&0xfc; \ | |
227 | u2&=0xfc; \ | |
228 | t=ROTATE(t,4); \ | |
229 | u>>=16L; \ | |
230 | LL^= *(const DES_LONG *)(des_SP +u1); \ | |
231 | LL^= *(const DES_LONG *)(des_SP+0x200+u2); \ | |
232 | u3=(int)(u>>8L); \ | |
233 | u1=(int)u&0xfc; \ | |
234 | u3&=0xfc; \ | |
235 | LL^= *(const DES_LONG *)(des_SP+0x400+u1); \ | |
236 | LL^= *(const DES_LONG *)(des_SP+0x600+u3); \ | |
237 | u2=(int)t>>8L; \ | |
238 | u1=(int)t&0xfc; \ | |
239 | u2&=0xfc; \ | |
240 | t>>=16L; \ | |
241 | LL^= *(const DES_LONG *)(des_SP+0x100+u1); \ | |
242 | LL^= *(const DES_LONG *)(des_SP+0x300+u2); \ | |
243 | u3=(int)t>>8L; \ | |
244 | u1=(int)t&0xfc; \ | |
245 | u3&=0xfc; \ | |
246 | LL^= *(const DES_LONG *)(des_SP+0x500+u1); \ | |
247 | LL^= *(const DES_LONG *)(des_SP+0x700+u3); } | |
248 | # endif | |
249 | # ifdef DES_RISC2 | |
250 | # define D_ENCRYPT(LL,R,S) { \ | |
251 | unsigned int u1,u2,s1,s2; \ | |
252 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
253 | u2=(int)u>>8L; \ | |
254 | u1=(int)u&0xfc; \ | |
255 | u2&=0xfc; \ | |
256 | t=ROTATE(t,4); \ | |
257 | LL^= *(const DES_LONG *)(des_SP +u1); \ | |
258 | LL^= *(const DES_LONG *)(des_SP+0x200+u2); \ | |
259 | s1=(int)(u>>16L); \ | |
260 | s2=(int)(u>>24L); \ | |
261 | s1&=0xfc; \ | |
262 | s2&=0xfc; \ | |
263 | LL^= *(const DES_LONG *)(des_SP+0x400+s1); \ | |
264 | LL^= *(const DES_LONG *)(des_SP+0x600+s2); \ | |
265 | u2=(int)t>>8L; \ | |
266 | u1=(int)t&0xfc; \ | |
267 | u2&=0xfc; \ | |
268 | LL^= *(const DES_LONG *)(des_SP+0x100+u1); \ | |
269 | LL^= *(const DES_LONG *)(des_SP+0x300+u2); \ | |
270 | s1=(int)(t>>16L); \ | |
271 | s2=(int)(t>>24L); \ | |
272 | s1&=0xfc; \ | |
273 | s2&=0xfc; \ | |
274 | LL^= *(const DES_LONG *)(des_SP+0x500+s1); \ | |
275 | LL^= *(const DES_LONG *)(des_SP+0x700+s2); } | |
276 | # endif | |
277 | # else | |
278 | # define D_ENCRYPT(LL,R,S) { \ | |
279 | LOAD_DATA_tmp(R,S,u,t,E0,E1); \ | |
280 | t=ROTATE(t,4); \ | |
281 | LL^= \ | |
282 | *(const DES_LONG *)(des_SP +((u )&0xfc))^ \ | |
283 | *(const DES_LONG *)(des_SP+0x200+((u>> 8L)&0xfc))^ \ | |
284 | *(const DES_LONG *)(des_SP+0x400+((u>>16L)&0xfc))^ \ | |
285 | *(const DES_LONG *)(des_SP+0x600+((u>>24L)&0xfc))^ \ | |
286 | *(const DES_LONG *)(des_SP+0x100+((t )&0xfc))^ \ | |
287 | *(const DES_LONG *)(des_SP+0x300+((t>> 8L)&0xfc))^ \ | |
288 | *(const DES_LONG *)(des_SP+0x500+((t>>16L)&0xfc))^ \ | |
289 | *(const DES_LONG *)(des_SP+0x700+((t>>24L)&0xfc)); } | |
290 | # endif | |
291 | ||
292 | # else /* original version */ | |
293 | ||
294 | # if defined(DES_RISC1) || defined(DES_RISC2) | |
295 | # ifdef DES_RISC1 | |
296 | # define D_ENCRYPT(LL,R,S) {\ | |
297 | unsigned int u1,u2,u3; \ | |
298 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
299 | u>>=2L; \ | |
300 | t=ROTATE(t,6); \ | |
301 | u2=(int)u>>8L; \ | |
302 | u1=(int)u&0x3f; \ | |
303 | u2&=0x3f; \ | |
304 | u>>=16L; \ | |
305 | LL^=DES_SPtrans[0][u1]; \ | |
306 | LL^=DES_SPtrans[2][u2]; \ | |
307 | u3=(int)u>>8L; \ | |
308 | u1=(int)u&0x3f; \ | |
309 | u3&=0x3f; \ | |
310 | LL^=DES_SPtrans[4][u1]; \ | |
311 | LL^=DES_SPtrans[6][u3]; \ | |
312 | u2=(int)t>>8L; \ | |
313 | u1=(int)t&0x3f; \ | |
314 | u2&=0x3f; \ | |
315 | t>>=16L; \ | |
316 | LL^=DES_SPtrans[1][u1]; \ | |
317 | LL^=DES_SPtrans[3][u2]; \ | |
318 | u3=(int)t>>8L; \ | |
319 | u1=(int)t&0x3f; \ | |
320 | u3&=0x3f; \ | |
321 | LL^=DES_SPtrans[5][u1]; \ | |
322 | LL^=DES_SPtrans[7][u3]; } | |
323 | # endif | |
324 | # ifdef DES_RISC2 | |
325 | # define D_ENCRYPT(LL,R,S) {\ | |
326 | unsigned int u1,u2,s1,s2; \ | |
327 | LOAD_DATA(R,S,u,t,E0,E1,u1); \ | |
328 | u>>=2L; \ | |
329 | t=ROTATE(t,6); \ | |
330 | u2=(int)u>>8L; \ | |
331 | u1=(int)u&0x3f; \ | |
332 | u2&=0x3f; \ | |
333 | LL^=DES_SPtrans[0][u1]; \ | |
334 | LL^=DES_SPtrans[2][u2]; \ | |
335 | s1=(int)u>>16L; \ | |
336 | s2=(int)u>>24L; \ | |
337 | s1&=0x3f; \ | |
338 | s2&=0x3f; \ | |
339 | LL^=DES_SPtrans[4][s1]; \ | |
340 | LL^=DES_SPtrans[6][s2]; \ | |
341 | u2=(int)t>>8L; \ | |
342 | u1=(int)t&0x3f; \ | |
343 | u2&=0x3f; \ | |
344 | LL^=DES_SPtrans[1][u1]; \ | |
345 | LL^=DES_SPtrans[3][u2]; \ | |
346 | s1=(int)t>>16; \ | |
347 | s2=(int)t>>24L; \ | |
348 | s1&=0x3f; \ | |
349 | s2&=0x3f; \ | |
350 | LL^=DES_SPtrans[5][s1]; \ | |
351 | LL^=DES_SPtrans[7][s2]; } | |
352 | # endif | |
353 | ||
354 | # else | |
355 | ||
356 | # define D_ENCRYPT(LL,R,S) {\ | |
357 | LOAD_DATA_tmp(R,S,u,t,E0,E1); \ | |
358 | t=ROTATE(t,4); \ | |
359 | LL^=\ | |
360 | DES_SPtrans[0][(u>> 2L)&0x3f]^ \ | |
361 | DES_SPtrans[2][(u>>10L)&0x3f]^ \ | |
362 | DES_SPtrans[4][(u>>18L)&0x3f]^ \ | |
363 | DES_SPtrans[6][(u>>26L)&0x3f]^ \ | |
364 | DES_SPtrans[1][(t>> 2L)&0x3f]^ \ | |
365 | DES_SPtrans[3][(t>>10L)&0x3f]^ \ | |
366 | DES_SPtrans[5][(t>>18L)&0x3f]^ \ | |
367 | DES_SPtrans[7][(t>>26L)&0x3f]; } | |
368 | # endif | |
369 | # endif | |
d02b48c6 | 370 | |
40720ce3 MC |
371 | /*- |
372 | * IP and FP | |
373 | * The problem is more of a geometric problem that random bit fiddling. | |
374 | 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6 | |
375 | 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4 | |
376 | 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2 | |
377 | 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0 | |
378 | ||
379 | 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7 | |
380 | 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5 | |
381 | 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3 | |
382 | 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1 | |
383 | ||
384 | The output has been subject to swaps of the form | |
385 | 0 1 -> 3 1 but the odd and even bits have been put into | |
386 | 2 3 2 0 | |
387 | different words. The main trick is to remember that | |
388 | t=((l>>size)^r)&(mask); | |
389 | r^=t; | |
390 | l^=(t<<size); | |
391 | can be used to swap and move bits between words. | |
392 | ||
393 | So l = 0 1 2 3 r = 16 17 18 19 | |
394 | 4 5 6 7 20 21 22 23 | |
395 | 8 9 10 11 24 25 26 27 | |
396 | 12 13 14 15 28 29 30 31 | |
397 | becomes (for size == 2 and mask == 0x3333) | |
398 | t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19 | |
399 | 6^20 7^21 -- -- 4 5 20 21 6 7 22 23 | |
400 | 10^24 11^25 -- -- 8 9 24 25 10 11 24 25 | |
401 | 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 | |
402 | ||
403 | Thanks for hints from Richard Outerbridge - he told me IP&FP | |
404 | could be done in 15 xor, 10 shifts and 5 ands. | |
405 | When I finally started to think of the problem in 2D | |
406 | I first got ~42 operations without xors. When I remembered | |
407 | how to use xors :-) I got it to its final state. | |
408 | */ | |
409 | # define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\ | |
410 | (b)^=(t),\ | |
411 | (a)^=((t)<<(n))) | |
412 | ||
413 | # define IP(l,r) \ | |
414 | { \ | |
415 | register DES_LONG tt; \ | |
416 | PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \ | |
417 | PERM_OP(l,r,tt,16,0x0000ffffL); \ | |
418 | PERM_OP(r,l,tt, 2,0x33333333L); \ | |
419 | PERM_OP(l,r,tt, 8,0x00ff00ffL); \ | |
420 | PERM_OP(r,l,tt, 1,0x55555555L); \ | |
421 | } | |
422 | ||
423 | # define FP(l,r) \ | |
424 | { \ | |
425 | register DES_LONG tt; \ | |
426 | PERM_OP(l,r,tt, 1,0x55555555L); \ | |
427 | PERM_OP(r,l,tt, 8,0x00ff00ffL); \ | |
428 | PERM_OP(l,r,tt, 2,0x33333333L); \ | |
429 | PERM_OP(r,l,tt,16,0x0000ffffL); \ | |
430 | PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \ | |
431 | } | |
d02b48c6 | 432 | |
e62991a0 | 433 | extern const DES_LONG DES_SPtrans[8][64]; |
d02b48c6 | 434 | |
40720ce3 MC |
435 | void fcrypt_body(DES_LONG *out, DES_key_schedule *ks, |
436 | DES_LONG Eswap0, DES_LONG Eswap1); | |
d02b48c6 | 437 | #endif |