1 /*
2 * This code implements the MD5 message-digest algorithm.
3 * The algorithm is due to Ron Rivest. This code was
4 * written by Colin Plumb in 1993, no copyright is claimed.
5 * This code is in the public domain; do with it what you wish.
6 *
7 * Equivalent code is available from RSA Data Security, Inc.
8 * This code has been tested against that, and is equivalent,
9 * except that you don't need to include two pages of legalese
10 * with every copy.
11 *
12 * To compute the message digest of a chunk of bytes, declare an
13 * MD5Context structure, pass it to MD5Init, call MD5Update as
14 * needed on buffers full of bytes, and then call MD5Final, which
15 * will fill a supplied 16-byte array with the digest.
16 */
17
18 /* Brutally hacked by John Walker back from ANSI C to K&R (no
19 prototypes) to maintain the tradition that Netfone will compile
20 with Sun's original "cc". */
21
22 #include <stdio.h>
23 #include <cstring> /* for memcpy() */
24 #include "md5.hpp"
25
26 #include "unit_test.hpp"
27
28 namespace md5 {
29
sum(const std::string & data)30 std::string sum(const std::string& data)
31 {
32 std::string result = MD5().calc(data);
33 std::string output;
34 for(std::string::const_iterator i = result.begin(); i != result.end(); ++i) {
35 char buf[64];
36 const unsigned char c = *i;
37 sprintf(buf, "%02x", c);
38 output += buf;
39 }
40
41 return output;
42 }
43
44 #if SDL_BYTEORDER == SDL_BIG_ENDIAN
45 /*
46 * Note: this code is harmless on little-endian machines.
47 */
byteReverse(uint8_t * buf,unsigned longs)48 void byteReverse(uint8_t *buf, unsigned longs)
49
50 {
51 uint32_t t;
52 do {
53 t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
54 ((unsigned) buf[1] << 8 | buf[0]);
55 *(uint32_t *) buf = t;
56 buf += 4;
57 } while (--longs);
58 }
59 #else
byteReverse(uint8_t * buf,unsigned longs)60 void byteReverse(uint8_t *buf, unsigned longs) {
61 }
62 #endif
63
64 /*
65 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
66 * initialization constants.
67 */
MD5Init(struct MD5Context * ctx)68 void MD5Init(struct MD5Context *ctx)
69
70 {
71 ctx->buf[0] = 0x67452301;
72 ctx->buf[1] = 0xefcdab89;
73 ctx->buf[2] = 0x98badcfe;
74 ctx->buf[3] = 0x10325476;
75
76 ctx->bits[0] = 0;
77 ctx->bits[1] = 0;
78 }
79
80 /*
81 * Update context to reflect the concatenation of another buffer full
82 * of bytes.
83 */
MD5Update(struct MD5Context * ctx,uint8_t * buf,unsigned len)84 void MD5Update(struct MD5Context *ctx, uint8_t *buf, unsigned len)
85
86 {
87 uint32_t t;
88
89 /* Update bitcount */
90
91 t = ctx->bits[0];
92 if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
93 ctx->bits[1]++; /* Carry from low to high */
94 ctx->bits[1] += len >> 29;
95
96 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
97
98 /* Handle any leading odd-sized chunks */
99
100 if (t) {
101 uint8_t *p = (uint8_t *) ctx->in + t;
102
103 t = 64 - t;
104 if (len < t) {
105 std::memcpy(p, buf, len);
106 return;
107 }
108 std::memcpy(p, buf, t);
109 byteReverse(ctx->in, 16);
110 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
111 buf += t;
112 len -= t;
113 }
114 /* Process data in 64-byte chunks */
115
116 while (len >= 64) {
117 std::memcpy(ctx->in, buf, 64);
118 byteReverse(ctx->in, 16);
119 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
120 buf += 64;
121 len -= 64;
122 }
123
124 /* Handle any remaining bytes of data. */
125
126 memcpy(ctx->in, buf, len);
127 }
128
129 /*
130 * Final wrapup - pad to 64-byte boundary with the bit pattern
131 * 1 0* (64-bit count of bits processed, MSB-first)
132 */
MD5Final(uint8_t digest[16],struct MD5Context * ctx)133 void MD5Final(uint8_t digest[16], struct MD5Context *ctx)
134
135 {
136 unsigned count;
137 uint8_t *p;
138
139 /* Compute number of bytes mod 64 */
140 count = (ctx->bits[0] >> 3) & 0x3F;
141
142 /* Set the first char of padding to 0x80. This is safe since there is
143 always at least one byte free */
144 p = ctx->in + count;
145 *p++ = 0x80;
146
147 /* Bytes of padding needed to make 64 bytes */
148 count = 64 - 1 - count;
149
150 /* Pad out to 56 mod 64 */
151 if (count < 8) {
152 /* Two lots of padding: Pad the first block to 64 bytes */
153 std::memset(p, 0, count);
154 byteReverse(ctx->in, 16);
155 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
156
157 /* Now fill the next block with 56 bytes */
158 std::memset(ctx->in, 0, 56);
159 } else {
160 /* Pad block to 56 bytes */
161 std::memset(p, 0, count - 8);
162 }
163 byteReverse(ctx->in, 14);
164
165 /* Append length in bits and transform */
166 ((uint32_t *) ctx->in)[14] = ctx->bits[0];
167 ((uint32_t *) ctx->in)[15] = ctx->bits[1];
168
169 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
170 byteReverse((uint8_t *) ctx->buf, 4);
171 std::memcpy(digest, ctx->buf, 16);
172 std::memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
173 }
174
175
176 /* The four core functions - F1 is optimized somewhat */
177
178 /* #define F1(x, y, z) (x & y | ~x & z) */
179 #define F1(x, y, z) (z ^ (x & (y ^ z)))
180 #define F2(x, y, z) F1(z, x, y)
181 #define F3(x, y, z) (x ^ y ^ z)
182 #define F4(x, y, z) (y ^ (x | ~z))
183
184 /* This is the central step in the MD5 algorithm. */
185 #define MD5STEP(f, w, x, y, z, data, s) \
186 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
187
188 /*
189 * The core of the MD5 algorithm, this alters an existing MD5 hash to
190 * reflect the addition of 16 longwords of new data. MD5Update blocks
191 * the data and converts bytes into longwords for this routine.
192 */
MD5Transform(uint32_t buf[4],uint32_t in[16])193 void MD5Transform(uint32_t buf[4], uint32_t in[16])
194
195 {
196 register uint32_t a, b, c, d;
197
198 a = buf[0];
199 b = buf[1];
200 c = buf[2];
201 d = buf[3];
202
203 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
204 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
205 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
206 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
207 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
208 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
209 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
210 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
211 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
212 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
213 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
214 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
215 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
216 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
217 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
218 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
219
220 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
221 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
222 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
223 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
224 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
225 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
226 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
227 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
228 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
229 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
230 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
231 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
232 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
233 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
234 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
235 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
236
237 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
238 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
239 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
240 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
241 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
242 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
243 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
244 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
245 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
246 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
247 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
248 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
249 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
250 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
251 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
252 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
253
254 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
255 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
256 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
257 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
258 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
259 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
260 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
261 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
262 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
263 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
264 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
265 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
266 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
267 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
268 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
269 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
270
271 buf[0] += a;
272 buf[1] += b;
273 buf[2] += c;
274 buf[3] += d;
275 }
276 }
277
UNIT_TEST(md5_test1)278 UNIT_TEST(md5_test1) {
279 std::string md5sum = MD5::calc("");
280 // We need to construct the result here using the array overload constructor due to the embedded null's
281 std::string good_result("\xD4\x1D\x8C\xD9\x8F\x00\xB2\x04\xE9\x80\x09\x98\xEC\xF8\x42\x7E", 16);
282 CHECK_EQ(md5sum, good_result);
283 }
284
UNIT_TEST(md5_test2)285 UNIT_TEST(md5_test2) {
286 MD5 md5sum;
287 CHECK_EQ(md5sum.calc("a"), "\x0C\xC1\x75\xB9\xC0\xF1\xB6\xA8\x31\xC3\x99\xE2\x69\x77\x26\x61");
288 }
289
UNIT_TEST(md5_test3)290 UNIT_TEST(md5_test3) {
291 uint8_t result[16] = { 0 };
292 uint8_t values[3] = { 'a', 'b', 'c' };
293 uint8_t good_result[16] = {
294 '\x90', '\x01', '\x50', '\x98', '\x3C', '\xD2', '\x4F', '\xB0',
295 '\xD6', '\x96', '\x3F', '\x7D', '\x28', '\xE1', '\x7F', '\x72',
296 };
297 struct md5::MD5Context ctx;
298 md5::MD5Init(&ctx);
299 md5::MD5Update(&ctx, values, 3);
300 md5::MD5Final(result, &ctx);
301 bool result_okay = true;
302 for(int i = 0; i < 16; i++) {
303 if( result[i] != good_result[i]) {
304 result_okay = false;
305 break;
306 }
307 }
308 CHECK_EQ(result_okay, true);
309 }
310
UNIT_TEST(md5_test4)311 UNIT_TEST(md5_test4) {
312 MD5 md5sum;
313 std::string s = "message digest";
314 std::string s_result = "\xF9\x6B\x69\x7D\x7C\xB7\x93\x8D\x52\x5A\x2F\x31\xAA\xF1\x61\xD0";
315 std::vector<uint8_t> v(s.begin(), s.end());
316 std::vector<uint8_t> result = md5sum.calc(v);
317 std::vector<uint8_t> good_result(s_result.begin(), s_result.end());
318
319 std::string sr(result.begin(), result.end());
320 std::string gsr(good_result.begin(), good_result.end());
321 CHECK_EQ(sr, gsr);
322 }
323
UNIT_TEST(md5_test5)324 UNIT_TEST(md5_test5) {
325 std::string md5sum = MD5::calc("abcdefghijklmnopqrstuvwxyz");
326 // We need to construct the result here using the array overload constructor due to the embedded null's
327 std::string good_result("\xC3\xFC\xD3\xD7\x61\x92\xE4\x00\x7D\xFB\x49\x6C\xCA\x67\xE1\x3B", 16);
328 CHECK_EQ(md5sum, good_result);
329 }
330
UNIT_TEST(md5_test6)331 UNIT_TEST(md5_test6) {
332 std::string md5sum = MD5::calc("ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789") ;
333 CHECK_EQ(md5sum, "\xD1\x74\xAB\x98\xD2\x77\xD9\xF5\xA5\x61\x1C\x2C\x9F\x41\x9D\x9F");
334 }
335
UNIT_TEST(md5_test7)336 UNIT_TEST(md5_test7) {
337 std::string md5sum = MD5::calc("12345678901234567890123456789012345678901234567890123456789012345678901234567890") ;
338 CHECK_EQ(md5sum, "\x57\xED\xF4\xA2\x2B\xE3\xC9\x55\xAC\x49\xDA\x2E\x21\x07\xB6\x7A");
339 }
340
341
342