2
Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
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.
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:
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.
24
/* $Id: md5.c,v 1.6 2002/04/13 19:20:28 lpd Exp $ */
26
Independent implementation of MD5 (RFC 1321).
28
This code implements the MD5 Algorithm defined in RFC 1321, whose
30
http://www.ietf.org/rfc/rfc1321.txt
31
The code is derived from the text of the RFC, including the test suite
32
(section A.5) but excluding the rest of Appendix A. It does not include
33
any code or documentation that is identified in the RFC as being
36
The original and principal author of md5.c is L. Peter Deutsch
37
<ghost@aladdin.com>. Other authors are noted in the change history
38
that follows (in reverse chronological order):
40
2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
41
either statically or dynamically; added missing #include <string.h>
43
2002-03-11 lpd Corrected argument list for main(), and added int return
44
type, in test program and T value program.
45
2002-02-21 lpd Added missing #include <stdio.h> in test program.
46
2000-07-03 lpd Patched to eliminate warnings about "constant is
47
unsigned in ANSI C, signed in traditional"; made test program
49
1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
50
1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
51
1999-05-03 lpd Original version.
59
#include "CSStrUtil.h"
61
#undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
62
#ifdef ARCH_IS_BIG_ENDIAN
63
# define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
70
#define T_MASK ((md5_word_t)~0)
71
#define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
72
#define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
74
#define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
75
#define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
77
#define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
78
#define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
80
#define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
81
#define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
82
#define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
83
#define T13 0x6b901122
84
#define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
85
#define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
86
#define T16 0x49b40821
87
#define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
88
#define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
89
#define T19 0x265e5a51
90
#define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
91
#define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
92
#define T22 0x02441453
93
#define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
94
#define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
95
#define T25 0x21e1cde6
96
#define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
97
#define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
98
#define T28 0x455a14ed
99
#define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
100
#define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
101
#define T31 0x676f02d9
102
#define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
103
#define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
104
#define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
105
#define T35 0x6d9d6122
106
#define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
107
#define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
108
#define T38 0x4bdecfa9
109
#define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
110
#define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
111
#define T41 0x289b7ec6
112
#define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
113
#define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
114
#define T44 0x04881d05
115
#define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
116
#define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
117
#define T47 0x1fa27cf8
118
#define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
119
#define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
120
#define T50 0x432aff97
121
#define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
122
#define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
123
#define T53 0x655b59c3
124
#define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
125
#define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
126
#define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
127
#define T57 0x6fa87e4f
128
#define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
129
#define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
130
#define T60 0x4e0811a1
131
#define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
132
#define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
133
#define T63 0x2ad7d2bb
134
#define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
137
void CSMd5::md5_process(const u_char *data /*[64]*/)
139
md5_word_t a, b, c, d, t;
141
a = md5_state.abcd[0];
142
b = md5_state.abcd[1];
143
c = md5_state.abcd[2];
144
d = md5_state.abcd[3];
147
/* Define storage only for big-endian CPUs. */
150
/* Define storage for little-endian or both types of CPUs. */
158
* Determine dynamically whether this is a big-endian or
159
* little-endian machine, since we can use a more efficient
160
* algorithm on the latter.
162
static const int w = 1;
164
if (*((const u_char *)&w)) /* dynamic little-endian */
166
#if BYTE_ORDER <= 0 /* little-endian */
169
* On little-endian machines, we can process properly aligned
170
* data without copying it.
172
if (!((data - (const u_char *)0) & 3)) {
173
/* data are properly aligned */
174
X = (const md5_word_t *)data;
177
memcpy(xbuf, data, 64);
183
else /* dynamic big-endian */
185
#if BYTE_ORDER >= 0 /* big-endian */
188
* On big-endian machines, we must arrange the bytes in the
191
const u_char *xp = data;
195
X = xbuf; /* (dynamic only) */
197
# define xbuf X /* (static only) */
199
for (i = 0; i < 16; ++i, xp += 4)
200
xbuf[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
206
#define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
209
/* Let [abcd k s i] denote the operation
210
a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
211
#define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
212
#define SET(a, b, c, d, k, s, Ti)\
213
t = a + F(b,c,d) + X[k] + Ti;\
214
a = ROTATE_LEFT(t, s) + b
215
/* Do the following 16 operations. */
216
SET(a, b, c, d, 0, 7, T1);
217
SET(d, a, b, c, 1, 12, T2);
218
SET(c, d, a, b, 2, 17, T3);
219
SET(b, c, d, a, 3, 22, T4);
220
SET(a, b, c, d, 4, 7, T5);
221
SET(d, a, b, c, 5, 12, T6);
222
SET(c, d, a, b, 6, 17, T7);
223
SET(b, c, d, a, 7, 22, T8);
224
SET(a, b, c, d, 8, 7, T9);
225
SET(d, a, b, c, 9, 12, T10);
226
SET(c, d, a, b, 10, 17, T11);
227
SET(b, c, d, a, 11, 22, T12);
228
SET(a, b, c, d, 12, 7, T13);
229
SET(d, a, b, c, 13, 12, T14);
230
SET(c, d, a, b, 14, 17, T15);
231
SET(b, c, d, a, 15, 22, T16);
235
/* Let [abcd k s i] denote the operation
236
a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
237
#define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
238
#define SET(a, b, c, d, k, s, Ti)\
239
t = a + G(b,c,d) + X[k] + Ti;\
240
a = ROTATE_LEFT(t, s) + b
241
/* Do the following 16 operations. */
242
SET(a, b, c, d, 1, 5, T17);
243
SET(d, a, b, c, 6, 9, T18);
244
SET(c, d, a, b, 11, 14, T19);
245
SET(b, c, d, a, 0, 20, T20);
246
SET(a, b, c, d, 5, 5, T21);
247
SET(d, a, b, c, 10, 9, T22);
248
SET(c, d, a, b, 15, 14, T23);
249
SET(b, c, d, a, 4, 20, T24);
250
SET(a, b, c, d, 9, 5, T25);
251
SET(d, a, b, c, 14, 9, T26);
252
SET(c, d, a, b, 3, 14, T27);
253
SET(b, c, d, a, 8, 20, T28);
254
SET(a, b, c, d, 13, 5, T29);
255
SET(d, a, b, c, 2, 9, T30);
256
SET(c, d, a, b, 7, 14, T31);
257
SET(b, c, d, a, 12, 20, T32);
261
/* Let [abcd k s t] denote the operation
262
a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
263
#define H(x, y, z) ((x) ^ (y) ^ (z))
264
#define SET(a, b, c, d, k, s, Ti)\
265
t = a + H(b,c,d) + X[k] + Ti;\
266
a = ROTATE_LEFT(t, s) + b
267
/* Do the following 16 operations. */
268
SET(a, b, c, d, 5, 4, T33);
269
SET(d, a, b, c, 8, 11, T34);
270
SET(c, d, a, b, 11, 16, T35);
271
SET(b, c, d, a, 14, 23, T36);
272
SET(a, b, c, d, 1, 4, T37);
273
SET(d, a, b, c, 4, 11, T38);
274
SET(c, d, a, b, 7, 16, T39);
275
SET(b, c, d, a, 10, 23, T40);
276
SET(a, b, c, d, 13, 4, T41);
277
SET(d, a, b, c, 0, 11, T42);
278
SET(c, d, a, b, 3, 16, T43);
279
SET(b, c, d, a, 6, 23, T44);
280
SET(a, b, c, d, 9, 4, T45);
281
SET(d, a, b, c, 12, 11, T46);
282
SET(c, d, a, b, 15, 16, T47);
283
SET(b, c, d, a, 2, 23, T48);
287
/* Let [abcd k s t] denote the operation
288
a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
289
#define I(x, y, z) ((y) ^ ((x) | ~(z)))
290
#define SET(a, b, c, d, k, s, Ti)\
291
t = a + I(b,c,d) + X[k] + Ti;\
292
a = ROTATE_LEFT(t, s) + b
293
/* Do the following 16 operations. */
294
SET(a, b, c, d, 0, 6, T49);
295
SET(d, a, b, c, 7, 10, T50);
296
SET(c, d, a, b, 14, 15, T51);
297
SET(b, c, d, a, 5, 21, T52);
298
SET(a, b, c, d, 12, 6, T53);
299
SET(d, a, b, c, 3, 10, T54);
300
SET(c, d, a, b, 10, 15, T55);
301
SET(b, c, d, a, 1, 21, T56);
302
SET(a, b, c, d, 8, 6, T57);
303
SET(d, a, b, c, 15, 10, T58);
304
SET(c, d, a, b, 6, 15, T59);
305
SET(b, c, d, a, 13, 21, T60);
306
SET(a, b, c, d, 4, 6, T61);
307
SET(d, a, b, c, 11, 10, T62);
308
SET(c, d, a, b, 2, 15, T63);
309
SET(b, c, d, a, 9, 21, T64);
312
/* Then perform the following additions. (That is increment each
313
of the four registers by the value it had before this block
315
md5_state.abcd[0] += a;
316
md5_state.abcd[1] += b;
317
md5_state.abcd[2] += c;
318
md5_state.abcd[3] += d;
324
/* Indicates that there is no digest: */
327
md5_state.count[0] = md5_state.count[1] = 0;
328
md5_state.abcd[0] = 0x67452301;
329
md5_state.abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
330
md5_state.abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
331
md5_state.abcd[3] = 0x10325476;
334
void CSMd5::md5_append(const u_char *data, int nbytes)
336
const u_char *p = data;
338
int offset = (md5_state.count[0] >> 3) & 63;
339
md5_word_t nbits = (md5_word_t)(nbytes << 3);
345
/* Update the message length. */
346
md5_state.count[1] += nbytes >> 29;
347
md5_state.count[0] += nbits;
348
if (md5_state.count[0] < nbits)
349
md5_state.count[1]++;
351
/* Process an initial partial block. */
353
int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
355
memcpy(md5_state.buf + offset, p, copy);
356
if (offset + copy < 64)
360
md5_process(md5_state.buf);
363
/* Process full blocks. */
364
for (; left >= 64; p += 64, left -= 64)
367
/* Process a final partial block. */
369
memcpy(md5_state.buf, p, left);
373
void CSMd5::md5_digest()
375
static const u_char pad[64] = {
376
0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
377
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
378
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
379
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
384
/* Save the length before padding. */
385
for (i = 0; i < 8; ++i)
386
data[i] = (u_char)(md5_state.count[i >> 2] >> ((i & 3) << 3));
387
/* Pad to 56 bytes mod 64. */
388
md5_append(pad, ((55 - (md5_state.count[0] >> 3)) & 63) + 1);
389
/* Append the length. */
391
for (i = 0; i < 16; ++i)
392
digest[i] = (u_char)(md5_state.abcd[i >> 2] >> ((i & 3) << 3));
394
/* Generate the text version: */
395
cs_bin_to_hex(MD5_CHECKSUM_STRING_SIZE, digest_cstr, MD5_CHECKSUM_SIZE, digest);
added
removed
plugin/pbms/src/cslib/CSMd5.cc
