1 /* -*- Mode: C; tab-width: 8; indent-tabs-mode: t; c-basic-offset: 8 -*- */
2 /**
3 * \file
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.
8 *
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
12 * with every copy.
13 *
14 * To compute the message digest of a chunk of bytes, declare an
15 * MonoMD5Context structure, pass it to mono_md5_init, call mono_md5_update as
16 * needed on buffers full of bytes, and then call md5_Final, which
17 * will fill a supplied 16-byte array with the digest.
18 */
19
20 /* parts of this file are :
21 * Written March 1993 by Branko Lankester
22 * Modified June 1993 by Colin Plumb for altered md5.c.
23 * Modified October 1995 by Erik Troan for RPM
24 */
25
26
27 #include <stdio.h>
28 #include <string.h>
29 #include "mono-digest.h"
30
31 #if HAVE_COMMONCRYPTO_COMMONDIGEST_H
32
33 /**
34 * mono_md5_init:
35 */
36 void
mono_md5_init(MonoMD5Context * ctx)37 mono_md5_init (MonoMD5Context *ctx)
38 {
39 CC_MD5_Init (ctx);
40 }
41
42 /**
43 * mono_md5_update:
44 */
45 void
mono_md5_update(MonoMD5Context * ctx,const guchar * buf,guint32 len)46 mono_md5_update (MonoMD5Context *ctx, const guchar *buf, guint32 len)
47 {
48 CC_MD5_Update (ctx, buf, len);
49 }
50
51 /**
52 * mono_md5_final:
53 */
54 void
mono_md5_final(MonoMD5Context * ctx,guchar digest[16])55 mono_md5_final (MonoMD5Context *ctx, guchar digest[16])
56 {
57 CC_MD5_Final (digest, ctx);
58 }
59
60 #else
61
62 static void md5_transform (guint32 buf[4], const guint32 in[16]);
63
64 static gint _ie = 0x44332211;
65 static union _endian { gint i; gchar b[4]; } *_endian = (union _endian *)&_ie;
66 #define IS_BIG_ENDIAN() (_endian->b[0] == '\x44')
67 #define IS_LITTLE_ENDIAN() (_endian->b[0] == '\x11')
68
69
70 /*
71 * Note: this code is harmless on little-endian machines.
72 */
73 static void
_byte_reverse(guchar * buf,guint32 longs)74 _byte_reverse (guchar *buf, guint32 longs)
75 {
76 guint32 t;
77 do {
78 t = (guint32) ((guint32) buf[3] << 8 | buf[2]) << 16 |
79 ((guint32) buf[1] << 8 | buf[0]);
80 *(guint32 *) buf = t;
81 buf += 4;
82 } while (--longs);
83 }
84
85 /**
86 * mono_md5_init: Initialise an md5 context object
87 * @ctx: md5 context
88 *
89 * Initialise an md5 buffer.
90 *
91 **/
92 void
mono_md5_init(MonoMD5Context * ctx)93 mono_md5_init (MonoMD5Context *ctx)
94 {
95 ctx->buf[0] = 0x67452301;
96 ctx->buf[1] = 0xefcdab89;
97 ctx->buf[2] = 0x98badcfe;
98 ctx->buf[3] = 0x10325476;
99
100 ctx->bits[0] = 0;
101 ctx->bits[1] = 0;
102
103 if (IS_BIG_ENDIAN())
104 ctx->doByteReverse = 1;
105 else
106 ctx->doByteReverse = 0;
107 }
108
109
110
111 /**
112 * mono_md5_update: add a buffer to md5 hash computation
113 * @ctx: conetxt object used for md5 computaion
114 * @buf: buffer to add
115 * @len: buffer length
116 *
117 * Update context to reflect the concatenation of another buffer full
118 * of bytes. Use this to progressively construct an md5 hash.
119 **/
120 void
mono_md5_update(MonoMD5Context * ctx,const guchar * buf,guint32 len)121 mono_md5_update (MonoMD5Context *ctx, const guchar *buf, guint32 len)
122 {
123 guint32 t;
124
125 /* Update bitcount */
126
127 t = ctx->bits[0];
128 if ((ctx->bits[0] = t + ((guint32) len << 3)) < t)
129 ctx->bits[1]++; /* Carry from low to high */
130 ctx->bits[1] += len >> 29;
131
132 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
133
134 /* Handle any leading odd-sized chunks */
135
136 if (t) {
137 guchar *p = (guchar *) ctx->in + t;
138
139 t = 64 - t;
140 if (len < t) {
141 memcpy (p, buf, len);
142 return;
143 }
144 memcpy (p, buf, t);
145 if (ctx->doByteReverse)
146 _byte_reverse (ctx->in, 16);
147 md5_transform (ctx->buf, (guint32 *) ctx->in);
148 buf += t;
149 len -= t;
150 }
151 /* Process data in 64-byte chunks */
152
153 while (len >= 64) {
154 memcpy (ctx->in, buf, 64);
155 if (ctx->doByteReverse)
156 _byte_reverse (ctx->in, 16);
157 md5_transform (ctx->buf, (guint32 *) ctx->in);
158 buf += 64;
159 len -= 64;
160 }
161
162 /* Handle any remaining bytes of data. */
163
164 memcpy (ctx->in, buf, len);
165 }
166
167
168
169
170
171 /*
172 * Final wrapup - pad to 64-byte boundary with the bit pattern
173 * 1 0* (64-bit count of bits processed, MSB-first)
174 */
175 /**
176 * mono_md5_final: copy the final md5 hash to a bufer
177 * @digest: 16 bytes buffer
178 * @ctx: context containing the calculated md5
179 *
180 * copy the final md5 hash to a bufer
181 **/
182 void
mono_md5_final(MonoMD5Context * ctx,guchar digest[16])183 mono_md5_final (MonoMD5Context *ctx, guchar digest[16])
184 {
185 guint32 count;
186 guchar *p;
187
188 /* Compute number of bytes mod 64 */
189 count = (ctx->bits[0] >> 3) & 0x3F;
190
191 /* Set the first char of padding to 0x80. This is safe since there is
192 always at least one byte free */
193 p = ctx->in + count;
194 *p++ = 0x80;
195
196 /* Bytes of padding needed to make 64 bytes */
197 count = 64 - 1 - count;
198
199 /* Pad out to 56 mod 64 */
200 if (count < 8) {
201 /* Two lots of padding: Pad the first block to 64 bytes */
202 memset (p, 0, count);
203 if (ctx->doByteReverse)
204 _byte_reverse (ctx->in, 16);
205 md5_transform (ctx->buf, (guint32 *) ctx->in);
206
207 /* Now fill the next block with 56 bytes */
208 memset (ctx->in, 0, 56);
209 } else {
210 /* Pad block to 56 bytes */
211 memset (p, 0, count - 8);
212 }
213 if (ctx->doByteReverse)
214 _byte_reverse (ctx->in, 14);
215
216 /* Append length in bits and transform */
217 ((guint32 *) ctx->in)[14] = ctx->bits[0];
218 ((guint32 *) ctx->in)[15] = ctx->bits[1];
219
220 md5_transform (ctx->buf, (guint32 *) ctx->in);
221 if (ctx->doByteReverse)
222 _byte_reverse ((guchar *) ctx->buf, 4);
223 memcpy (digest, ctx->buf, 16);
224 }
225
226
227
228
229 /* The four core functions - F1 is optimized somewhat */
230
231 /* #define F1(x, y, z) (x & y | ~x & z) */
232 #define F1(x, y, z) (z ^ (x & (y ^ z)))
233 #define F2(x, y, z) F1(z, x, y)
234 #define F3(x, y, z) (x ^ y ^ z)
235 #define F4(x, y, z) (y ^ (x | ~z))
236
237 /* This is the central step in the MD5 algorithm. */
238 #define MD5STEP(f, w, x, y, z, data, s) \
239 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
240
241 /*
242 * The core of the MD5 algorithm, this alters an existing MD5 hash to
243 * reflect the addition of 16 longwords of new data. md5_Update blocks
244 * the data and converts bytes into longwords for this routine.
245 */
246 static void
md5_transform(guint32 buf[4],const guint32 in[16])247 md5_transform (guint32 buf[4], const guint32 in[16])
248 {
249 register guint32 a, b, c, d;
250
251 a = buf[0];
252 b = buf[1];
253 c = buf[2];
254 d = buf[3];
255
256 MD5STEP (F1, a, b, c, d, in[0] + 0xd76aa478, 7);
257 MD5STEP (F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
258 MD5STEP (F1, c, d, a, b, in[2] + 0x242070db, 17);
259 MD5STEP (F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
260 MD5STEP (F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
261 MD5STEP (F1, d, a, b, c, in[5] + 0x4787c62a, 12);
262 MD5STEP (F1, c, d, a, b, in[6] + 0xa8304613, 17);
263 MD5STEP (F1, b, c, d, a, in[7] + 0xfd469501, 22);
264 MD5STEP (F1, a, b, c, d, in[8] + 0x698098d8, 7);
265 MD5STEP (F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
266 MD5STEP (F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
267 MD5STEP (F1, b, c, d, a, in[11] + 0x895cd7be, 22);
268 MD5STEP (F1, a, b, c, d, in[12] + 0x6b901122, 7);
269 MD5STEP (F1, d, a, b, c, in[13] + 0xfd987193, 12);
270 MD5STEP (F1, c, d, a, b, in[14] + 0xa679438e, 17);
271 MD5STEP (F1, b, c, d, a, in[15] + 0x49b40821, 22);
272
273 MD5STEP (F2, a, b, c, d, in[1] + 0xf61e2562, 5);
274 MD5STEP (F2, d, a, b, c, in[6] + 0xc040b340, 9);
275 MD5STEP (F2, c, d, a, b, in[11] + 0x265e5a51, 14);
276 MD5STEP (F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
277 MD5STEP (F2, a, b, c, d, in[5] + 0xd62f105d, 5);
278 MD5STEP (F2, d, a, b, c, in[10] + 0x02441453, 9);
279 MD5STEP (F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
280 MD5STEP (F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
281 MD5STEP (F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
282 MD5STEP (F2, d, a, b, c, in[14] + 0xc33707d6, 9);
283 MD5STEP (F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
284 MD5STEP (F2, b, c, d, a, in[8] + 0x455a14ed, 20);
285 MD5STEP (F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
286 MD5STEP (F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
287 MD5STEP (F2, c, d, a, b, in[7] + 0x676f02d9, 14);
288 MD5STEP (F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
289
290 MD5STEP (F3, a, b, c, d, in[5] + 0xfffa3942, 4);
291 MD5STEP (F3, d, a, b, c, in[8] + 0x8771f681, 11);
292 MD5STEP (F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
293 MD5STEP (F3, b, c, d, a, in[14] + 0xfde5380c, 23);
294 MD5STEP (F3, a, b, c, d, in[1] + 0xa4beea44, 4);
295 MD5STEP (F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
296 MD5STEP (F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
297 MD5STEP (F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
298 MD5STEP (F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
299 MD5STEP (F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
300 MD5STEP (F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
301 MD5STEP (F3, b, c, d, a, in[6] + 0x04881d05, 23);
302 MD5STEP (F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
303 MD5STEP (F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
304 MD5STEP (F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
305 MD5STEP (F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
306
307 MD5STEP (F4, a, b, c, d, in[0] + 0xf4292244, 6);
308 MD5STEP (F4, d, a, b, c, in[7] + 0x432aff97, 10);
309 MD5STEP (F4, c, d, a, b, in[14] + 0xab9423a7, 15);
310 MD5STEP (F4, b, c, d, a, in[5] + 0xfc93a039, 21);
311 MD5STEP (F4, a, b, c, d, in[12] + 0x655b59c3, 6);
312 MD5STEP (F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
313 MD5STEP (F4, c, d, a, b, in[10] + 0xffeff47d, 15);
314 MD5STEP (F4, b, c, d, a, in[1] + 0x85845dd1, 21);
315 MD5STEP (F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
316 MD5STEP (F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
317 MD5STEP (F4, c, d, a, b, in[6] + 0xa3014314, 15);
318 MD5STEP (F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
319 MD5STEP (F4, a, b, c, d, in[4] + 0xf7537e82, 6);
320 MD5STEP (F4, d, a, b, c, in[11] + 0xbd3af235, 10);
321 MD5STEP (F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
322 MD5STEP (F4, b, c, d, a, in[9] + 0xeb86d391, 21);
323
324 buf[0] += a;
325 buf[1] += b;
326 buf[2] += c;
327 buf[3] += d;
328 }
329
330 #endif
331
332
333 /**
334 * mono_md5_get_digest:
335 * \param buffer byte buffer
336 * \param buffer_size buffer size (in bytes)
337 * \param digest 16-byte buffer receiving the hash code.
338 *
339 * Get the MD5 hash of a buffer. The result is put in
340 * the 16-byte buffer \p digest.
341 */
342 void
mono_md5_get_digest(const guchar * buffer,gint buffer_size,guchar digest[16])343 mono_md5_get_digest (const guchar *buffer, gint buffer_size, guchar digest[16])
344 {
345 MonoMD5Context ctx;
346
347 mono_md5_init (&ctx);
348 mono_md5_update (&ctx, buffer, buffer_size);
349 mono_md5_final (&ctx, digest);
350
351 }
352
353
354 /**
355 * mono_md5_get_digest_from_file:
356 * \param filename file name
357 * \param digest 16-byte buffer receiving the hash code.
358 *
359 * Get the MD5 hash of a file. The result is put in
360 * the 16-byte buffer \p digest.
361 *
362 * If an IO error happens the value in \p digest is not updated.
363 */
364 void
mono_md5_get_digest_from_file(const gchar * filename,guchar digest[16])365 mono_md5_get_digest_from_file (const gchar *filename, guchar digest[16])
366 {
367 MonoMD5Context ctx;
368 guchar tmp_buf[1024];
369 gint nb_bytes_read;
370 FILE *fp;
371
372 mono_md5_init (&ctx);
373 fp = fopen(filename, "r");
374 if (!fp) {
375 return;
376 }
377
378 while ((nb_bytes_read = fread (tmp_buf, sizeof (guchar), 1024, fp)) > 0)
379 mono_md5_update (&ctx, tmp_buf, nb_bytes_read);
380
381 if (ferror(fp)) {
382 fclose(fp);
383 return;
384 } else {
385 fclose(fp);
386 }
387
388 mono_md5_final (&ctx, digest);
389 }
390
391
392
393
394