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 * IpatchMD5 structure, pass it to ipatch_md5_init, call ipatch_md5_update as
14 * needed on buffers full of bytes, and then call ipatch_md5_final, which
15 * will fill a supplied 16-byte array with the digest.
16 *
17 * Changed so as no longer to depend on Colin Plumb's `usual.h' header
18 * definitions; now uses stuff from dpkg's config.h.
19 * - Ian Jackson <ijackson@nyx.cs.du.edu>.
20 * Still in the public domain.
21 *
22 * Josh Coalson: made some changes to integrate with libFLAC.
23 * Still in the public domain.
24 *
25 * Josh Green: made some changes to integrate with libInstPatch.
26 * Still in the public domain.
27 */
28 /**
29 * SECTION: md5
30 * @short_description: MD5 hashing functions
31 * @see_also:
32 * @stability: Stable
33 */
34 #include <stdlib.h> /* for malloc() */
35 #include <string.h> /* for memcpy() */
36 #include <glib.h>
37
38 #include "md5.h"
39
40 /* The four core functions - F1 is optimized somewhat */
41
42 /* #define F1(x, y, z) (x & y | ~x & z) */
43 #define F1(x, y, z) (z ^ (x & (y ^ z)))
44 #define F2(x, y, z) F1(z, x, y)
45 #define F3(x, y, z) (x ^ y ^ z)
46 #define F4(x, y, z) (y ^ (x | ~z))
47
48 /* This is the central step in the MD5 algorithm. */
49 #define MD5STEP(f,w,x,y,z,in,s) \
50 (w += f(x,y,z) + in, w = (w<<s | w>>(32-s)) + x)
51
52 /*
53 * The core of the MD5 algorithm, this alters an existing MD5 hash to
54 * reflect the addition of 16 longwords of new data. ipatch_md5_update blocks
55 * the data and converts bytes into longwords for this routine.
56 */
57 static inline void
MD5Transform(guint32 buf[4],guint32 const in[16])58 MD5Transform(guint32 buf[4], guint32 const in[16])
59 {
60 register guint32 a, b, c, d;
61
62 a = buf[0];
63 b = buf[1];
64 c = buf[2];
65 d = buf[3];
66
67 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
68 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
69 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
70 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
71 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
72 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
73 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
74 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
75 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
76 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
77 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
78 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
79 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
80 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
81 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
82 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
83
84 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
85 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
86 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
87 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
88 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
89 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
90 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
91 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
92 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
93 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
94 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
95 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
96 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
97 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
98 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
99 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
100
101 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
102 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
103 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
104 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
105 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
106 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
107 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
108 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
109 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
110 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
111 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
112 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
113 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
114 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
115 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
116 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
117
118 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
119 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
120 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
121 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
122 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
123 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
124 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
125 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
126 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
127 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
128 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
129 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
130 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
131 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
132 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
133 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
134
135 buf[0] += a;
136 buf[1] += b;
137 buf[2] += c;
138 buf[3] += d;
139 }
140
141 static inline void
byteSwap(guint32 * buf,unsigned words)142 byteSwap(guint32 *buf, unsigned words)
143 {
144 guint8 *p = (guint8 *)buf;
145
146 if(G_BYTE_ORDER != G_BIG_ENDIAN)
147 {
148 return;
149 }
150
151 do
152 {
153 *buf++ = (guint32)((unsigned)p[3] << 8 | p[2]) << 16
154 | ((unsigned)p[1] << 8 | p[0]);
155 p += 4;
156 }
157 while(--words);
158 }
159
160 /**
161 * ipatch_md5_init: (skip)
162 * @ctx: MD5 context
163 *
164 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
165 * initialization constants.
166 */
167 void
ipatch_md5_init(IpatchMD5 * ctx)168 ipatch_md5_init(IpatchMD5 *ctx)
169 {
170 ctx->buf[0] = 0x67452301;
171 ctx->buf[1] = 0xefcdab89;
172 ctx->buf[2] = 0x98badcfe;
173 ctx->buf[3] = 0x10325476;
174
175 ctx->bytes[0] = 0;
176 ctx->bytes[1] = 0;
177 }
178
179 /*
180 * ipatch_md5_update: (skip)
181 * @ctx: MD5 context
182 * @buf: Buffer of data
183 * @len: Length of data in @buf
184 *
185 * Update MD5 context to reflect the concatenation of another buffer full
186 * of bytes.
187 */
188 void
ipatch_md5_update(IpatchMD5 * ctx,guint8 const * buf,unsigned len)189 ipatch_md5_update(IpatchMD5 *ctx, guint8 const *buf, unsigned len)
190 {
191 guint32 t;
192
193 /* Update byte count */
194
195 t = ctx->bytes[0];
196
197 if((ctx->bytes[0] = t + len) < t)
198 {
199 ctx->bytes[1]++; /* Carry from low to high */
200 }
201
202 t = 64 - (t & 0x3f); /* Space available in ctx->in (at least 1) */
203
204 if(t > len)
205 {
206 memcpy((guint8 *)ctx->in + 64 - t, buf, len);
207 return;
208 }
209
210 /* First chunk is an odd size */
211 memcpy((guint8 *)ctx->in + 64 - t, buf, t);
212 byteSwap(ctx->in, 16);
213 MD5Transform(ctx->buf, ctx->in);
214 buf += t;
215 len -= t;
216
217 /* Process data in 64-byte chunks */
218 while(len >= 64)
219 {
220 memcpy(ctx->in, buf, 64);
221 byteSwap(ctx->in, 16);
222 MD5Transform(ctx->buf, ctx->in);
223 buf += 64;
224 len -= 64;
225 }
226
227 /* Handle any remaining bytes of data. */
228 memcpy(ctx->in, buf, len);
229 }
230
231 /**
232 * ipatch_md5_final: (skip)
233 * @ctx: MD5 context
234 * @digest: Buffer to store 16 byte MD5 digest into
235 *
236 * Final wrapup - pad to 64-byte boundary with the bit pattern
237 * 1 0* (64-bit count of bits processed, MSB-first)
238 */
239 void
ipatch_md5_final(IpatchMD5 * ctx,guint8 digest[16])240 ipatch_md5_final(IpatchMD5 *ctx, guint8 digest[16])
241 {
242 int count = ctx->bytes[0] & 0x3f; /* Number of bytes in ctx->in */
243 guint8 *p = (guint8 *)ctx->in + count;
244
245 /* Set the first char of padding to 0x80. There is always room. */
246 *p++ = 0x80;
247
248 /* Bytes of padding needed to make 56 bytes (-8..55) */
249 count = 56 - 1 - count;
250
251 if(count < 0) /* Padding forces an extra block */
252 {
253 memset(p, 0, count + 8);
254 byteSwap(ctx->in, 16);
255 MD5Transform(ctx->buf, ctx->in);
256 p = (guint8 *)ctx->in;
257 count = 56;
258 }
259
260 memset(p, 0, count);
261 byteSwap(ctx->in, 14);
262
263 /* Append length in bits and transform */
264 ctx->in[14] = ctx->bytes[0] << 3;
265 ctx->in[15] = ctx->bytes[1] << 3 | ctx->bytes[0] >> 29;
266 MD5Transform(ctx->buf, ctx->in);
267
268 byteSwap(ctx->buf, 4);
269 memcpy(digest, ctx->buf, 16);
270 memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */
271 }
272
273