comparison Plugins/Input/sid/xs_md5.c @ 269:1b82a9932b60 trunk

[svn] Import sid plugin. Ported from XMMS by giacomo.
author chainsaw
date Thu, 08 Dec 2005 15:12:12 -0800
parents
children
comparison
equal deleted inserted replaced
268:1368faba73c9 269:1b82a9932b60
1 /*
2 Copyright (C) 1999 Aladdin Enterprises. All rights reserved.
3
4 This software is provided 'as-is', without any express or implied
5 warranty. In no event will the authors be held liable for any damages
6 arising from the use of this software.
7
8 Permission is granted to anyone to use this software for any purpose,
9 including commercial applications, and to alter it and redistribute it
10 freely, subject to the following restrictions:
11
12 1. The origin of this software must not be misrepresented; you must not
13 claim that you wrote the original software. If you use this software
14 in a product, an acknowledgment in the product documentation would be
15 appreciated but is not required.
16 2. Altered source versions must be plainly marked as such, and must not be
17 misrepresented as being the original software.
18 3. This notice may not be removed or altered from any source distribution.
19
20 L. Peter Deutsch
21 ghost@aladdin.com
22
23
24 Independent implementation of MD5 (RFC 1321).
25
26 This code implements the MD5 Algorithm defined in RFC 1321.
27 It is derived directly from the text of the RFC and not from the
28 reference implementation.
29
30 The original and principal author of md5.c is L. Peter Deutsch
31 <ghost@aladdin.com>. Other authors are noted in the change history
32 that follows (in reverse chronological order):
33
34 2002-08-25 ccr Edited for integration in XMMS-SID. Removed unnecessary stuff.
35 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
36 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
37 1999-05-03 lpd Original version.
38 */
39 /* Include config.h here, because we don't include xmms-sid.h */
40 #ifdef HAVE_CONFIG_H
41 #include <config.h>
42 #endif
43
44 #include <glib.h>
45 #ifdef HAVE_STRING_H
46 #include <string.h>
47 #else
48 #ifdef HAVE_STRINGS_H
49 #include <strings.h>
50 #endif
51 #endif
52 #include "xs_md5.h"
53
54 #define T1 0xd76aa478
55 #define T2 0xe8c7b756
56 #define T3 0x242070db
57 #define T4 0xc1bdceee
58 #define T5 0xf57c0faf
59 #define T6 0x4787c62a
60 #define T7 0xa8304613
61 #define T8 0xfd469501
62 #define T9 0x698098d8
63 #define T10 0x8b44f7af
64 #define T11 0xffff5bb1
65 #define T12 0x895cd7be
66 #define T13 0x6b901122
67 #define T14 0xfd987193
68 #define T15 0xa679438e
69 #define T16 0x49b40821
70 #define T17 0xf61e2562
71 #define T18 0xc040b340
72 #define T19 0x265e5a51
73 #define T20 0xe9b6c7aa
74 #define T21 0xd62f105d
75 #define T22 0x02441453
76 #define T23 0xd8a1e681
77 #define T24 0xe7d3fbc8
78 #define T25 0x21e1cde6
79 #define T26 0xc33707d6
80 #define T27 0xf4d50d87
81 #define T28 0x455a14ed
82 #define T29 0xa9e3e905
83 #define T30 0xfcefa3f8
84 #define T31 0x676f02d9
85 #define T32 0x8d2a4c8a
86 #define T33 0xfffa3942
87 #define T34 0x8771f681
88 #define T35 0x6d9d6122
89 #define T36 0xfde5380c
90 #define T37 0xa4beea44
91 #define T38 0x4bdecfa9
92 #define T39 0xf6bb4b60
93 #define T40 0xbebfbc70
94 #define T41 0x289b7ec6
95 #define T42 0xeaa127fa
96 #define T43 0xd4ef3085
97 #define T44 0x04881d05
98 #define T45 0xd9d4d039
99 #define T46 0xe6db99e5
100 #define T47 0x1fa27cf8
101 #define T48 0xc4ac5665
102 #define T49 0xf4292244
103 #define T50 0x432aff97
104 #define T51 0xab9423a7
105 #define T52 0xfc93a039
106 #define T53 0x655b59c3
107 #define T54 0x8f0ccc92
108 #define T55 0xffeff47d
109 #define T56 0x85845dd1
110 #define T57 0x6fa87e4f
111 #define T58 0xfe2ce6e0
112 #define T59 0xa3014314
113 #define T60 0x4e0811a1
114 #define T61 0xf7537e82
115 #define T62 0xbd3af235
116 #define T63 0x2ad7d2bb
117 #define T64 0xeb86d391
118
119
120 static void xs_md5_process(t_xs_md5state * pms, const guint8 * data)
121 {
122 guint32 a = pms->abcd[0], b = pms->abcd[1], c = pms->abcd[2], d = pms->abcd[3];
123 guint32 t;
124 guint32 X[16];
125 const guint8 *xp = data;
126 gint i;
127
128 for (i = 0; i < 16; ++i, xp += 4)
129 X[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
130
131
132 /*
133 * Round 1. Let [abcd k s i] denote the operation
134 * a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s).
135 */
136 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
137 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
138 #define SET(a, b, c, d, k, s, Ti)\
139 t = a + F(b,c,d) + X[k] + Ti;\
140 a = ROTATE_LEFT(t, s) + b
141
142 /* Do the following 16 operations. */
143 SET(a, b, c, d, 0, 7, T1);
144 SET(d, a, b, c, 1, 12, T2);
145 SET(c, d, a, b, 2, 17, T3);
146 SET(b, c, d, a, 3, 22, T4);
147 SET(a, b, c, d, 4, 7, T5);
148 SET(d, a, b, c, 5, 12, T6);
149 SET(c, d, a, b, 6, 17, T7);
150 SET(b, c, d, a, 7, 22, T8);
151 SET(a, b, c, d, 8, 7, T9);
152 SET(d, a, b, c, 9, 12, T10);
153 SET(c, d, a, b, 10, 17, T11);
154 SET(b, c, d, a, 11, 22, T12);
155 SET(a, b, c, d, 12, 7, T13);
156 SET(d, a, b, c, 13, 12, T14);
157 SET(c, d, a, b, 14, 17, T15);
158 SET(b, c, d, a, 15, 22, T16);
159
160 #undef SET
161
162 /*
163 * Round 2. Let [abcd k s i] denote the operation
164 * a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s).
165 */
166 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
167 #define SET(a, b, c, d, k, s, Ti)\
168 t = a + G(b,c,d) + X[k] + Ti;\
169 a = ROTATE_LEFT(t, s) + b
170
171 /* Do the following 16 operations. */
172 SET(a, b, c, d, 1, 5, T17);
173 SET(d, a, b, c, 6, 9, T18);
174 SET(c, d, a, b, 11, 14, T19);
175 SET(b, c, d, a, 0, 20, T20);
176 SET(a, b, c, d, 5, 5, T21);
177 SET(d, a, b, c, 10, 9, T22);
178 SET(c, d, a, b, 15, 14, T23);
179 SET(b, c, d, a, 4, 20, T24);
180 SET(a, b, c, d, 9, 5, T25);
181 SET(d, a, b, c, 14, 9, T26);
182 SET(c, d, a, b, 3, 14, T27);
183 SET(b, c, d, a, 8, 20, T28);
184 SET(a, b, c, d, 13, 5, T29);
185 SET(d, a, b, c, 2, 9, T30);
186 SET(c, d, a, b, 7, 14, T31);
187 SET(b, c, d, a, 12, 20, T32);
188
189 #undef SET
190
191 /*
192 * Round 3. Let [abcd k s t] denote the operation
193 * a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s).
194 */
195 #define H(x, y, z) ((x) ^ (y) ^ (z))
196 #define SET(a, b, c, d, k, s, Ti)\
197 t = a + H(b,c,d) + X[k] + Ti;\
198 a = ROTATE_LEFT(t, s) + b
199
200 /* Do the following 16 operations. */
201 SET(a, b, c, d, 5, 4, T33);
202 SET(d, a, b, c, 8, 11, T34);
203 SET(c, d, a, b, 11, 16, T35);
204 SET(b, c, d, a, 14, 23, T36);
205 SET(a, b, c, d, 1, 4, T37);
206 SET(d, a, b, c, 4, 11, T38);
207 SET(c, d, a, b, 7, 16, T39);
208 SET(b, c, d, a, 10, 23, T40);
209 SET(a, b, c, d, 13, 4, T41);
210 SET(d, a, b, c, 0, 11, T42);
211 SET(c, d, a, b, 3, 16, T43);
212 SET(b, c, d, a, 6, 23, T44);
213 SET(a, b, c, d, 9, 4, T45);
214 SET(d, a, b, c, 12, 11, T46);
215 SET(c, d, a, b, 15, 16, T47);
216 SET(b, c, d, a, 2, 23, T48);
217
218 #undef SET
219
220 /*
221 * Round 4. Let [abcd k s t] denote the operation
222 * a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s).
223 */
224 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
225 #define SET(a, b, c, d, k, s, Ti)\
226 t = a + I(b,c,d) + X[k] + Ti;\
227 a = ROTATE_LEFT(t, s) + b
228
229 /* Do the following 16 operations. */
230 SET(a, b, c, d, 0, 6, T49);
231 SET(d, a, b, c, 7, 10, T50);
232 SET(c, d, a, b, 14, 15, T51);
233 SET(b, c, d, a, 5, 21, T52);
234 SET(a, b, c, d, 12, 6, T53);
235 SET(d, a, b, c, 3, 10, T54);
236 SET(c, d, a, b, 10, 15, T55);
237 SET(b, c, d, a, 1, 21, T56);
238 SET(a, b, c, d, 8, 6, T57);
239 SET(d, a, b, c, 15, 10, T58);
240 SET(c, d, a, b, 6, 15, T59);
241 SET(b, c, d, a, 13, 21, T60);
242 SET(a, b, c, d, 4, 6, T61);
243 SET(d, a, b, c, 11, 10, T62);
244 SET(c, d, a, b, 2, 15, T63);
245 SET(b, c, d, a, 9, 21, T64);
246
247 #undef SET
248
249 /*
250 * Then perform the following additions. (That is increment each
251 * of the four registers by the value it had before this block was started.)
252 */
253 pms->abcd[0] += a;
254 pms->abcd[1] += b;
255 pms->abcd[2] += c;
256 pms->abcd[3] += d;
257 }
258
259
260 void xs_md5_init(t_xs_md5state * pms)
261 {
262 pms->count[0] = pms->count[1] = 0;
263 pms->abcd[0] = 0x67452301;
264 pms->abcd[1] = 0xefcdab89;
265 pms->abcd[2] = 0x98badcfe;
266 pms->abcd[3] = 0x10325476;
267 }
268
269
270 void xs_md5_append(t_xs_md5state * pms, const guint8 * data, int nbytes)
271 {
272 const guint8 *p = data;
273 gint left = nbytes;
274 gint offset = (pms->count[0] >> 3) & 63;
275 guint32 nbits = (guint32) (nbytes << 3);
276
277 if (nbytes <= 0)
278 return;
279
280 /* Update the message length. */
281 pms->count[1] += nbytes >> 29;
282 pms->count[0] += nbits;
283 if (pms->count[0] < nbits)
284 pms->count[1]++;
285
286 /* Process an initial partial block. */
287 if (offset) {
288 int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
289
290 memcpy(pms->buf + offset, p, copy);
291
292 if (offset + copy < 64)
293 return;
294
295 p += copy;
296 left -= copy;
297 xs_md5_process(pms, pms->buf);
298 }
299
300 /* Process full blocks. */
301 for (; left >= 64; p += 64, left -= 64)
302 xs_md5_process(pms, p);
303
304 /* Process a final partial block. */
305 if (left)
306 memcpy(pms->buf, p, left);
307 }
308
309
310 void xs_md5_finish(t_xs_md5state * pms, t_xs_md5hash digest)
311 {
312 static const guint8 pad[64] = {
313 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
314 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
315 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
316 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
317 };
318
319 guint8 data[8];
320 gint i;
321
322 /* Save the length before padding. */
323 for (i = 0; i < 8; ++i)
324 data[i] = (guint8) (pms->count[i >> 2] >> ((i & 3) << 3));
325
326 /* Pad to 56 bytes mod 64. */
327 xs_md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
328
329 /* Append the length. */
330 xs_md5_append(pms, data, 8);
331 for (i = 0; i < XS_MD5HASH_LENGTH; ++i)
332 digest[i] = (guint8) (pms->abcd[i >> 2] >> ((i & 3) << 3));
333 }