1 /* This file has been modified in the TNG library distribution. Modifications
4 /* The define below was added in the TNG library distribution of this file. */
5 #ifdef TNG_INTEGER_BIG_ENDIAN
6 #define ARCH_IS_BIG_ENDIAN 1
8 #define ARCH_IS_BIG_ENDIAN 0
11 /* The defines below were added in TNG library distribution of this file
12 * in order to compile properly in MSVC */
15 #if defined(WIN32) || defined(_WIN32) || defined(WIN64) || defined(_WIN64)
18 #endif /* not defined USE_WINDOWS */
21 #define TNG_INLINE __inline
23 #define TNG_INLINE inline
27 Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
29 This software is provided 'as-is', without any express or implied
30 warranty. In no event will the authors be held liable for any damages
31 arising from the use of this software.
33 Permission is granted to anyone to use this software for any purpose,
34 including commercial applications, and to alter it and redistribute it
35 freely, subject to the following restrictions:
37 1. The origin of this software must not be misrepresented; you must not
38 claim that you wrote the original software. If you use this software
39 in a product, an acknowledgment in the product documentation would be
40 appreciated but is not required.
41 2. Altered source versions must be plainly marked as such, and must not be
42 misrepresented as being the original software.
43 3. This notice may not be removed or altered from any source distribution.
50 Independent implementation of MD5 (RFC 1321).
52 This code implements the MD5 Algorithm defined in RFC 1321, whose
54 http://www.ietf.org/rfc/rfc1321.txt
55 The code is derived from the text of the RFC, including the test suite
56 (section A.5) but excluding the rest of Appendix A. It does not include
57 any code or documentation that is identified in the RFC as being
60 The original and principal author of md5.c is L. Peter Deutsch
61 <ghost@aladdin.com>. Other authors are noted in the change history
62 that follows (in reverse chronological order):
64 2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
65 either statically or dynamically; added missing #include <string.h>
67 2002-03-11 lpd Corrected argument list for main(), and added int return
68 type, in test program and T value program.
69 2002-02-21 lpd Added missing #include <stdio.h> in test program.
70 2000-07-03 lpd Patched to eliminate warnings about "constant is
71 unsigned in ANSI C, signed in traditional"; made test program
73 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
74 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
75 1999-05-03 lpd Original version.
78 #include "../../include/md5.h"
81 #undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
82 #ifdef ARCH_IS_BIG_ENDIAN
83 # define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
88 #define T_MASK ((md5_word_t)~0)
89 #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
90 #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
92 #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
93 #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
95 #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
96 #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
98 #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
99 #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
100 #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
101 #define T13 0x6b901122
102 #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
103 #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
104 #define T16 0x49b40821
105 #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
106 #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
107 #define T19 0x265e5a51
108 #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
109 #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
110 #define T22 0x02441453
111 #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
112 #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
113 #define T25 0x21e1cde6
114 #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
115 #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
116 #define T28 0x455a14ed
117 #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
118 #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
119 #define T31 0x676f02d9
120 #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
121 #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
122 #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
123 #define T35 0x6d9d6122
124 #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
125 #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
126 #define T38 0x4bdecfa9
127 #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
128 #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
129 #define T41 0x289b7ec6
130 #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
131 #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
132 #define T44 0x04881d05
133 #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
134 #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
135 #define T47 0x1fa27cf8
136 #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
137 #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
138 #define T50 0x432aff97
139 #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
140 #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
141 #define T53 0x655b59c3
142 #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
143 #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
144 #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
145 #define T57 0x6fa87e4f
146 #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
147 #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
148 #define T60 0x4e0811a1
149 #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
150 #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
151 #define T63 0x2ad7d2bb
152 #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
154 /* In the TNG library inline has been changed to TNG_INLINE */
155 static TNG_INLINE void
156 md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
159 a = pms->abcd[0], b = pms->abcd[1],
160 c = pms->abcd[2], d = pms->abcd[3];
163 /* Define storage only for big-endian CPUs. */
166 /* Define storage for little-endian or both types of CPUs. */
174 * Determine dynamically whether this is a big-endian or
175 * little-endian machine, since we can use a more efficient
176 * algorithm on the latter.
178 static const int w = 1;
180 if (*((const md5_byte_t *)&w)) /* dynamic little-endian */
182 #if BYTE_ORDER <= 0 /* little-endian */
185 * On little-endian machines, we can process properly aligned
186 * data without copying it.
188 if (!((data - (const md5_byte_t *)0) & 3)) {
189 /* data are properly aligned */
190 X = (const md5_word_t *)data;
193 memcpy(xbuf, data, 64);
199 else /* dynamic big-endian */
201 #if BYTE_ORDER >= 0 /* big-endian */
204 * On big-endian machines, we must arrange the bytes in the
207 const md5_byte_t *xp = data;
211 X = xbuf; /* (dynamic only) */
213 # define xbuf X /* (static only) */
215 for (i = 0; i < 16; ++i, xp += 4)
216 xbuf[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
221 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
224 /* Let [abcd k s i] denote the operation
225 a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
226 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
227 #define SET(a, b, c, d, k, s, Ti)\
228 t = a + F(b,c,d) + X[k] + Ti;\
229 a = ROTATE_LEFT(t, s) + b
230 /* Do the following 16 operations. */
231 SET(a, b, c, d, 0, 7, T1);
232 SET(d, a, b, c, 1, 12, T2);
233 SET(c, d, a, b, 2, 17, T3);
234 SET(b, c, d, a, 3, 22, T4);
235 SET(a, b, c, d, 4, 7, T5);
236 SET(d, a, b, c, 5, 12, T6);
237 SET(c, d, a, b, 6, 17, T7);
238 SET(b, c, d, a, 7, 22, T8);
239 SET(a, b, c, d, 8, 7, T9);
240 SET(d, a, b, c, 9, 12, T10);
241 SET(c, d, a, b, 10, 17, T11);
242 SET(b, c, d, a, 11, 22, T12);
243 SET(a, b, c, d, 12, 7, T13);
244 SET(d, a, b, c, 13, 12, T14);
245 SET(c, d, a, b, 14, 17, T15);
246 SET(b, c, d, a, 15, 22, T16);
250 /* Let [abcd k s i] denote the operation
251 a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
252 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
253 #define SET(a, b, c, d, k, s, Ti)\
254 t = a + G(b,c,d) + X[k] + Ti;\
255 a = ROTATE_LEFT(t, s) + b
256 /* Do the following 16 operations. */
257 SET(a, b, c, d, 1, 5, T17);
258 SET(d, a, b, c, 6, 9, T18);
259 SET(c, d, a, b, 11, 14, T19);
260 SET(b, c, d, a, 0, 20, T20);
261 SET(a, b, c, d, 5, 5, T21);
262 SET(d, a, b, c, 10, 9, T22);
263 SET(c, d, a, b, 15, 14, T23);
264 SET(b, c, d, a, 4, 20, T24);
265 SET(a, b, c, d, 9, 5, T25);
266 SET(d, a, b, c, 14, 9, T26);
267 SET(c, d, a, b, 3, 14, T27);
268 SET(b, c, d, a, 8, 20, T28);
269 SET(a, b, c, d, 13, 5, T29);
270 SET(d, a, b, c, 2, 9, T30);
271 SET(c, d, a, b, 7, 14, T31);
272 SET(b, c, d, a, 12, 20, T32);
276 /* Let [abcd k s t] denote the operation
277 a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
278 #define H(x, y, z) ((x) ^ (y) ^ (z))
279 #define SET(a, b, c, d, k, s, Ti)\
280 t = a + H(b,c,d) + X[k] + Ti;\
281 a = ROTATE_LEFT(t, s) + b
282 /* Do the following 16 operations. */
283 SET(a, b, c, d, 5, 4, T33);
284 SET(d, a, b, c, 8, 11, T34);
285 SET(c, d, a, b, 11, 16, T35);
286 SET(b, c, d, a, 14, 23, T36);
287 SET(a, b, c, d, 1, 4, T37);
288 SET(d, a, b, c, 4, 11, T38);
289 SET(c, d, a, b, 7, 16, T39);
290 SET(b, c, d, a, 10, 23, T40);
291 SET(a, b, c, d, 13, 4, T41);
292 SET(d, a, b, c, 0, 11, T42);
293 SET(c, d, a, b, 3, 16, T43);
294 SET(b, c, d, a, 6, 23, T44);
295 SET(a, b, c, d, 9, 4, T45);
296 SET(d, a, b, c, 12, 11, T46);
297 SET(c, d, a, b, 15, 16, T47);
298 SET(b, c, d, a, 2, 23, T48);
302 /* Let [abcd k s t] denote the operation
303 a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
304 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
305 #define SET(a, b, c, d, k, s, Ti)\
306 t = a + I(b,c,d) + X[k] + Ti;\
307 a = ROTATE_LEFT(t, s) + b
308 /* Do the following 16 operations. */
309 SET(a, b, c, d, 0, 6, T49);
310 SET(d, a, b, c, 7, 10, T50);
311 SET(c, d, a, b, 14, 15, T51);
312 SET(b, c, d, a, 5, 21, T52);
313 SET(a, b, c, d, 12, 6, T53);
314 SET(d, a, b, c, 3, 10, T54);
315 SET(c, d, a, b, 10, 15, T55);
316 SET(b, c, d, a, 1, 21, T56);
317 SET(a, b, c, d, 8, 6, T57);
318 SET(d, a, b, c, 15, 10, T58);
319 SET(c, d, a, b, 6, 15, T59);
320 SET(b, c, d, a, 13, 21, T60);
321 SET(a, b, c, d, 4, 6, T61);
322 SET(d, a, b, c, 11, 10, T62);
323 SET(c, d, a, b, 2, 15, T63);
324 SET(b, c, d, a, 9, 21, T64);
327 /* Then perform the following additions. (That is increment each
328 of the four registers by the value it had before this block
337 md5_init(md5_state_t *pms)
339 pms->count[0] = pms->count[1] = 0;
340 pms->abcd[0] = 0x67452301;
341 pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
342 pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
343 pms->abcd[3] = 0x10325476;
347 md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)
349 const md5_byte_t *p = data;
351 int offset = (pms->count[0] >> 3) & 63;
352 md5_word_t nbits = (md5_word_t)(nbytes << 3);
357 /* Update the message length. */
358 pms->count[1] += nbytes >> 29;
359 pms->count[0] += nbits;
360 if (pms->count[0] < nbits)
363 /* Process an initial partial block. */
365 int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
367 memcpy(pms->buf + offset, p, copy);
368 if (offset + copy < 64)
372 md5_process(pms, pms->buf);
375 /* Process full blocks. */
376 for (; left >= 64; p += 64, left -= 64)
379 /* Process a final partial block. */
381 memcpy(pms->buf, p, left);
385 md5_finish(md5_state_t *pms, md5_byte_t digest[16])
387 static const md5_byte_t pad[64] = {
388 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
389 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
390 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
391 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
396 /* Save the length before padding. */
397 for (i = 0; i < 8; ++i)
398 data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
399 /* Pad to 56 bytes mod 64. */
400 md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
401 /* Append the length. */
402 md5_append(pms, data, 8);
403 for (i = 0; i < 16; ++i)
404 digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));