bsd/crypto/des/des_locl.h

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