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