2
* $Id: md5.c,v 1.1 2001/04/29 04:17:37 hartmans Exp $
4
* This code implements the MD5 message-digest algorithm.
5
* The algorithm is due to Ron Rivest. This code was
6
* written by Colin Plumb in 1993, no copyright is claimed.
7
* This code is in the public domain; do with it what you wish.
9
* Equivalent code is available from RSA Data Security, Inc.
10
* This code has been tested against that, and is equivalent,
11
* except that you don't need to include two pages of legalese
14
* To compute the message digest of a chunk of bytes, declare an
15
* MD5Context structure, pass it to MD5Init, call MD5Update as
16
* needed on buffers full of bytes, and then call MD5Final, which
17
* will fill a supplied 16-byte array with the digest.
25
#define byteReverse(buf, len) /* Nothing */
27
static void byteReverse(unsigned char *buf, unsigned longs);
31
* Note: this code is harmless on little-endian machines.
33
static void byteReverse(unsigned char *buf, unsigned longs)
37
t = (uint32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
38
((unsigned) buf[1] << 8 | buf[0]);
47
* Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
48
* initialization constants.
50
void MD5Name(MD5Init)(struct MD5Context *ctx)
52
ctx->buf[0] = 0x67452301U;
53
ctx->buf[1] = 0xefcdab89U;
54
ctx->buf[2] = 0x98badcfeU;
55
ctx->buf[3] = 0x10325476U;
62
* Update context to reflect the concatenation of another buffer full
65
void MD5Name(MD5Update)(struct MD5Context *ctx, unsigned const char *buf, unsigned len)
72
if ((ctx->bits[0] = t + ((uint32) len << 3)) < t)
73
ctx->bits[1]++; /* Carry from low to high */
74
ctx->bits[1] += len >> 29;
76
t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
78
/* Handle any leading odd-sized chunks */
81
unsigned char *p = (unsigned char *) ctx->in + t;
89
byteReverse(ctx->in, 16);
90
MD5Name(MD5Transform)(ctx->buf, (uint32 *) ctx->in);
94
/* Process data in 64-byte chunks */
97
memcpy(ctx->in, buf, 64);
98
byteReverse(ctx->in, 16);
99
MD5Name(MD5Transform)(ctx->buf, (uint32 *) ctx->in);
104
/* Handle any remaining bytes of data. */
106
memcpy(ctx->in, buf, len);
110
* Final wrapup - pad to 64-byte boundary with the bit pattern
111
* 1 0* (64-bit count of bits processed, MSB-first)
113
void MD5Name(MD5Final)(unsigned char digest[16], struct MD5Context *ctx)
118
/* Compute number of bytes mod 64 */
119
count = (ctx->bits[0] >> 3) & 0x3F;
121
/* Set the first char of padding to 0x80. This is safe since there is
122
always at least one byte free */
126
/* Bytes of padding needed to make 64 bytes */
127
count = 64 - 1 - count;
129
/* Pad out to 56 mod 64 */
131
/* Two lots of padding: Pad the first block to 64 bytes */
133
byteReverse(ctx->in, 16);
134
MD5Name(MD5Transform)(ctx->buf, (uint32 *) ctx->in);
136
/* Now fill the next block with 56 bytes */
137
memset(ctx->in, 0, 56);
139
/* Pad block to 56 bytes */
140
memset(p, 0, count - 8);
142
byteReverse(ctx->in, 14);
144
/* Append length in bits and transform */
145
((uint32 *) ctx->in)[14] = ctx->bits[0];
146
((uint32 *) ctx->in)[15] = ctx->bits[1];
148
MD5Name(MD5Transform)(ctx->buf, (uint32 *) ctx->in);
149
byteReverse((unsigned char *) ctx->buf, 4);
150
memcpy(digest, ctx->buf, 16);
151
memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
156
/* The four core functions - F1 is optimized somewhat */
158
/* #define F1(x, y, z) (x & y | ~x & z) */
159
#define F1(x, y, z) (z ^ (x & (y ^ z)))
160
#define F2(x, y, z) F1(z, x, y)
161
#define F3(x, y, z) (x ^ y ^ z)
162
#define F4(x, y, z) (y ^ (x | ~z))
164
/* This is the central step in the MD5 algorithm. */
165
#define MD5STEP(f, w, x, y, z, data, s) \
166
( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
169
* The core of the MD5 algorithm, this alters an existing MD5 hash to
170
* reflect the addition of 16 longwords of new data. MD5Update blocks
171
* the data and converts bytes into longwords for this routine.
173
void MD5Name(MD5Transform)(uint32 buf[4], uint32 const in[16])
175
register uint32 a, b, c, d;
182
MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478U, 7);
183
MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756U, 12);
184
MD5STEP(F1, c, d, a, b, in[2] + 0x242070dbU, 17);
185
MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceeeU, 22);
186
MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0fafU, 7);
187
MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62aU, 12);
188
MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613U, 17);
189
MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501U, 22);
190
MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8U, 7);
191
MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7afU, 12);
192
MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1U, 17);
193
MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7beU, 22);
194
MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122U, 7);
195
MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193U, 12);
196
MD5STEP(F1, c, d, a, b, in[14] + 0xa679438eU, 17);
197
MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821U, 22);
199
MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562U, 5);
200
MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340U, 9);
201
MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51U, 14);
202
MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aaU, 20);
203
MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105dU, 5);
204
MD5STEP(F2, d, a, b, c, in[10] + 0x02441453U, 9);
205
MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681U, 14);
206
MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8U, 20);
207
MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6U, 5);
208
MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6U, 9);
209
MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87U, 14);
210
MD5STEP(F2, b, c, d, a, in[8] + 0x455a14edU, 20);
211
MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905U, 5);
212
MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8U, 9);
213
MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9U, 14);
214
MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8aU, 20);
216
MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942U, 4);
217
MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681U, 11);
218
MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122U, 16);
219
MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380cU, 23);
220
MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44U, 4);
221
MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9U, 11);
222
MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60U, 16);
223
MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70U, 23);
224
MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6U, 4);
225
MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127faU, 11);
226
MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085U, 16);
227
MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05U, 23);
228
MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039U, 4);
229
MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5U, 11);
230
MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8U, 16);
231
MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665U, 23);
233
MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244U, 6);
234
MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97U, 10);
235
MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7U, 15);
236
MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039U, 21);
237
MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3U, 6);
238
MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92U, 10);
239
MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47dU, 15);
240
MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1U, 21);
241
MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4fU, 6);
242
MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0U, 10);
243
MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314U, 15);
244
MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1U, 21);
245
MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82U, 6);
246
MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235U, 10);
247
MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bbU, 15);
248
MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391U, 21);