]>
Commit | Line | Data |
---|---|---|
bba600dd A |
1 | /* |
2 | * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm | |
3 | * | |
4 | * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All | |
5 | * rights reserved. | |
6 | * | |
7 | * License to copy and use this software is granted provided that it | |
8 | * is identified as the "RSA Data Security, Inc. MD5 Message-Digest | |
9 | * Algorithm" in all material mentioning or referencing this software | |
10 | * or this function. | |
11 | * | |
12 | * License is also granted to make and use derivative works provided | |
13 | * that such works are identified as "derived from the RSA Data | |
14 | * Security, Inc. MD5 Message-Digest Algorithm" in all material | |
15 | * mentioning or referencing the derived work. | |
16 | * | |
17 | * RSA Data Security, Inc. makes no representations concerning either | |
18 | * the merchantability of this software or the suitability of this | |
19 | * software for any particular purpose. It is provided "as is" | |
20 | * without express or implied warranty of any kind. | |
21 | * | |
22 | * These notices must be retained in any copies of any part of this | |
23 | * documentation and/or software. | |
24 | * | |
25 | * $Id: md5c.c,v 1.1 2005/06/24 22:47:12 curtisg Exp $ | |
26 | * | |
27 | * This code is the same as the code published by RSA Inc. It has been | |
28 | * edited for clarity and style only. | |
29 | */ | |
30 | ||
31 | #include <sys/types.h> | |
32 | ||
33 | #ifdef KERNEL | |
34 | #include <sys/systm.h> | |
35 | #else | |
36 | #include <string.h> | |
37 | #endif | |
38 | ||
39 | #include <sys/md5.h> | |
40 | ||
41 | ||
42 | #ifdef KERNEL | |
43 | #define memset(x,y,z) bzero(x,z); | |
44 | #define memcpy(x,y,z) bcopy(y, x, z) | |
45 | #endif | |
46 | ||
47 | #if defined(__i386__) || defined(__alpha__) | |
48 | #define Encode memcpy | |
49 | #define Decode memcpy | |
50 | #else /* __i386__ */ | |
51 | ||
52 | /* | |
53 | * Encodes input (u_int32_t) into output (unsigned char). Assumes len is | |
54 | * a multiple of 4. | |
55 | */ | |
56 | ||
57 | /* XXX not prototyped, and not compatible with memcpy(). */ | |
58 | static void | |
59 | Encode (output, input, len) | |
60 | unsigned char *output; | |
61 | u_int32_t *input; | |
62 | unsigned int len; | |
63 | { | |
64 | unsigned int i, j; | |
65 | ||
66 | for (i = 0, j = 0; j < len; i++, j += 4) { | |
67 | output[j] = (unsigned char)(input[i] & 0xff); | |
68 | output[j+1] = (unsigned char)((input[i] >> 8) & 0xff); | |
69 | output[j+2] = (unsigned char)((input[i] >> 16) & 0xff); | |
70 | output[j+3] = (unsigned char)((input[i] >> 24) & 0xff); | |
71 | } | |
72 | } | |
73 | ||
74 | /* | |
75 | * Decodes input (unsigned char) into output (u_int32_t). Assumes len is | |
76 | * a multiple of 4. | |
77 | */ | |
78 | ||
79 | static void | |
80 | Decode (output, input, len) | |
81 | u_int32_t *output; | |
82 | const unsigned char *input; | |
83 | unsigned int len; | |
84 | { | |
85 | unsigned int i, j; | |
86 | ||
87 | for (i = 0, j = 0; j < len; i++, j += 4) | |
88 | output[i] = ((u_int32_t)input[j]) | (((u_int32_t)input[j+1]) << 8) | | |
89 | (((u_int32_t)input[j+2]) << 16) | (((u_int32_t)input[j+3]) << 24); | |
90 | } | |
91 | #endif /* i386 */ | |
92 | ||
93 | static unsigned char PADDING[64] = { | |
94 | 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | |
95 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, | |
96 | 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 | |
97 | }; | |
98 | ||
99 | /* F, G, H and I are basic MD5 functions. */ | |
100 | #define F(x, y, z) (((x) & (y)) | ((~x) & (z))) | |
101 | #define G(x, y, z) (((x) & (z)) | ((y) & (~z))) | |
102 | #define H(x, y, z) ((x) ^ (y) ^ (z)) | |
103 | #define I(x, y, z) ((y) ^ ((x) | (~z))) | |
104 | ||
105 | /* ROTATE_LEFT rotates x left n bits. */ | |
106 | #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n)))) | |
107 | ||
108 | /* | |
109 | * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4. | |
110 | * Rotation is separate from addition to prevent recomputation. | |
111 | */ | |
112 | #define FF(a, b, c, d, x, s, ac) { \ | |
113 | (a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \ | |
114 | (a) = ROTATE_LEFT ((a), (s)); \ | |
115 | (a) += (b); \ | |
116 | } | |
117 | #define GG(a, b, c, d, x, s, ac) { \ | |
118 | (a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \ | |
119 | (a) = ROTATE_LEFT ((a), (s)); \ | |
120 | (a) += (b); \ | |
121 | } | |
122 | #define HH(a, b, c, d, x, s, ac) { \ | |
123 | (a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \ | |
124 | (a) = ROTATE_LEFT ((a), (s)); \ | |
125 | (a) += (b); \ | |
126 | } | |
127 | #define II(a, b, c, d, x, s, ac) { \ | |
128 | (a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \ | |
129 | (a) = ROTATE_LEFT ((a), (s)); \ | |
130 | (a) += (b); \ | |
131 | } | |
132 | ||
133 | static void MD5Transform (u_int32_t state[4], const unsigned char block[64]); | |
134 | ||
135 | /* MD5 initialization. Begins an MD5 operation, writing a new context. */ | |
136 | ||
137 | void | |
138 | MD5Init (context) | |
139 | MD5_CTX *context; | |
140 | { | |
141 | ||
142 | context->count[0] = context->count[1] = 0; | |
143 | ||
144 | /* Load magic initialization constants. */ | |
145 | context->state[0] = 0x67452301; | |
146 | context->state[1] = 0xefcdab89; | |
147 | context->state[2] = 0x98badcfe; | |
148 | context->state[3] = 0x10325476; | |
149 | } | |
150 | ||
151 | /* | |
152 | * MD5 block update operation. Continues an MD5 message-digest | |
153 | * operation, processing another message block, and updating the | |
154 | * context. | |
155 | */ | |
156 | ||
157 | void | |
158 | MD5Update (context, input, inputLen) | |
159 | MD5_CTX *context; | |
160 | const unsigned char *input; | |
161 | unsigned int inputLen; | |
162 | { | |
163 | unsigned int i, index, partLen; | |
164 | ||
165 | /* Compute number of bytes mod 64 */ | |
166 | index = (unsigned int)((context->count[0] >> 3) & 0x3F); | |
167 | ||
168 | /* Update number of bits */ | |
169 | if ((context->count[0] += ((u_int32_t)inputLen << 3)) | |
170 | < ((u_int32_t)inputLen << 3)) | |
171 | context->count[1]++; | |
172 | context->count[1] += ((u_int32_t)inputLen >> 29); | |
173 | ||
174 | partLen = 64 - index; | |
175 | ||
176 | /* Transform as many times as possible. */ | |
177 | if (inputLen >= partLen) { | |
178 | memcpy((void *)&context->buffer[index], (const void *)input, | |
179 | partLen); | |
180 | MD5Transform (context->state, context->buffer); | |
181 | ||
182 | for (i = partLen; i + 63 < inputLen; i += 64) | |
183 | MD5Transform (context->state, &input[i]); | |
184 | ||
185 | index = 0; | |
186 | } | |
187 | else | |
188 | i = 0; | |
189 | ||
190 | /* Buffer remaining input */ | |
191 | memcpy ((void *)&context->buffer[index], (const void *)&input[i], | |
192 | inputLen-i); | |
193 | } | |
194 | ||
195 | /* | |
196 | * MD5 padding. Adds padding followed by original length. | |
197 | */ | |
198 | ||
199 | void | |
200 | MD5Pad (context) | |
201 | MD5_CTX *context; | |
202 | { | |
203 | unsigned char bits[8]; | |
204 | unsigned int index, padLen; | |
205 | ||
206 | /* Save number of bits */ | |
207 | Encode (bits, context->count, 8); | |
208 | ||
209 | /* Pad out to 56 mod 64. */ | |
210 | index = (unsigned int)((context->count[0] >> 3) & 0x3f); | |
211 | padLen = (index < 56) ? (56 - index) : (120 - index); | |
212 | MD5Update (context, PADDING, padLen); | |
213 | ||
214 | /* Append length (before padding) */ | |
215 | MD5Update (context, bits, 8); | |
216 | } | |
217 | ||
218 | /* | |
219 | * MD5 finalization. Ends an MD5 message-digest operation, writing the | |
220 | * the message digest and zeroizing the context. | |
221 | */ | |
222 | ||
223 | void | |
224 | MD5Final (digest, context) | |
225 | unsigned char digest[16]; | |
226 | MD5_CTX *context; | |
227 | { | |
228 | /* Do padding. */ | |
229 | MD5Pad (context); | |
230 | ||
231 | /* Store state in digest */ | |
232 | Encode (digest, context->state, 16); | |
233 | ||
234 | /* Zeroize sensitive information. */ | |
235 | memset ((void *)context, 0, sizeof (*context)); | |
236 | } | |
237 | ||
238 | /* MD5 basic transformation. Transforms state based on block. */ | |
239 | ||
240 | static void | |
241 | MD5Transform (state, block) | |
242 | u_int32_t state[4]; | |
243 | const unsigned char block[64]; | |
244 | { | |
245 | u_int32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16]; | |
246 | ||
247 | Decode (x, block, 64); | |
248 | ||
249 | /* Round 1 */ | |
250 | #define S11 7 | |
251 | #define S12 12 | |
252 | #define S13 17 | |
253 | #define S14 22 | |
254 | FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */ | |
255 | FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */ | |
256 | FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */ | |
257 | FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */ | |
258 | FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */ | |
259 | FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */ | |
260 | FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */ | |
261 | FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */ | |
262 | FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */ | |
263 | FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */ | |
264 | FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */ | |
265 | FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */ | |
266 | FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */ | |
267 | FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */ | |
268 | FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */ | |
269 | FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */ | |
270 | ||
271 | /* Round 2 */ | |
272 | #define S21 5 | |
273 | #define S22 9 | |
274 | #define S23 14 | |
275 | #define S24 20 | |
276 | GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */ | |
277 | GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */ | |
278 | GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */ | |
279 | GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */ | |
280 | GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */ | |
281 | GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */ | |
282 | GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */ | |
283 | GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */ | |
284 | GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */ | |
285 | GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */ | |
286 | GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */ | |
287 | GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */ | |
288 | GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */ | |
289 | GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */ | |
290 | GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */ | |
291 | GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */ | |
292 | ||
293 | /* Round 3 */ | |
294 | #define S31 4 | |
295 | #define S32 11 | |
296 | #define S33 16 | |
297 | #define S34 23 | |
298 | HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */ | |
299 | HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */ | |
300 | HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */ | |
301 | HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */ | |
302 | HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */ | |
303 | HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */ | |
304 | HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */ | |
305 | HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */ | |
306 | HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */ | |
307 | HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */ | |
308 | HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */ | |
309 | HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */ | |
310 | HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */ | |
311 | HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */ | |
312 | HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */ | |
313 | HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */ | |
314 | ||
315 | /* Round 4 */ | |
316 | #define S41 6 | |
317 | #define S42 10 | |
318 | #define S43 15 | |
319 | #define S44 21 | |
320 | II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */ | |
321 | II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */ | |
322 | II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */ | |
323 | II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */ | |
324 | II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */ | |
325 | II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */ | |
326 | II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */ | |
327 | II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */ | |
328 | II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */ | |
329 | II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */ | |
330 | II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */ | |
331 | II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */ | |
332 | II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */ | |
333 | II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */ | |
334 | II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */ | |
335 | II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */ | |
336 | ||
337 | state[0] += a; | |
338 | state[1] += b; | |
339 | state[2] += c; | |
340 | state[3] += d; | |
341 | ||
342 | /* Zeroize sensitive information. */ | |
343 | memset ((void *)x, 0, sizeof (x)); | |
344 | } |