des_locl.h revision 1.1
1 /* $NetBSD: des_locl.h,v 1.1 2000/06/14 19:45:35 thorpej Exp $ */ 2 /* $KAME: des_locl.h,v 1.4 2000/03/27 04:43:46 sumikawa Exp $ */ 3 4 /* lib/des/des_locl.h */ 5 /* Copyright (C) 1995-1996 Eric Young (eay (at) mincom.oz.au) 6 * All rights reserved. 7 * 8 * This file is part of an SSL implementation written 9 * by Eric Young (eay (at) mincom.oz.au). 10 * The implementation was written so as to conform with Netscapes SSL 11 * specification. This library and applications are 12 * FREE FOR COMMERCIAL AND NON-COMMERCIAL USE 13 * as long as the following conditions are aheared to. 14 * 15 * Copyright remains Eric Young's, and as such any Copyright notices in 16 * the code are not to be removed. If this code is used in a product, 17 * Eric Young should be given attribution as the author of the parts used. 18 * This can be in the form of a textual message at program startup or 19 * in documentation (online or textual) provided with the package. 20 * 21 * Redistribution and use in source and binary forms, with or without 22 * modification, are permitted provided that the following conditions 23 * are met: 24 * 1. Redistributions of source code must retain the copyright 25 * notice, this list of conditions and the following disclaimer. 26 * 2. Redistributions in binary form must reproduce the above copyright 27 * notice, this list of conditions and the following disclaimer in the 28 * documentation and/or other materials provided with the distribution. 29 * 3. All advertising materials mentioning features or use of this software 30 * must display the following acknowledgement: 31 * This product includes software developed by Eric Young (eay (at) mincom.oz.au) 32 * 33 * THIS SOFTWARE IS PROVIDED BY ERIC YOUNG ``AS IS'' AND 34 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 35 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 36 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE 37 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 38 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 39 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 40 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 41 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 42 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 43 * SUCH DAMAGE. 44 * 45 * The licence and distribution terms for any publically available version or 46 * derivative of this code cannot be changed. i.e. this code cannot simply be 47 * copied and put under another distribution licence 48 * [including the GNU Public Licence.] 49 */ 50 /* WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 51 * 52 * Always modify des_locl.org since des_locl.h is automatically generated from 53 * it during SSLeay configuration. 54 * 55 * WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING WARNING 56 */ 57 58 #include <sys/param.h> 59 #include <sys/malloc.h> 60 #include <sys/mbuf.h> 61 #include <sys/systm.h> 62 63 #ifndef HEADER_DES_LOCL_H 64 #define HEADER_DES_LOCL_H 65 66 #if defined(WIN32) || defined(WIN16) 67 #ifndef MSDOS 68 #define MSDOS 69 #endif 70 #endif 71 72 /* 73 #include <stdio.h> 74 #include <stdlib.h> 75 #ifndef MSDOS 76 #include <unistd.h> 77 #endif 78 */ 79 #include <crypto/des/des.h> 80 81 /* the following is tweaked from a config script, that is why it is a 82 * protected undef/define */ 83 #ifndef DES_PTR 84 #undef DES_PTR 85 #endif 86 87 #ifdef MSDOS /* Visual C++ 2.1 (Windows NT/95) */ 88 #include <stdlib.h> 89 #include <errno.h> 90 #include <time.h> 91 #include <io.h> 92 #ifndef RAND 93 #define RAND 94 #endif 95 #undef NOPROTO 96 #endif 97 98 #if !defined(_KERNEL) && (defined(__STDC__) || defined(VMS) || defined(M_XENIX) || defined(MSDOS)) 99 #ifndef __NetBSD__ 100 #include <string.h> 101 #endif 102 #endif 103 104 #ifdef __NetBSD__ 105 #include <sys/systm.h> 106 #endif 107 108 #ifndef RAND 109 #define RAND 110 #endif 111 112 #ifdef linux 113 #undef RAND 114 #endif 115 116 #ifdef MSDOS 117 #define getpid() 2 118 #define RAND 119 #undef NOPROTO 120 #endif 121 122 #if defined(NOCONST) 123 #define const 124 #endif 125 126 #ifdef __STDC__ 127 #undef NOPROTO 128 #endif 129 130 #ifdef RAND 131 #define srandom(s) srand(s) 132 #define random rand 133 #endif 134 135 #define ITERATIONS 16 136 #define HALF_ITERATIONS 8 137 138 /* used in des_read and des_write */ 139 #define MAXWRITE (1024*16) 140 #define BSIZE (MAXWRITE+4) 141 142 #define c2l(c,l) (l =((DES_LONG)(*((c)++))) , \ 143 l|=((DES_LONG)(*((c)++)))<< 8L, \ 144 l|=((DES_LONG)(*((c)++)))<<16L, \ 145 l|=((DES_LONG)(*((c)++)))<<24L) 146 147 /* NOTE - c is not incremented as per c2l */ 148 #define c2ln(c,l1,l2,n) { \ 149 c+=n; \ 150 l1=l2=0; \ 151 switch (n) { \ 152 case 8: l2 =((DES_LONG)(*(--(c))))<<24L; \ 153 case 7: l2|=((DES_LONG)(*(--(c))))<<16L; \ 154 case 6: l2|=((DES_LONG)(*(--(c))))<< 8L; \ 155 case 5: l2|=((DES_LONG)(*(--(c)))); \ 156 case 4: l1 =((DES_LONG)(*(--(c))))<<24L; \ 157 case 3: l1|=((DES_LONG)(*(--(c))))<<16L; \ 158 case 2: l1|=((DES_LONG)(*(--(c))))<< 8L; \ 159 case 1: l1|=((DES_LONG)(*(--(c)))); \ 160 } \ 161 } 162 163 #define l2c(l,c) (*((c)++)=(unsigned char)(((l) )&0xff), \ 164 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 165 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 166 *((c)++)=(unsigned char)(((l)>>24L)&0xff)) 167 168 /* replacements for htonl and ntohl since I have no idea what to do 169 * when faced with machines with 8 byte longs. */ 170 #define HDRSIZE 4 171 172 #define n2l(c,l) (l =((DES_LONG)(*((c)++)))<<24L, \ 173 l|=((DES_LONG)(*((c)++)))<<16L, \ 174 l|=((DES_LONG)(*((c)++)))<< 8L, \ 175 l|=((DES_LONG)(*((c)++)))) 176 177 #define l2n(l,c) (*((c)++)=(unsigned char)(((l)>>24L)&0xff), \ 178 *((c)++)=(unsigned char)(((l)>>16L)&0xff), \ 179 *((c)++)=(unsigned char)(((l)>> 8L)&0xff), \ 180 *((c)++)=(unsigned char)(((l) )&0xff)) 181 182 /* NOTE - c is not incremented as per l2c */ 183 #define l2cn(l1,l2,c,n) { \ 184 c+=n; \ 185 switch (n) { \ 186 case 8: *(--(c))=(unsigned char)(((l2)>>24L)&0xff); \ 187 case 7: *(--(c))=(unsigned char)(((l2)>>16L)&0xff); \ 188 case 6: *(--(c))=(unsigned char)(((l2)>> 8L)&0xff); \ 189 case 5: *(--(c))=(unsigned char)(((l2) )&0xff); \ 190 case 4: *(--(c))=(unsigned char)(((l1)>>24L)&0xff); \ 191 case 3: *(--(c))=(unsigned char)(((l1)>>16L)&0xff); \ 192 case 2: *(--(c))=(unsigned char)(((l1)>> 8L)&0xff); \ 193 case 1: *(--(c))=(unsigned char)(((l1) )&0xff); \ 194 } \ 195 } 196 197 #if defined(WIN32) 198 #define ROTATE(a,n) (_lrotr(a,n)) 199 #else 200 #define ROTATE(a,n) (((a)>>(n))+((a)<<(32-(n)))) 201 #endif 202 203 /* The changes to this macro may help or hinder, depending on the 204 * compiler and the achitecture. gcc2 always seems to do well :-). 205 * Inspired by Dana How <how (at) isl.stanford.edu> 206 * DO NOT use the alternative version on machines with 8 byte longs. 207 * It does not seem to work on the Alpha, even when DES_LONG is 4 208 * bytes, probably an issue of accessing non-word aligned objects :-( */ 209 #ifdef DES_PTR 210 211 #define D_ENCRYPT(L,R,S) { \ 212 u=((R^s[S ])<<2); \ 213 t= R^s[S+1]; \ 214 t=ROTATE(t,2); \ 215 L^= (\ 216 *(DES_LONG *)((unsigned char *)des_SP+0x100+((t )&0xfc))+ \ 217 *(DES_LONG *)((unsigned char *)des_SP+0x300+((t>> 8)&0xfc))+ \ 218 *(DES_LONG *)((unsigned char *)des_SP+0x500+((t>>16)&0xfc))+ \ 219 *(DES_LONG *)((unsigned char *)des_SP+0x700+((t>>24)&0xfc))+ \ 220 *(DES_LONG *)((unsigned char *)des_SP +((u )&0xfc))+ \ 221 *(DES_LONG *)((unsigned char *)des_SP+0x200+((u>> 8)&0xfc))+ \ 222 *(DES_LONG *)((unsigned char *)des_SP+0x400+((u>>16)&0xfc))+ \ 223 *(DES_LONG *)((unsigned char *)des_SP+0x600+((u>>24)&0xfc))); } 224 #else /* original version */ 225 #ifdef undef 226 #define D_ENCRYPT(L,R,S) \ 227 U.l=R^s[S+1]; \ 228 T.s[0]=((U.s[0]>>4)|(U.s[1]<<12))&0x3f3f; \ 229 T.s[1]=((U.s[1]>>4)|(U.s[0]<<12))&0x3f3f; \ 230 U.l=(R^s[S ])&0x3f3f3f3fL; \ 231 L^= des_SPtrans[1][(T.c[0])]| \ 232 des_SPtrans[3][(T.c[1])]| \ 233 des_SPtrans[5][(T.c[2])]| \ 234 des_SPtrans[7][(T.c[3])]| \ 235 des_SPtrans[0][(U.c[0])]| \ 236 des_SPtrans[2][(U.c[1])]| \ 237 des_SPtrans[4][(U.c[2])]| \ 238 des_SPtrans[6][(U.c[3])]; 239 #else 240 #define D_ENCRYPT(Q,R,S) {\ 241 u=(R^s[S ]); \ 242 t=R^s[S+1]; \ 243 t=ROTATE(t,4); \ 244 Q^= des_SPtrans[1][(t )&0x3f]| \ 245 des_SPtrans[3][(t>> 8L)&0x3f]| \ 246 des_SPtrans[5][(t>>16L)&0x3f]| \ 247 des_SPtrans[7][(t>>24L)&0x3f]| \ 248 des_SPtrans[0][(u )&0x3f]| \ 249 des_SPtrans[2][(u>> 8L)&0x3f]| \ 250 des_SPtrans[4][(u>>16L)&0x3f]| \ 251 des_SPtrans[6][(u>>24L)&0x3f]; } 252 #endif 253 #endif 254 255 /* IP and FP 256 * The problem is more of a geometric problem that random bit fiddling. 257 0 1 2 3 4 5 6 7 62 54 46 38 30 22 14 6 258 8 9 10 11 12 13 14 15 60 52 44 36 28 20 12 4 259 16 17 18 19 20 21 22 23 58 50 42 34 26 18 10 2 260 24 25 26 27 28 29 30 31 to 56 48 40 32 24 16 8 0 261 262 32 33 34 35 36 37 38 39 63 55 47 39 31 23 15 7 263 40 41 42 43 44 45 46 47 61 53 45 37 29 21 13 5 264 48 49 50 51 52 53 54 55 59 51 43 35 27 19 11 3 265 56 57 58 59 60 61 62 63 57 49 41 33 25 17 9 1 266 267 The output has been subject to swaps of the form 268 0 1 -> 3 1 but the odd and even bits have been put into 269 2 3 2 0 270 different words. The main trick is to remember that 271 t=((l>>size)^r)&(mask); 272 r^=t; 273 l^=(t<<size); 274 can be used to swap and move bits between words. 275 276 So l = 0 1 2 3 r = 16 17 18 19 277 4 5 6 7 20 21 22 23 278 8 9 10 11 24 25 26 27 279 12 13 14 15 28 29 30 31 280 becomes (for size == 2 and mask == 0x3333) 281 t = 2^16 3^17 -- -- l = 0 1 16 17 r = 2 3 18 19 282 6^20 7^21 -- -- 4 5 20 21 6 7 22 23 283 10^24 11^25 -- -- 8 9 24 25 10 11 24 25 284 14^28 15^29 -- -- 12 13 28 29 14 15 28 29 285 286 Thanks for hints from Richard Outerbridge - he told me IP&FP 287 could be done in 15 xor, 10 shifts and 5 ands. 288 When I finally started to think of the problem in 2D 289 I first got ~42 operations without xors. When I remembered 290 how to use xors :-) I got it to its final state. 291 */ 292 #define PERM_OP(a,b,t,n,m) ((t)=((((a)>>(n))^(b))&(m)),\ 293 (b)^=(t),\ 294 (a)^=((t)<<(n))) 295 296 #define IP(l,r) \ 297 { \ 298 register DES_LONG tt; \ 299 PERM_OP(r,l,tt, 4,0x0f0f0f0fL); \ 300 PERM_OP(l,r,tt,16,0x0000ffffL); \ 301 PERM_OP(r,l,tt, 2,0x33333333L); \ 302 PERM_OP(l,r,tt, 8,0x00ff00ffL); \ 303 PERM_OP(r,l,tt, 1,0x55555555L); \ 304 } 305 306 #define FP(l,r) \ 307 { \ 308 register DES_LONG tt; \ 309 PERM_OP(l,r,tt, 1,0x55555555L); \ 310 PERM_OP(r,l,tt, 8,0x00ff00ffL); \ 311 PERM_OP(l,r,tt, 2,0x33333333L); \ 312 PERM_OP(r,l,tt,16,0x0000ffffL); \ 313 PERM_OP(l,r,tt, 4,0x0f0f0f0fL); \ 314 } 315 #endif 316 317 318 /* 319 #define mbuf2char(i_mbuf, i_index, in) \ 320 { \ 321 register int i; \ 322 struct mbuf *m; \ 323 char *buf; \ 324 m = i_mbuf; \ 325 for (i = 0; i < 8; i ++){ \ 326 if (i_index + i == m->m_len){ \ 327 m = m->m_next; \ 328 } \ 329 buf = mtod(m, char *); \ 330 in[i] = *(buf + i); \ 331 } 332 333 334 #define char2mbuf(o_mbuf, o_index, out) \ 335 { \ 336 register int i; \ 337 struct mbuf *m; \ 338 char *buf; \ 339 m = o_mbuf; \ 340 for (i = 0; i < 8; i ++){ \ 341 if (i_index + i == m->m_len){ \ 342 m = m->m_next; \ 343 } \ 344 buf = mtod(m, char *); \ 345 *(buf + i) = out[i]; \ 346 } 347 */ 348 349
Indexes created Thu Oct 02 01:09:59 GMT 2025