src/rxkad/md4.c

   1 /*
   2  * Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan
   3  * (Royal Institute of Technology, Stockholm, Sweden).
   4  * All rights reserved.
   5  *
   6  * Redistribution and use in source and binary forms, with or without
   7  * modification, are permitted provided that the following conditions
   8  * are met:
   9  *
  10  * 1. Redistributions of source code must retain the above copyright
  11  *    notice, this list of conditions and the following disclaimer.
  12  *
  13  * 2. Redistributions in binary form must reproduce the above copyright
  14  *    notice, this list of conditions and the following disclaimer in the
  15  *    documentation and/or other materials provided with the distribution.
  16  *
  17  * 3. Neither the name of the Institute nor the names of its contributors
  18  *    may be used to endorse or promote products derived from this software
  19  *    without specific prior written permission.
  20  *
  21  * THIS SOFTWARE IS PROVIDED BY THE INSTITUTE AND CONTRIBUTORS ``AS IS'' AND
  22  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  23  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  24  * ARE DISCLAIMED.  IN NO EVENT SHALL THE INSTITUTE OR CONTRIBUTORS BE LIABLE
  25  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  26  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  27  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  28  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  29  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  30  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  31  * SUCH DAMAGE.
  32  */
  33
  34 #include <afsconfig.h>
  35 #include <afs/param.h>
  36
  37 #include <afs/stds.h>
  38 #include <sys/types.h>
  39 #ifdef AFS_NT40_ENV
  40 #include <winsock2.h>
  41 #else
  42 #include <netinet/in.h>
  43 #endif
  44 #include <string.h>
  45 #include <rx/xdr.h>
  46 #include <rx/rx.h>
  47 #include "rxkad.h"
  48 #include <des.h>
  49 #include "lifetimes.h"
  50 #include "md4.h"
  51 #include "hash.h"
  52
  53 #define A m->counter[0]
  54 #define B m->counter[1]
  55 #define C m->counter[2]
  56 #define D m->counter[3]
  57 #define X data
  58
  59 void
  60 MD4_Init(struct md4 *m)
  61 {
  62     m->sz[0] = 0;
  63     m->sz[1] = 0;
  64     D = 0x10325476;
  65     C = 0x98badcfe;
  66     B = 0xefcdab89;
  67     A = 0x67452301;
  68 }
  69
  70 #define F(x,y,z) CRAYFIX((x & y) | (~x & z))
  71 #define G(x,y,z) ((x & y) | (x & z) | (y & z))
  72 #define H(x,y,z) (x ^ y ^ z)
  73
  74 #define DOIT(a,b,c,d,k,s,i,OP) \
  75 a = cshift(a + OP(b,c,d) + X[k] + i, s)
  76
  77 #define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
  78 #define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
  79 #define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
  80
  81 static inline void
  82 calc(struct md4 *m, afs_uint32 * data)
  83 {
  84     afs_uint32 AA, BB, CC, DD;
  85
  86     AA = A;
  87     BB = B;
  88     CC = C;
  89     DD = D;
  90
  91     /* Round 1 */
  92
  93     DO1(A, B, C, D, 0, 3, 0);
  94     DO1(D, A, B, C, 1, 7, 0);
  95     DO1(C, D, A, B, 2, 11, 0);
  96     DO1(B, C, D, A, 3, 19, 0);
  97
  98     DO1(A, B, C, D, 4, 3, 0);
  99     DO1(D, A, B, C, 5, 7, 0);
 100     DO1(C, D, A, B, 6, 11, 0);
 101     DO1(B, C, D, A, 7, 19, 0);
 102
 103     DO1(A, B, C, D, 8, 3, 0);
 104     DO1(D, A, B, C, 9, 7, 0);
 105     DO1(C, D, A, B, 10, 11, 0);
 106     DO1(B, C, D, A, 11, 19, 0);
 107
 108     DO1(A, B, C, D, 12, 3, 0);
 109     DO1(D, A, B, C, 13, 7, 0);
 110     DO1(C, D, A, B, 14, 11, 0);
 111     DO1(B, C, D, A, 15, 19, 0);
 112
 113     /* Round 2 */
 114
 115     DO2(A, B, C, D, 0, 3, 0x5A827999);
 116     DO2(D, A, B, C, 4, 5, 0x5A827999);
 117     DO2(C, D, A, B, 8, 9, 0x5A827999);
 118     DO2(B, C, D, A, 12, 13, 0x5A827999);
 119
 120     DO2(A, B, C, D, 1, 3, 0x5A827999);
 121     DO2(D, A, B, C, 5, 5, 0x5A827999);
 122     DO2(C, D, A, B, 9, 9, 0x5A827999);
 123     DO2(B, C, D, A, 13, 13, 0x5A827999);
 124
 125     DO2(A, B, C, D, 2, 3, 0x5A827999);
 126     DO2(D, A, B, C, 6, 5, 0x5A827999);
 127     DO2(C, D, A, B, 10, 9, 0x5A827999);
 128     DO2(B, C, D, A, 14, 13, 0x5A827999);
 129
 130     DO2(A, B, C, D, 3, 3, 0x5A827999);
 131     DO2(D, A, B, C, 7, 5, 0x5A827999);
 132     DO2(C, D, A, B, 11, 9, 0x5A827999);
 133     DO2(B, C, D, A, 15, 13, 0x5A827999);
 134
 135     /* Round 3 */
 136
 137     DO3(A, B, C, D, 0, 3, 0x6ED9EBA1);
 138     DO3(D, A, B, C, 8, 9, 0x6ED9EBA1);
 139     DO3(C, D, A, B, 4, 11, 0x6ED9EBA1);
 140     DO3(B, C, D, A, 12, 15, 0x6ED9EBA1);
 141
 142     DO3(A, B, C, D, 2, 3, 0x6ED9EBA1);
 143     DO3(D, A, B, C, 10, 9, 0x6ED9EBA1);
 144     DO3(C, D, A, B, 6, 11, 0x6ED9EBA1);
 145     DO3(B, C, D, A, 14, 15, 0x6ED9EBA1);
 146
 147     DO3(A, B, C, D, 1, 3, 0x6ED9EBA1);
 148     DO3(D, A, B, C, 9, 9, 0x6ED9EBA1);
 149     DO3(C, D, A, B, 5, 11, 0x6ED9EBA1);
 150     DO3(B, C, D, A, 13, 15, 0x6ED9EBA1);
 151
 152     DO3(A, B, C, D, 3, 3, 0x6ED9EBA1);
 153     DO3(D, A, B, C, 11, 9, 0x6ED9EBA1);
 154     DO3(C, D, A, B, 7, 11, 0x6ED9EBA1);
 155     DO3(B, C, D, A, 15, 15, 0x6ED9EBA1);
 156
 157     A += AA;
 158     B += BB;
 159     C += CC;
 160     D += DD;
 161 }
 162
 163 /*
 164  * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
 165  */
 166
 167 #if defined(WORDS_BIGENDIAN)
 168 static inline afs_uint32
 169 swap_afs_uint32(afs_uint32 t)
 170 {
 171     afs_uint32 temp1, temp2;
 172
 173     temp1 = cshift(t, 16);
 174     temp2 = temp1 >> 8;
 175     temp1 &= 0x00ff00ff;
 176     temp2 &= 0x00ff00ff;
 177     temp1 <<= 8;
 178     return temp1 | temp2;
 179 }
 180 #endif
 181
 182 struct x32 {
 183     unsigned int a:32;
 184     unsigned int b:32;
 185 };
 186
 187 void
 188 MD4_Update(struct md4 *m, const void *v, size_t len)
 189 {
 190     const unsigned char *p = v;
 191     size_t old_sz = m->sz[0];
 192     size_t offset;
 193
 194     m->sz[0] += len * 8;
 195     if (m->sz[0] < old_sz)
 196         ++m->sz[1];
 197     offset = (old_sz / 8) % 64;
 198     while (len > 0) {
 199         size_t l = min(len, 64 - offset);
 200         memcpy(m->save + offset, p, l);
 201         offset += l;
 202         p += l;
 203         len -= l;
 204         if (offset == 64) {
 205 #if defined(WORDS_BIGENDIAN)
 206             int i;
 207             afs_uint32 current[16];
 208             struct x32 *u = (struct x32 *)m->save;
 209             for (i = 0; i < 8; i++) {
 210                 current[2 * i + 0] = swap_afs_uint32(u[i].a);
 211                 current[2 * i + 1] = swap_afs_uint32(u[i].b);
 212             }
 213             calc(m, current);
 214 #else
 215             calc(m, (afs_uint32 *) m->save);
 216 #endif
 217             offset = 0;
 218         }
 219     }
 220 }
 221
 222 void
 223 MD4_Final(void *res, struct md4 *m)
 224 {
 225     static unsigned char zeros[72];
 226     unsigned offset = (m->sz[0] / 8) % 64;
 227     unsigned int dstart = (120 - offset - 1) % 64 + 1;
 228
 229     *zeros = 0x80;
 230     memset(zeros + 1, 0, sizeof(zeros) - 1);
 231     zeros[dstart + 0] = (m->sz[0] >> 0) & 0xff;
 232     zeros[dstart + 1] = (m->sz[0] >> 8) & 0xff;
 233     zeros[dstart + 2] = (m->sz[0] >> 16) & 0xff;
 234     zeros[dstart + 3] = (m->sz[0] >> 24) & 0xff;
 235     zeros[dstart + 4] = (m->sz[1] >> 0) & 0xff;
 236     zeros[dstart + 5] = (m->sz[1] >> 8) & 0xff;
 237     zeros[dstart + 6] = (m->sz[1] >> 16) & 0xff;
 238     zeros[dstart + 7] = (m->sz[1] >> 24) & 0xff;
 239     MD4_Update(m, zeros, dstart + 8);
 240     {
 241         int i;
 242         unsigned char *r = (unsigned char *)res;
 243
 244         for (i = 0; i < 4; ++i) {
 245             r[4 * i] = m->counter[i] & 0xFF;
 246             r[4 * i + 1] = (m->counter[i] >> 8) & 0xFF;
 247             r[4 * i + 2] = (m->counter[i] >> 16) & 0xFF;
 248             r[4 * i + 3] = (m->counter[i] >> 24) & 0xFF;
 249         }
 250     }
 251 #if 0
 252     {
 253         int i;
 254         afs_uint32 *r = (afs_uint32 *) res;
 255
 256         for (i = 0; i < 4; ++i)
 257             r[i] = swap_afs_uint32(m->counter[i]);
 258     }
 259 #endif
 260 }