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 as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License along
17 * with this program; if not, write to the Free Software Foundation, Inc.,
18 * 51 Franklin Street - Fifth Floor, Boston, MA 02110-1301, USA.
23 void md5_begin(md_context *ctx)
30 ctx->totalN = ctx->totalN2 = 0;
33 static void md5_process(md_context *ctx, const uchar data[CSUM_CHUNK])
35 uint32 X[16], A, B, C, D;
45 X[3] = IVAL(data, 12);
46 X[4] = IVAL(data, 16);
47 X[5] = IVAL(data, 20);
48 X[6] = IVAL(data, 24);
49 X[7] = IVAL(data, 28);
50 X[8] = IVAL(data, 32);
51 X[9] = IVAL(data, 36);
52 X[10] = IVAL(data, 40);
53 X[11] = IVAL(data, 44);
54 X[12] = IVAL(data, 48);
55 X[13] = IVAL(data, 52);
56 X[14] = IVAL(data, 56);
57 X[15] = IVAL(data, 60);
59 #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
61 #define P(a,b,c,d,k,s,t) a += F(b,c,d) + X[k] + t, a = S(a,s) + b
63 #define F(x,y,z) (z ^ (x & (y ^ z)))
65 P(A, B, C, D, 0, 7, 0xD76AA478);
66 P(D, A, B, C, 1, 12, 0xE8C7B756);
67 P(C, D, A, B, 2, 17, 0x242070DB);
68 P(B, C, D, A, 3, 22, 0xC1BDCEEE);
69 P(A, B, C, D, 4, 7, 0xF57C0FAF);
70 P(D, A, B, C, 5, 12, 0x4787C62A);
71 P(C, D, A, B, 6, 17, 0xA8304613);
72 P(B, C, D, A, 7, 22, 0xFD469501);
73 P(A, B, C, D, 8, 7, 0x698098D8);
74 P(D, A, B, C, 9, 12, 0x8B44F7AF);
75 P(C, D, A, B, 10, 17, 0xFFFF5BB1);
76 P(B, C, D, A, 11, 22, 0x895CD7BE);
77 P(A, B, C, D, 12, 7, 0x6B901122);
78 P(D, A, B, C, 13, 12, 0xFD987193);
79 P(C, D, A, B, 14, 17, 0xA679438E);
80 P(B, C, D, A, 15, 22, 0x49B40821);
83 #define F(x,y,z) (y ^ (z & (x ^ y)))
85 P(A, B, C, D, 1, 5, 0xF61E2562);
86 P(D, A, B, C, 6, 9, 0xC040B340);
87 P(C, D, A, B, 11, 14, 0x265E5A51);
88 P(B, C, D, A, 0, 20, 0xE9B6C7AA);
89 P(A, B, C, D, 5, 5, 0xD62F105D);
90 P(D, A, B, C, 10, 9, 0x02441453);
91 P(C, D, A, B, 15, 14, 0xD8A1E681);
92 P(B, C, D, A, 4, 20, 0xE7D3FBC8);
93 P(A, B, C, D, 9, 5, 0x21E1CDE6);
94 P(D, A, B, C, 14, 9, 0xC33707D6);
95 P(C, D, A, B, 3, 14, 0xF4D50D87);
96 P(B, C, D, A, 8, 20, 0x455A14ED);
97 P(A, B, C, D, 13, 5, 0xA9E3E905);
98 P(D, A, B, C, 2, 9, 0xFCEFA3F8);
99 P(C, D, A, B, 7, 14, 0x676F02D9);
100 P(B, C, D, A, 12, 20, 0x8D2A4C8A);
103 #define F(x,y,z) (x ^ y ^ z)
105 P(A, B, C, D, 5, 4, 0xFFFA3942);
106 P(D, A, B, C, 8, 11, 0x8771F681);
107 P(C, D, A, B, 11, 16, 0x6D9D6122);
108 P(B, C, D, A, 14, 23, 0xFDE5380C);
109 P(A, B, C, D, 1, 4, 0xA4BEEA44);
110 P(D, A, B, C, 4, 11, 0x4BDECFA9);
111 P(C, D, A, B, 7, 16, 0xF6BB4B60);
112 P(B, C, D, A, 10, 23, 0xBEBFBC70);
113 P(A, B, C, D, 13, 4, 0x289B7EC6);
114 P(D, A, B, C, 0, 11, 0xEAA127FA);
115 P(C, D, A, B, 3, 16, 0xD4EF3085);
116 P(B, C, D, A, 6, 23, 0x04881D05);
117 P(A, B, C, D, 9, 4, 0xD9D4D039);
118 P(D, A, B, C, 12, 11, 0xE6DB99E5);
119 P(C, D, A, B, 15, 16, 0x1FA27CF8);
120 P(B, C, D, A, 2, 23, 0xC4AC5665);
123 #define F(x,y,z) (y ^ (x | ~z))
125 P(A, B, C, D, 0, 6, 0xF4292244);
126 P(D, A, B, C, 7, 10, 0x432AFF97);
127 P(C, D, A, B, 14, 15, 0xAB9423A7);
128 P(B, C, D, A, 5, 21, 0xFC93A039);
129 P(A, B, C, D, 12, 6, 0x655B59C3);
130 P(D, A, B, C, 3, 10, 0x8F0CCC92);
131 P(C, D, A, B, 10, 15, 0xFFEFF47D);
132 P(B, C, D, A, 1, 21, 0x85845DD1);
133 P(A, B, C, D, 8, 6, 0x6FA87E4F);
134 P(D, A, B, C, 15, 10, 0xFE2CE6E0);
135 P(C, D, A, B, 6, 15, 0xA3014314);
136 P(B, C, D, A, 13, 21, 0x4E0811A1);
137 P(A, B, C, D, 4, 6, 0xF7537E82);
138 P(D, A, B, C, 11, 10, 0xBD3AF235);
139 P(C, D, A, B, 2, 15, 0x2AD7D2BB);
140 P(B, C, D, A, 9, 21, 0xEB86D391);
150 void md5_update(md_context *ctx, const uchar *input, uint32 length)
157 left = ctx->totalN & 0x3F;
158 fill = CSUM_CHUNK - left;
160 ctx->totalN += length;
161 ctx->totalN &= 0xFFFFFFFF;
163 if (ctx->totalN < length)
166 if (left && length >= fill) {
167 memcpy(ctx->buffer + left, input, fill);
168 md5_process(ctx, ctx->buffer);
174 while (length >= CSUM_CHUNK) {
175 md5_process(ctx, input);
176 length -= CSUM_CHUNK;
181 memcpy(ctx->buffer + left, input, length);
184 static uchar md5_padding[CSUM_CHUNK] = { 0x80 };
186 void md5_result(md_context *ctx, uchar digest[MD5_DIGEST_LEN])
192 high = (ctx->totalN >> 29)
193 | (ctx->totalN2 << 3);
194 low = (ctx->totalN << 3);
196 SIVAL(msglen, 0, low);
197 SIVAL(msglen, 4, high);
199 last = ctx->totalN & 0x3F;
200 padn = last < 56 ? 56 - last : 120 - last;
202 md5_update(ctx, md5_padding, padn);
203 md5_update(ctx, msglen, 8);
205 SIVAL(digest, 0, ctx->A);
206 SIVAL(digest, 4, ctx->B);
207 SIVAL(digest, 8, ctx->C);
208 SIVAL(digest, 12, ctx->D);
211 void get_md5(uchar *out, const uchar *input, int n)
215 md5_update(&ctx, input, n);
216 md5_result(&ctx, out);
225 * those are the standard RFC 1321 test vectors
232 "d41d8cd98f00b204e9800998ecf8427e" },
234 "0cc175b9c0f1b6a831c399e269772661" },
236 "900150983cd24fb0d6963f7d28e17f72" },
238 "f96b697d7cb7938d525a2f31aaf161d0" },
239 { "abcdefghijklmnopqrstuvwxyz",
240 "c3fcd3d76192e4007dfb496cca67e13b" },
241 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789",
242 "d174ab98d277d9f5a5611c2c9f419d9f" },
243 { "12345678901234567890123456789012345678901234567890123456789012345678901234567890",
244 "57edf4a22be3c955ac49da2e2107b67a" },
248 int main(int argc, char *argv[])
255 uchar md5sum[MD5_DIGEST_LEN];
258 printf("\nMD5 Validation Tests:\n\n");
260 for (i = 0; tests[i].str; i++) {
261 char *str = tests[i].str;
262 char *chk = tests[i].md5;
264 printf(" Test %d ", i + 1);
266 get_md5(md5sum, str, strlen(str));
268 for (j = 0; j < MD5_DIGEST_LEN; j++)
269 sprintf(output + j * 2, "%02x", md5sum[j]);
271 if (memcmp(output, chk, 32)) {
284 if (!(f = fopen(*++argv, "rb"))) {
291 while ((i = fread(buf, 1, sizeof buf, f)) > 0)
292 md5_update(&ctx, buf, i);
294 md5_result(&ctx, md5sum);
296 for (j = 0; j < MD5_DIGEST_LEN; j++)
297 printf("%02x", md5sum[j]);
299 printf(" %s\n", *argv);