2 * RFC 1321 compliant MD5 implementation
4 * Copyright (C) 2001-2003 Christophe Devine
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License version 3 as
8 * published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
13 * GNU General Public License for more details.
15 * You should have received a copy of the GNU General Public License along
16 * with this program; if not, visit the http://fsf.org website.
21 void md5_begin(md_context *ctx)
28 ctx->totalN = ctx->totalN2 = 0;
31 static void md5_process(md_context *ctx, const uchar data[CSUM_CHUNK])
33 uint32 X[16], A, B, C, D;
43 X[3] = IVAL(data, 12);
44 X[4] = IVAL(data, 16);
45 X[5] = IVAL(data, 20);
46 X[6] = IVAL(data, 24);
47 X[7] = IVAL(data, 28);
48 X[8] = IVAL(data, 32);
49 X[9] = IVAL(data, 36);
50 X[10] = IVAL(data, 40);
51 X[11] = IVAL(data, 44);
52 X[12] = IVAL(data, 48);
53 X[13] = IVAL(data, 52);
54 X[14] = IVAL(data, 56);
55 X[15] = IVAL(data, 60);
57 #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
59 #define P(a,b,c,d,k,s,t) a += F(b,c,d) + X[k] + t, a = S(a,s) + b
61 #define F(x,y,z) (z ^ (x & (y ^ z)))
63 P(A, B, C, D, 0, 7, 0xD76AA478);
64 P(D, A, B, C, 1, 12, 0xE8C7B756);
65 P(C, D, A, B, 2, 17, 0x242070DB);
66 P(B, C, D, A, 3, 22, 0xC1BDCEEE);
67 P(A, B, C, D, 4, 7, 0xF57C0FAF);
68 P(D, A, B, C, 5, 12, 0x4787C62A);
69 P(C, D, A, B, 6, 17, 0xA8304613);
70 P(B, C, D, A, 7, 22, 0xFD469501);
71 P(A, B, C, D, 8, 7, 0x698098D8);
72 P(D, A, B, C, 9, 12, 0x8B44F7AF);
73 P(C, D, A, B, 10, 17, 0xFFFF5BB1);
74 P(B, C, D, A, 11, 22, 0x895CD7BE);
75 P(A, B, C, D, 12, 7, 0x6B901122);
76 P(D, A, B, C, 13, 12, 0xFD987193);
77 P(C, D, A, B, 14, 17, 0xA679438E);
78 P(B, C, D, A, 15, 22, 0x49B40821);
81 #define F(x,y,z) (y ^ (z & (x ^ y)))
83 P(A, B, C, D, 1, 5, 0xF61E2562);
84 P(D, A, B, C, 6, 9, 0xC040B340);
85 P(C, D, A, B, 11, 14, 0x265E5A51);
86 P(B, C, D, A, 0, 20, 0xE9B6C7AA);
87 P(A, B, C, D, 5, 5, 0xD62F105D);
88 P(D, A, B, C, 10, 9, 0x02441453);
89 P(C, D, A, B, 15, 14, 0xD8A1E681);
90 P(B, C, D, A, 4, 20, 0xE7D3FBC8);
91 P(A, B, C, D, 9, 5, 0x21E1CDE6);
92 P(D, A, B, C, 14, 9, 0xC33707D6);
93 P(C, D, A, B, 3, 14, 0xF4D50D87);
94 P(B, C, D, A, 8, 20, 0x455A14ED);
95 P(A, B, C, D, 13, 5, 0xA9E3E905);
96 P(D, A, B, C, 2, 9, 0xFCEFA3F8);
97 P(C, D, A, B, 7, 14, 0x676F02D9);
98 P(B, C, D, A, 12, 20, 0x8D2A4C8A);
101 #define F(x,y,z) (x ^ y ^ z)
103 P(A, B, C, D, 5, 4, 0xFFFA3942);
104 P(D, A, B, C, 8, 11, 0x8771F681);
105 P(C, D, A, B, 11, 16, 0x6D9D6122);
106 P(B, C, D, A, 14, 23, 0xFDE5380C);
107 P(A, B, C, D, 1, 4, 0xA4BEEA44);
108 P(D, A, B, C, 4, 11, 0x4BDECFA9);
109 P(C, D, A, B, 7, 16, 0xF6BB4B60);
110 P(B, C, D, A, 10, 23, 0xBEBFBC70);
111 P(A, B, C, D, 13, 4, 0x289B7EC6);
112 P(D, A, B, C, 0, 11, 0xEAA127FA);
113 P(C, D, A, B, 3, 16, 0xD4EF3085);
114 P(B, C, D, A, 6, 23, 0x04881D05);
115 P(A, B, C, D, 9, 4, 0xD9D4D039);
116 P(D, A, B, C, 12, 11, 0xE6DB99E5);
117 P(C, D, A, B, 15, 16, 0x1FA27CF8);
118 P(B, C, D, A, 2, 23, 0xC4AC5665);
121 #define F(x,y,z) (y ^ (x | ~z))
123 P(A, B, C, D, 0, 6, 0xF4292244);
124 P(D, A, B, C, 7, 10, 0x432AFF97);
125 P(C, D, A, B, 14, 15, 0xAB9423A7);
126 P(B, C, D, A, 5, 21, 0xFC93A039);
127 P(A, B, C, D, 12, 6, 0x655B59C3);
128 P(D, A, B, C, 3, 10, 0x8F0CCC92);
129 P(C, D, A, B, 10, 15, 0xFFEFF47D);
130 P(B, C, D, A, 1, 21, 0x85845DD1);
131 P(A, B, C, D, 8, 6, 0x6FA87E4F);
132 P(D, A, B, C, 15, 10, 0xFE2CE6E0);
133 P(C, D, A, B, 6, 15, 0xA3014314);
134 P(B, C, D, A, 13, 21, 0x4E0811A1);
135 P(A, B, C, D, 4, 6, 0xF7537E82);
136 P(D, A, B, C, 11, 10, 0xBD3AF235);
137 P(C, D, A, B, 2, 15, 0x2AD7D2BB);
138 P(B, C, D, A, 9, 21, 0xEB86D391);
148 void md5_update(md_context *ctx, const uchar *input, uint32 length)
155 left = ctx->totalN & 0x3F;
156 fill = CSUM_CHUNK - left;
158 ctx->totalN += length;
159 ctx->totalN &= 0xFFFFFFFF;
161 if (ctx->totalN < length)
164 if (left && length >= fill) {
165 memcpy(ctx->buffer + left, input, fill);
166 md5_process(ctx, ctx->buffer);
172 while (length >= CSUM_CHUNK) {
173 md5_process(ctx, input);
174 length -= CSUM_CHUNK;
179 memcpy(ctx->buffer + left, input, length);
182 static uchar md5_padding[CSUM_CHUNK] = { 0x80 };
184 void md5_result(md_context *ctx, uchar digest[MD5_DIGEST_LEN])
190 high = (ctx->totalN >> 29)
191 | (ctx->totalN2 << 3);
192 low = (ctx->totalN << 3);
194 SIVAL(msglen, 0, low);
195 SIVAL(msglen, 4, high);
197 last = ctx->totalN & 0x3F;
198 padn = last < 56 ? 56 - last : 120 - last;
200 md5_update(ctx, md5_padding, padn);
201 md5_update(ctx, msglen, 8);
203 SIVAL(digest, 0, ctx->A);
204 SIVAL(digest, 4, ctx->B);
205 SIVAL(digest, 8, ctx->C);
206 SIVAL(digest, 12, ctx->D);
209 void get_md5(uchar *out, const uchar *input, int n)
213 md5_update(&ctx, input, n);
214 md5_result(&ctx, out);
223 * those are the standard RFC 1321 test vectors
230 "d41d8cd98f00b204e9800998ecf8427e" },
232 "0cc175b9c0f1b6a831c399e269772661" },
234 "900150983cd24fb0d6963f7d28e17f72" },
236 "f96b697d7cb7938d525a2f31aaf161d0" },
237 { "abcdefghijklmnopqrstuvwxyz",
238 "c3fcd3d76192e4007dfb496cca67e13b" },
239 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
240 "d174ab98d277d9f5a5611c2c9f419d9f" },
241 { "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
242 "57edf4a22be3c955ac49da2e2107b67a" },
246 int main(int argc, char *argv[])
253 uchar md5sum[MD5_DIGEST_LEN];
256 printf("\nMD5 Validation Tests:\n\n");
258 for (i = 0; tests[i].str; i++) {
259 char *str = tests[i].str;
260 char *chk = tests[i].md5;
262 printf(" Test %d ", i + 1);
264 get_md5(md5sum, str, strlen(str));
266 for (j = 0; j < MD5_DIGEST_LEN; j++)
267 sprintf(output + j * 2, "%02x", md5sum[j]);
269 if (memcmp(output, chk, 32)) {
282 if (!(f = fopen(*++argv, "rb"))) {
289 while ((i = fread(buf, 1, sizeof buf, f)) > 0)
290 md5_update(&ctx, buf, i);
292 md5_result(&ctx, md5sum);
294 for (j = 0; j < MD5_DIGEST_LEN; j++)
295 printf("%02x", md5sum[j]);
297 printf(" %s\n", *argv);