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