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) */
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 MD5_Init(struct md5 *m)
99 #define F(x,y,z) CRAYFIX((x & y) | (~x & z))
100 #define G(x,y,z) CRAYFIX((x & z) | (y & ~z))
101 #define H(x,y,z) (x ^ y ^ z)
102 #define I(x,y,z) CRAYFIX(y ^ (x | ~z))
104 #define DOIT(a,b,c,d,k,s,i,OP) \
105 a = b + cshift(a + OP(b,c,d) + X[k] + (i), s)
107 #define DO1(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,F)
108 #define DO2(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,G)
109 #define DO3(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,H)
110 #define DO4(a,b,c,d,k,s,i) DOIT(a,b,c,d,k,s,i,I)
113 calc(struct md5 *m, afs_uint32 * data)
115 afs_uint32 AA, BB, CC, DD;
124 DO1(A, B, C, D, 0, 7, 0xd76aa478);
125 DO1(D, A, B, C, 1, 12, 0xe8c7b756);
126 DO1(C, D, A, B, 2, 17, 0x242070db);
127 DO1(B, C, D, A, 3, 22, 0xc1bdceee);
129 DO1(A, B, C, D, 4, 7, 0xf57c0faf);
130 DO1(D, A, B, C, 5, 12, 0x4787c62a);
131 DO1(C, D, A, B, 6, 17, 0xa8304613);
132 DO1(B, C, D, A, 7, 22, 0xfd469501);
134 DO1(A, B, C, D, 8, 7, 0x698098d8);
135 DO1(D, A, B, C, 9, 12, 0x8b44f7af);
136 DO1(C, D, A, B, 10, 17, 0xffff5bb1);
137 DO1(B, C, D, A, 11, 22, 0x895cd7be);
139 DO1(A, B, C, D, 12, 7, 0x6b901122);
140 DO1(D, A, B, C, 13, 12, 0xfd987193);
141 DO1(C, D, A, B, 14, 17, 0xa679438e);
142 DO1(B, C, D, A, 15, 22, 0x49b40821);
146 DO2(A, B, C, D, 1, 5, 0xf61e2562);
147 DO2(D, A, B, C, 6, 9, 0xc040b340);
148 DO2(C, D, A, B, 11, 14, 0x265e5a51);
149 DO2(B, C, D, A, 0, 20, 0xe9b6c7aa);
151 DO2(A, B, C, D, 5, 5, 0xd62f105d);
152 DO2(D, A, B, C, 10, 9, 0x2441453);
153 DO2(C, D, A, B, 15, 14, 0xd8a1e681);
154 DO2(B, C, D, A, 4, 20, 0xe7d3fbc8);
156 DO2(A, B, C, D, 9, 5, 0x21e1cde6);
157 DO2(D, A, B, C, 14, 9, 0xc33707d6);
158 DO2(C, D, A, B, 3, 14, 0xf4d50d87);
159 DO2(B, C, D, A, 8, 20, 0x455a14ed);
161 DO2(A, B, C, D, 13, 5, 0xa9e3e905);
162 DO2(D, A, B, C, 2, 9, 0xfcefa3f8);
163 DO2(C, D, A, B, 7, 14, 0x676f02d9);
164 DO2(B, C, D, A, 12, 20, 0x8d2a4c8a);
168 DO3(A, B, C, D, 5, 4, 0xfffa3942);
169 DO3(D, A, B, C, 8, 11, 0x8771f681);
170 DO3(C, D, A, B, 11, 16, 0x6d9d6122);
171 DO3(B, C, D, A, 14, 23, 0xfde5380c);
173 DO3(A, B, C, D, 1, 4, 0xa4beea44);
174 DO3(D, A, B, C, 4, 11, 0x4bdecfa9);
175 DO3(C, D, A, B, 7, 16, 0xf6bb4b60);
176 DO3(B, C, D, A, 10, 23, 0xbebfbc70);
178 DO3(A, B, C, D, 13, 4, 0x289b7ec6);
179 DO3(D, A, B, C, 0, 11, 0xeaa127fa);
180 DO3(C, D, A, B, 3, 16, 0xd4ef3085);
181 DO3(B, C, D, A, 6, 23, 0x4881d05);
183 DO3(A, B, C, D, 9, 4, 0xd9d4d039);
184 DO3(D, A, B, C, 12, 11, 0xe6db99e5);
185 DO3(C, D, A, B, 15, 16, 0x1fa27cf8);
186 DO3(B, C, D, A, 2, 23, 0xc4ac5665);
190 DO4(A, B, C, D, 0, 6, 0xf4292244);
191 DO4(D, A, B, C, 7, 10, 0x432aff97);
192 DO4(C, D, A, B, 14, 15, 0xab9423a7);
193 DO4(B, C, D, A, 5, 21, 0xfc93a039);
195 DO4(A, B, C, D, 12, 6, 0x655b59c3);
196 DO4(D, A, B, C, 3, 10, 0x8f0ccc92);
197 DO4(C, D, A, B, 10, 15, 0xffeff47d);
198 DO4(B, C, D, A, 1, 21, 0x85845dd1);
200 DO4(A, B, C, D, 8, 6, 0x6fa87e4f);
201 DO4(D, A, B, C, 15, 10, 0xfe2ce6e0);
202 DO4(C, D, A, B, 6, 15, 0xa3014314);
203 DO4(B, C, D, A, 13, 21, 0x4e0811a1);
205 DO4(A, B, C, D, 4, 6, 0xf7537e82);
206 DO4(D, A, B, C, 11, 10, 0xbd3af235);
207 DO4(C, D, A, B, 2, 15, 0x2ad7d2bb);
208 DO4(B, C, D, A, 9, 21, 0xeb86d391);
217 * From `Performance analysis of MD5' by Joseph D. Touch <touch@isi.edu>
220 #if defined(WORDS_BIGENDIAN)
221 static inline afs_uint32
222 swap_afs_uint32(afs_uint32 t)
224 afs_uint32 temp1, temp2;
226 temp1 = cshift(t, 16);
231 return temp1 | temp2;
241 MD5_Update(struct md5 *m, const void *v, size_t len)
243 const unsigned char *p = v;
244 size_t old_sz = m->sz[0];
248 if (m->sz[0] < old_sz)
250 offset = (old_sz / 8) % 64;
252 size_t l = min(len, 64 - offset);
253 memcpy(m->save + offset, p, l);
258 #if defined(WORDS_BIGENDIAN)
260 afs_uint32 current[16];
261 struct x32 *u = (struct x32 *)m->save;
262 for (i = 0; i < 8; i++) {
263 current[2 * i + 0] = swap_afs_uint32(u[i].a);
264 current[2 * i + 1] = swap_afs_uint32(u[i].b);
268 calc(m, (afs_uint32 *) m->save);
276 MD5_Final(void *res, struct md5 *m)
278 static unsigned char zeros[72];
279 unsigned offset = (m->sz[0] / 8) % 64;
280 unsigned int dstart = (120 - offset - 1) % 64 + 1;
283 memset(zeros + 1, 0, sizeof(zeros) - 1);
284 zeros[dstart + 0] = (m->sz[0] >> 0) & 0xff;
285 zeros[dstart + 1] = (m->sz[0] >> 8) & 0xff;
286 zeros[dstart + 2] = (m->sz[0] >> 16) & 0xff;
287 zeros[dstart + 3] = (m->sz[0] >> 24) & 0xff;
288 zeros[dstart + 4] = (m->sz[1] >> 0) & 0xff;
289 zeros[dstart + 5] = (m->sz[1] >> 8) & 0xff;
290 zeros[dstart + 6] = (m->sz[1] >> 16) & 0xff;
291 zeros[dstart + 7] = (m->sz[1] >> 24) & 0xff;
292 MD5_Update(m, zeros, dstart + 8);
295 unsigned char *r = (unsigned char *)res;
297 for (i = 0; i < 4; ++i) {
298 r[4 * i] = m->counter[i] & 0xFF;
299 r[4 * i + 1] = (m->counter[i] >> 8) & 0xFF;
300 r[4 * i + 2] = (m->counter[i] >> 16) & 0xFF;
301 r[4 * i + 3] = (m->counter[i] >> 24) & 0xFF;
307 afs_uint32 *r = (afs_uint32 *) res;
309 for (i = 0; i < 4; ++i)
310 r[i] = swap_afs_uint32(m->counter[i]);