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>
62 #include "lifetimes.h"
64 #endif /* defined(UKERNEL) */
76 #define A m->counter[0]
77 #define B m->counter[1]
78 #define C m->counter[2]
79 #define D m->counter[3]
83 MD4_Init(struct md4 *m)
93 #define F(x,y,z) CRAYFIX((x & y) | (~x & z))
94 #define G(x,y,z) ((x & y) | (x & z) | (y & z))
95 #define H(x,y,z) (x ^ y ^ z)
97 #define DOIT(a,b,c,d,k,s,i,OP) \
98 a = cshift(a + OP(b,c,d) + X[k] + i, s)
100 #define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
101 #define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
102 #define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
105 calc(struct md4 *m, afs_uint32 * data)
107 afs_uint32 AA, BB, CC, DD;
116 DO1(A, B, C, D, 0, 3, 0);
117 DO1(D, A, B, C, 1, 7, 0);
118 DO1(C, D, A, B, 2, 11, 0);
119 DO1(B, C, D, A, 3, 19, 0);
121 DO1(A, B, C, D, 4, 3, 0);
122 DO1(D, A, B, C, 5, 7, 0);
123 DO1(C, D, A, B, 6, 11, 0);
124 DO1(B, C, D, A, 7, 19, 0);
126 DO1(A, B, C, D, 8, 3, 0);
127 DO1(D, A, B, C, 9, 7, 0);
128 DO1(C, D, A, B, 10, 11, 0);
129 DO1(B, C, D, A, 11, 19, 0);
131 DO1(A, B, C, D, 12, 3, 0);
132 DO1(D, A, B, C, 13, 7, 0);
133 DO1(C, D, A, B, 14, 11, 0);
134 DO1(B, C, D, A, 15, 19, 0);
138 DO2(A, B, C, D, 0, 3, 0x5A827999);
139 DO2(D, A, B, C, 4, 5, 0x5A827999);
140 DO2(C, D, A, B, 8, 9, 0x5A827999);
141 DO2(B, C, D, A, 12, 13, 0x5A827999);
143 DO2(A, B, C, D, 1, 3, 0x5A827999);
144 DO2(D, A, B, C, 5, 5, 0x5A827999);
145 DO2(C, D, A, B, 9, 9, 0x5A827999);
146 DO2(B, C, D, A, 13, 13, 0x5A827999);
148 DO2(A, B, C, D, 2, 3, 0x5A827999);
149 DO2(D, A, B, C, 6, 5, 0x5A827999);
150 DO2(C, D, A, B, 10, 9, 0x5A827999);
151 DO2(B, C, D, A, 14, 13, 0x5A827999);
153 DO2(A, B, C, D, 3, 3, 0x5A827999);
154 DO2(D, A, B, C, 7, 5, 0x5A827999);
155 DO2(C, D, A, B, 11, 9, 0x5A827999);
156 DO2(B, C, D, A, 15, 13, 0x5A827999);
160 DO3(A, B, C, D, 0, 3, 0x6ED9EBA1);
161 DO3(D, A, B, C, 8, 9, 0x6ED9EBA1);
162 DO3(C, D, A, B, 4, 11, 0x6ED9EBA1);
163 DO3(B, C, D, A, 12, 15, 0x6ED9EBA1);
165 DO3(A, B, C, D, 2, 3, 0x6ED9EBA1);
166 DO3(D, A, B, C, 10, 9, 0x6ED9EBA1);
167 DO3(C, D, A, B, 6, 11, 0x6ED9EBA1);
168 DO3(B, C, D, A, 14, 15, 0x6ED9EBA1);
170 DO3(A, B, C, D, 1, 3, 0x6ED9EBA1);
171 DO3(D, A, B, C, 9, 9, 0x6ED9EBA1);
172 DO3(C, D, A, B, 5, 11, 0x6ED9EBA1);
173 DO3(B, C, D, A, 13, 15, 0x6ED9EBA1);
175 DO3(A, B, C, D, 3, 3, 0x6ED9EBA1);
176 DO3(D, A, B, C, 11, 9, 0x6ED9EBA1);
177 DO3(C, D, A, B, 7, 11, 0x6ED9EBA1);
178 DO3(B, C, D, A, 15, 15, 0x6ED9EBA1);
187 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
190 #if defined(WORDS_BIGENDIAN)
191 static inline afs_uint32
192 swap_afs_uint32(afs_uint32 t)
194 afs_uint32 temp1, temp2;
196 temp1 = cshift(t, 16);
201 return temp1 | temp2;
211 MD4_Update(struct md4 *m, const void *v, size_t len)
213 const unsigned char *p = v;
214 size_t old_sz = m->sz[0];
218 if (m->sz[0] < old_sz)
220 offset = (old_sz / 8) % 64;
222 size_t l = min(len, 64 - offset);
223 memcpy(m->save + offset, p, l);
228 #if defined(WORDS_BIGENDIAN)
230 afs_uint32 current[16];
231 struct x32 *u = (struct x32 *)m->save;
232 for (i = 0; i < 8; i++) {
233 current[2 * i + 0] = swap_afs_uint32(u[i].a);
234 current[2 * i + 1] = swap_afs_uint32(u[i].b);
238 calc(m, (afs_uint32 *) m->save);
246 MD4_Final(void *res, struct md4 *m)
248 static unsigned char zeros[72];
249 unsigned offset = (m->sz[0] / 8) % 64;
250 unsigned int dstart = (120 - offset - 1) % 64 + 1;
253 memset(zeros + 1, 0, sizeof(zeros) - 1);
254 zeros[dstart + 0] = (m->sz[0] >> 0) & 0xff;
255 zeros[dstart + 1] = (m->sz[0] >> 8) & 0xff;
256 zeros[dstart + 2] = (m->sz[0] >> 16) & 0xff;
257 zeros[dstart + 3] = (m->sz[0] >> 24) & 0xff;
258 zeros[dstart + 4] = (m->sz[1] >> 0) & 0xff;
259 zeros[dstart + 5] = (m->sz[1] >> 8) & 0xff;
260 zeros[dstart + 6] = (m->sz[1] >> 16) & 0xff;
261 zeros[dstart + 7] = (m->sz[1] >> 24) & 0xff;
262 MD4_Update(m, zeros, dstart + 8);
265 unsigned char *r = (unsigned char *)res;
267 for (i = 0; i < 4; ++i) {
268 r[4 * i] = m->counter[i] & 0xFF;
269 r[4 * i + 1] = (m->counter[i] >> 8) & 0xFF;
270 r[4 * i + 2] = (m->counter[i] >> 16) & 0xFF;
271 r[4 * i + 3] = (m->counter[i] >> 24) & 0xFF;
277 afs_uint32 *r = (afs_uint32 *) res;
279 for (i = 0; i < 4; ++i)
280 r[i] = swap_afs_uint32(m->counter[i]);