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.
20 /* Brutally hacked by John Walker back from ANSI C to K&R (no
21 prototypes) to maintain the tradition that Netfone will compile
22 with Sun's original "cc". */
28 #define byteReverse(buf, len) /* Nothing */
31 * Note: this code is harmless on little-endian machines.
33 void byteReverse(buf, longs)
34 unsigned char *buf; unsigned longs;
38 t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
39 ((unsigned) buf[1] << 8 | buf[0]);
40 *(uint32_t *) buf = t;
46 void MD5Transform(uint32_t buf[4], uint32_t in[16]);
50 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
51 * initialization constants.
54 struct MD5Context *ctx;
56 ctx->buf[0] = 0x67452301;
57 ctx->buf[1] = 0xefcdab89;
58 ctx->buf[2] = 0x98badcfe;
59 ctx->buf[3] = 0x10325476;
66 * Update context to reflect the concatenation of another buffer full
69 void MD5Update(ctx, buf, len)
70 struct MD5Context *ctx; unsigned char *buf; unsigned len;
77 if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
78 ctx->bits[1]++; /* Carry from low to high */
79 ctx->bits[1] += len >> 29;
81 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
83 /* Handle any leading odd-sized chunks */
86 unsigned char *p = (unsigned char *) ctx->in + t;
94 byteReverse(ctx->in, 16);
95 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
99 /* Process data in 64-byte chunks */
102 memcpy(ctx->in, buf, 64);
103 byteReverse(ctx->in, 16);
104 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
109 /* Handle any remaining bytes of data. */
111 memcpy(ctx->in, buf, len);
115 * Final wrapup - pad to 64-byte boundary with the bit pattern
116 * 1 0* (64-bit count of bits processed, MSB-first)
118 void MD5Final(digest, ctx)
119 unsigned char digest[16]; struct MD5Context *ctx;
124 /* Compute number of bytes mod 64 */
125 count = (ctx->bits[0] >> 3) & 0x3F;
127 /* Set the first char of padding to 0x80. This is safe since there is
128 always at least one byte free */
132 /* Bytes of padding needed to make 64 bytes */
133 count = 64 - 1 - count;
135 /* Pad out to 56 mod 64 */
137 /* Two lots of padding: Pad the first block to 64 bytes */
139 byteReverse(ctx->in, 16);
140 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
142 /* Now fill the next block with 56 bytes */
143 memset(ctx->in, 0, 56);
145 /* Pad block to 56 bytes */
146 memset(p, 0, count - 8);
148 byteReverse(ctx->in, 14);
150 /* Append length in bits and transform */
151 ((uint32_t *) ctx->in)[14] = ctx->bits[0];
152 ((uint32_t *) ctx->in)[15] = ctx->bits[1];
154 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
155 byteReverse((unsigned char *) ctx->buf, 4);
156 memcpy(digest, ctx->buf, 16);
157 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
161 /* The four core functions - F1 is optimized somewhat */
163 /* #define F1(x, y, z) (x & y | ~x & z) */
164 #define F1(x, y, z) (z ^ (x & (y ^ z)))
165 #define F2(x, y, z) F1(z, x, y)
166 #define F3(x, y, z) (x ^ y ^ z)
167 #define F4(x, y, z) (y ^ (x | ~z))
169 /* This is the central step in the MD5 algorithm. */
170 #define MD5STEP(f, w, x, y, z, data, s) \
171 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
174 * The core of the MD5 algorithm, this alters an existing MD5 hash to
175 * reflect the addition of 16 longwords of new data. MD5Update blocks
176 * the data and converts bytes into longwords for this routine.
178 void MD5Transform(buf, in)
179 uint32_t buf[4]; uint32_t in[16];
181 register uint32_t a, b, c, d;
188 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
189 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
190 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
191 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
192 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
193 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
194 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
195 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
196 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
197 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
198 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
199 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
200 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
201 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
202 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
203 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
205 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
206 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
207 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
208 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
209 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
210 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
211 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
212 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
213 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
214 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
215 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
216 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
217 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
218 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
219 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
220 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
222 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
223 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
224 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
225 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
226 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
227 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
228 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
229 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
230 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
231 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
232 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
233 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
234 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
235 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
236 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
237 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
239 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
240 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
241 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
242 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
243 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
244 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
245 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
246 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
247 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
248 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
249 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
250 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
251 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
252 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
253 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
254 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
262 /* lh3: the following code is added by me */
268 #define HEX_STR "0123456789abcdef"
270 static void md5_one(const char *fn)
272 unsigned char buf[4096], digest[16];
277 fp = strcmp(fn, "-")? fopen(fn, "r") : stdin;
279 fprintf(pysamerr, "md5sum: %s: No such file or directory\n", fn);
283 while ((l = fread(buf, 1, 4096, fp)) > 0)
284 MD5Update(&md5, buf, l);
285 MD5Final(digest, &md5);
286 if (fp != stdin) fclose(fp);
287 for (l = 0; l < 16; ++l)
288 printf("%c%c", HEX_STR[digest[l]>>4&0xf], HEX_STR[digest[l]&0xf]);
291 int main(int argc, char *argv[])
294 if (argc == 1) md5_one("-");
295 else for (i = 1; i < argc; ++i) md5_one(argv[i]);