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