Mercurial > notdcc

comparison dcclib/md5.c @ 0:c7f6b056b673

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