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