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