3 * This source code is distributed with
7 * GROningen MAchine for Chemical Simulations
10 * Written by David van der Spoel, Erik Lindahl, Berk Hess, and others.
11 * Copyright (c) 1991-2010, The GROMACS development team,
12 * check out http://www.gromacs.org for more information.
14 * Gromacs is free software; you can redistribute it and/or
15 * modify it under the terms of the GNU General Public License
16 * as published by the Free Software Foundation; either version 2
17 * of the License, or (at your option) any later version.
19 * If you want to redistribute modifications, please consider that
20 * scientific software is very special. Version control is crucial -
21 * bugs must be traceable. We will be happy to consider code for
22 * inclusion in the official distribution, but derived work must not
23 * be called official GROMACS. Details are found in the README & COPYING
24 * files - if they are missing, get the official version at www.gromacs.org.
26 * To help us fund GROMACS development, we humbly ask that you cite
27 * the papers on the package - you can find them in the top README file.
29 * For more info, check our website at http://www.gromacs.org
32 * GROningen Mixture of Alchemy and Childrens' Stories
38 #ifdef GMX_INTEGER_BIG_ENDIAN
39 #define ARCH_IS_BIG_ENDIAN 1
41 #define ARCH_IS_BIG_ENDIAN 0
45 Copyright (C) 1999, 2000, 2002 Aladdin Enterprises. All rights reserved.
47 This software is provided 'as-is', without any express or implied
48 warranty. In no event will the authors be held liable for any damages
49 arising from the use of this software.
51 Permission is granted to anyone to use this software for any purpose,
52 including commercial applications, and to alter it and redistribute it
53 freely, subject to the following restrictions:
55 1. The origin of this software must not be misrepresented; you must not
56 claim that you wrote the original software. If you use this software
57 in a product, an acknowledgment in the product documentation would be
58 appreciated but is not required.
59 2. Altered source versions must be plainly marked as such, and must not be
60 misrepresented as being the original software.
61 3. This notice may not be removed or altered from any source distribution.
68 Independent implementation of MD5 (RFC 1321).
70 This code implements the MD5 Algorithm defined in RFC 1321, whose
72 http://www.ietf.org/rfc/rfc1321.txt
73 The code is derived from the text of the RFC, including the test suite
74 (section A.5) but excluding the rest of Appendix A. It does not include
75 any code or documentation that is identified in the RFC as being
78 The original and principal author of md5.c is L. Peter Deutsch
79 <ghost@aladdin.com>. Other authors are noted in the change history
80 that follows (in reverse chronological order):
82 2002-04-13 lpd Clarified derivation from RFC 1321; now handles byte order
83 either statically or dynamically; added missing #include <string.h>
85 2002-03-11 lpd Corrected argument list for main(), and added int return
86 type, in test program and T value program.
87 2002-02-21 lpd Added missing #include <stdio.h> in test program.
88 2000-07-03 lpd Patched to eliminate warnings about "constant is
89 unsigned in ANSI C, signed in traditional"; made test program
91 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
92 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5).
93 1999-05-03 lpd Original version.
99 #undef BYTE_ORDER /* 1 = big-endian, -1 = little-endian, 0 = unknown */
100 #ifdef ARCH_IS_BIG_ENDIAN
101 # define BYTE_ORDER (ARCH_IS_BIG_ENDIAN ? 1 : -1)
103 # define BYTE_ORDER 0
106 #define T_MASK ((md5_word_t)~0)
107 #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
108 #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
109 #define T3 0x242070db
110 #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
111 #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
112 #define T6 0x4787c62a
113 #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
114 #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
115 #define T9 0x698098d8
116 #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
117 #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
118 #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
119 #define T13 0x6b901122
120 #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
121 #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
122 #define T16 0x49b40821
123 #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
124 #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
125 #define T19 0x265e5a51
126 #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
127 #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
128 #define T22 0x02441453
129 #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
130 #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
131 #define T25 0x21e1cde6
132 #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
133 #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
134 #define T28 0x455a14ed
135 #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
136 #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
137 #define T31 0x676f02d9
138 #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
139 #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
140 #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
141 #define T35 0x6d9d6122
142 #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
143 #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
144 #define T38 0x4bdecfa9
145 #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
146 #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
147 #define T41 0x289b7ec6
148 #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
149 #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
150 #define T44 0x04881d05
151 #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
152 #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
153 #define T47 0x1fa27cf8
154 #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
155 #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
156 #define T50 0x432aff97
157 #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
158 #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
159 #define T53 0x655b59c3
160 #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
161 #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
162 #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
163 #define T57 0x6fa87e4f
164 #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
165 #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
166 #define T60 0x4e0811a1
167 #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
168 #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
169 #define T63 0x2ad7d2bb
170 #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
174 md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
177 a = pms->abcd[0], b = pms->abcd[1],
178 c = pms->abcd[2], d = pms->abcd[3];
181 /* Define storage only for big-endian CPUs. */
184 /* Define storage for little-endian or both types of CPUs. */
186 /* cppcheck-suppress unassignedVariable */
193 * Determine dynamically whether this is a big-endian or
194 * little-endian machine, since we can use a more efficient
195 * algorithm on the latter.
197 static const int w = 1;
199 if (*((const md5_byte_t *)&w)) /* dynamic little-endian */
201 #if BYTE_ORDER <= 0 /* little-endian */
204 * On little-endian machines, we can process properly aligned
205 * data without copying it.
207 if (!((data - (const md5_byte_t *)0) & 3)) {
208 /* data are properly aligned */
209 X = (const md5_word_t *)data;
212 memcpy(xbuf, data, 64);
218 else /* dynamic big-endian */
220 #if BYTE_ORDER >= 0 /* big-endian */
223 * On big-endian machines, we must arrange the bytes in the
226 const md5_byte_t *xp = data;
230 X = xbuf; /* (dynamic only) */
232 # define xbuf X /* (static only) */
234 for (i = 0; i < 16; ++i, xp += 4)
235 xbuf[i] = xp[0] + (xp[1] << 8) + (xp[2] << 16) + (xp[3] << 24);
240 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
243 /* Let [abcd k s i] denote the operation
244 a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
245 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
246 #define SET(a, b, c, d, k, s, Ti)\
247 t = a + F(b,c,d) + X[k] + Ti;\
248 a = ROTATE_LEFT(t, s) + b
249 /* Do the following 16 operations. */
250 SET(a, b, c, d, 0, 7, T1);
251 SET(d, a, b, c, 1, 12, T2);
252 SET(c, d, a, b, 2, 17, T3);
253 SET(b, c, d, a, 3, 22, T4);
254 SET(a, b, c, d, 4, 7, T5);
255 SET(d, a, b, c, 5, 12, T6);
256 SET(c, d, a, b, 6, 17, T7);
257 SET(b, c, d, a, 7, 22, T8);
258 SET(a, b, c, d, 8, 7, T9);
259 SET(d, a, b, c, 9, 12, T10);
260 SET(c, d, a, b, 10, 17, T11);
261 SET(b, c, d, a, 11, 22, T12);
262 SET(a, b, c, d, 12, 7, T13);
263 SET(d, a, b, c, 13, 12, T14);
264 SET(c, d, a, b, 14, 17, T15);
265 SET(b, c, d, a, 15, 22, T16);
269 /* Let [abcd k s i] denote the operation
270 a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
271 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
272 #define SET(a, b, c, d, k, s, Ti)\
273 t = a + G(b,c,d) + X[k] + Ti;\
274 a = ROTATE_LEFT(t, s) + b
275 /* Do the following 16 operations. */
276 SET(a, b, c, d, 1, 5, T17);
277 SET(d, a, b, c, 6, 9, T18);
278 SET(c, d, a, b, 11, 14, T19);
279 SET(b, c, d, a, 0, 20, T20);
280 SET(a, b, c, d, 5, 5, T21);
281 SET(d, a, b, c, 10, 9, T22);
282 SET(c, d, a, b, 15, 14, T23);
283 SET(b, c, d, a, 4, 20, T24);
284 SET(a, b, c, d, 9, 5, T25);
285 SET(d, a, b, c, 14, 9, T26);
286 SET(c, d, a, b, 3, 14, T27);
287 SET(b, c, d, a, 8, 20, T28);
288 SET(a, b, c, d, 13, 5, T29);
289 SET(d, a, b, c, 2, 9, T30);
290 SET(c, d, a, b, 7, 14, T31);
291 SET(b, c, d, a, 12, 20, T32);
295 /* Let [abcd k s t] denote the operation
296 a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
297 #define H(x, y, z) ((x) ^ (y) ^ (z))
298 #define SET(a, b, c, d, k, s, Ti)\
299 t = a + H(b,c,d) + X[k] + Ti;\
300 a = ROTATE_LEFT(t, s) + b
301 /* Do the following 16 operations. */
302 SET(a, b, c, d, 5, 4, T33);
303 SET(d, a, b, c, 8, 11, T34);
304 SET(c, d, a, b, 11, 16, T35);
305 SET(b, c, d, a, 14, 23, T36);
306 SET(a, b, c, d, 1, 4, T37);
307 SET(d, a, b, c, 4, 11, T38);
308 SET(c, d, a, b, 7, 16, T39);
309 SET(b, c, d, a, 10, 23, T40);
310 SET(a, b, c, d, 13, 4, T41);
311 SET(d, a, b, c, 0, 11, T42);
312 SET(c, d, a, b, 3, 16, T43);
313 SET(b, c, d, a, 6, 23, T44);
314 SET(a, b, c, d, 9, 4, T45);
315 SET(d, a, b, c, 12, 11, T46);
316 SET(c, d, a, b, 15, 16, T47);
317 SET(b, c, d, a, 2, 23, T48);
321 /* Let [abcd k s t] denote the operation
322 a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
323 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
324 #define SET(a, b, c, d, k, s, Ti)\
325 t = a + I(b,c,d) + X[k] + Ti;\
326 a = ROTATE_LEFT(t, s) + b
327 /* Do the following 16 operations. */
328 SET(a, b, c, d, 0, 6, T49);
329 SET(d, a, b, c, 7, 10, T50);
330 SET(c, d, a, b, 14, 15, T51);
331 SET(b, c, d, a, 5, 21, T52);
332 SET(a, b, c, d, 12, 6, T53);
333 SET(d, a, b, c, 3, 10, T54);
334 SET(c, d, a, b, 10, 15, T55);
335 SET(b, c, d, a, 1, 21, T56);
336 SET(a, b, c, d, 8, 6, T57);
337 SET(d, a, b, c, 15, 10, T58);
338 SET(c, d, a, b, 6, 15, T59);
339 SET(b, c, d, a, 13, 21, T60);
340 SET(a, b, c, d, 4, 6, T61);
341 SET(d, a, b, c, 11, 10, T62);
342 SET(c, d, a, b, 2, 15, T63);
343 SET(b, c, d, a, 9, 21, T64);
346 /* Then perform the following additions. (That is increment each
347 of the four registers by the value it had before this block
356 md5_init(md5_state_t *pms)
358 pms->count[0] = pms->count[1] = 0;
359 pms->abcd[0] = 0x67452301;
360 pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
361 pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
362 pms->abcd[3] = 0x10325476;
366 md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)
368 const md5_byte_t *p = data;
370 int offset = (pms->count[0] >> 3) & 63;
371 md5_word_t nbits = (md5_word_t)(nbytes << 3);
376 /* Update the message length. */
377 pms->count[1] += nbytes >> 29;
378 pms->count[0] += nbits;
379 if (pms->count[0] < nbits)
382 /* Process an initial partial block. */
384 int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
386 memcpy(pms->buf + offset, p, copy);
387 if (offset + copy < 64)
391 md5_process(pms, pms->buf);
394 /* Process full blocks. */
395 for (; left >= 64; p += 64, left -= 64)
398 /* Process a final partial block. */
400 memcpy(pms->buf, p, left);
404 md5_finish(md5_state_t *pms, md5_byte_t digest[16])
406 static const md5_byte_t pad[64] = {
407 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
408 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
409 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
410 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
415 /* Save the length before padding. */
416 for (i = 0; i < 8; ++i)
417 data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
418 /* Pad to 56 bytes mod 64. */
419 md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
420 /* Append the length. */
421 md5_append(pms, data, 8);
422 for (i = 0; i < 16; ++i)
423 digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));