2 * Copyright (c) 1995 - 2001 Kungliga Tekniska Högskolan
3 * (Royal Institute of Technology, Stockholm, Sweden).
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * 1. Redistributions of source code must retain the above copyright
11 * notice, this list of conditions and the following disclaimer.
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.
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.
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
34 #include <afsconfig.h>
36 #include "../afs/param.h"
38 #include <afs/param.h>
42 #include "../afs/sysincludes.h"
43 #include "../afs/afsincludes.h"
44 #include "../afs/stds.h"
45 #include "../rx/xdr.h"
47 #include "../des/des.h"
48 #include "../afs/lifetimes.h"
49 #include "../afs/rxkad.h"
50 #else /* defined(UKERNEL) */
52 #include <sys/types.h>
56 #include <netinet/in.h>
68 #include "lifetimes.h"
70 #endif /* defined(UKERNEL) */
74 #undef WORDS_BIGENDIAN
76 #define WORDS_BIGENDIAN 1
82 #define A m->counter[0]
83 #define B m->counter[1]
84 #define C m->counter[2]
85 #define D m->counter[3]
89 MD4_Init (struct md4 *m)
99 #define F(x,y,z) CRAYFIX((x & y) | (~x & z))
100 #define G(x,y,z) ((x & y) | (x & z) | (y & z))
101 #define H(x,y,z) (x ^ y ^ z)
103 #define DOIT(a,b,c,d,k,s,i,OP) \
104 a = cshift(a + OP(b,c,d) + X[k] + i, s)
106 #define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
107 #define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
108 #define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
111 calc (struct md4 *m, afs_uint32 *data)
113 afs_uint32 AA, BB, CC, DD;
134 DO1(C,D,A,B,10,11,0);
135 DO1(B,C,D,A,11,19,0);
139 DO1(C,D,A,B,14,11,0);
140 DO1(B,C,D,A,15,19,0);
144 DO2(A,B,C,D,0,3,0x5A827999);
145 DO2(D,A,B,C,4,5,0x5A827999);
146 DO2(C,D,A,B,8,9,0x5A827999);
147 DO2(B,C,D,A,12,13,0x5A827999);
149 DO2(A,B,C,D,1,3,0x5A827999);
150 DO2(D,A,B,C,5,5,0x5A827999);
151 DO2(C,D,A,B,9,9,0x5A827999);
152 DO2(B,C,D,A,13,13,0x5A827999);
154 DO2(A,B,C,D,2,3,0x5A827999);
155 DO2(D,A,B,C,6,5,0x5A827999);
156 DO2(C,D,A,B,10,9,0x5A827999);
157 DO2(B,C,D,A,14,13,0x5A827999);
159 DO2(A,B,C,D,3,3,0x5A827999);
160 DO2(D,A,B,C,7,5,0x5A827999);
161 DO2(C,D,A,B,11,9,0x5A827999);
162 DO2(B,C,D,A,15,13,0x5A827999);
166 DO3(A,B,C,D,0,3,0x6ED9EBA1);
167 DO3(D,A,B,C,8,9,0x6ED9EBA1);
168 DO3(C,D,A,B,4,11,0x6ED9EBA1);
169 DO3(B,C,D,A,12,15,0x6ED9EBA1);
171 DO3(A,B,C,D,2,3,0x6ED9EBA1);
172 DO3(D,A,B,C,10,9,0x6ED9EBA1);
173 DO3(C,D,A,B,6,11,0x6ED9EBA1);
174 DO3(B,C,D,A,14,15,0x6ED9EBA1);
176 DO3(A,B,C,D,1,3,0x6ED9EBA1);
177 DO3(D,A,B,C,9,9,0x6ED9EBA1);
178 DO3(C,D,A,B,5,11,0x6ED9EBA1);
179 DO3(B,C,D,A,13,15,0x6ED9EBA1);
181 DO3(A,B,C,D,3,3,0x6ED9EBA1);
182 DO3(D,A,B,C,11,9,0x6ED9EBA1);
183 DO3(C,D,A,B,7,11,0x6ED9EBA1);
184 DO3(B,C,D,A,15,15,0x6ED9EBA1);
193 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
196 #if defined(WORDS_BIGENDIAN)
197 static inline afs_uint32
198 swap_afs_uint32 (afs_uint32 t)
200 afs_uint32 temp1, temp2;
202 temp1 = cshift(t, 16);
207 return temp1 | temp2;
217 MD4_Update (struct md4 *m, const void *v, size_t len)
219 const unsigned char *p = v;
220 size_t old_sz = m->sz[0];
224 if (m->sz[0] < old_sz)
226 offset = (old_sz / 8) % 64;
228 size_t l = min(len, 64 - offset);
229 memcpy(m->save + offset, p, l);
234 #if defined(WORDS_BIGENDIAN)
236 afs_uint32 current[16];
237 struct x32 *u = (struct x32*)m->save;
238 for(i = 0; i < 8; i++){
239 current[2*i+0] = swap_afs_uint32(u[i].a);
240 current[2*i+1] = swap_afs_uint32(u[i].b);
244 calc(m, (afs_uint32*)m->save);
252 MD4_Final (void *res, struct md4 *m)
254 static unsigned char zeros[72];
255 unsigned offset = (m->sz[0] / 8) % 64;
256 unsigned int dstart = (120 - offset - 1) % 64 + 1;
259 memset (zeros + 1, 0, sizeof(zeros) - 1);
260 zeros[dstart+0] = (m->sz[0] >> 0) & 0xff;
261 zeros[dstart+1] = (m->sz[0] >> 8) & 0xff;
262 zeros[dstart+2] = (m->sz[0] >> 16) & 0xff;
263 zeros[dstart+3] = (m->sz[0] >> 24) & 0xff;
264 zeros[dstart+4] = (m->sz[1] >> 0) & 0xff;
265 zeros[dstart+5] = (m->sz[1] >> 8) & 0xff;
266 zeros[dstart+6] = (m->sz[1] >> 16) & 0xff;
267 zeros[dstart+7] = (m->sz[1] >> 24) & 0xff;
268 MD4_Update (m, zeros, dstart + 8);
271 unsigned char *r = (unsigned char *)res;
273 for (i = 0; i < 4; ++i) {
274 r[4*i] = m->counter[i] & 0xFF;
275 r[4*i+1] = (m->counter[i] >> 8) & 0xFF;
276 r[4*i+2] = (m->counter[i] >> 16) & 0xFF;
277 r[4*i+3] = (m->counter[i] >> 24) & 0xFF;
283 afs_uint32 *r = (afs_uint32 *)res;
285 for (i = 0; i < 4; ++i)
286 r[i] = swap_afs_uint32 (m->counter[i]);