2 * Copyright (c) 2008, 2009, 2010, 2011 Kernel Drivers, LLC.
3 * Copyright (c) 2009, 2010, 2011 Your File System, Inc.
6 * Redistribution and use in source and binary forms, with or without
7 * modification, are permitted provided that the following conditions
10 * - Redistributions of source code must retain the above copyright notice,
11 * this list of conditions and the following disclaimer.
12 * - Redistributions in binary form must reproduce the above copyright
14 * this list of conditions and the following disclaimer in the
16 * and/or other materials provided with the distribution.
17 * - Neither the names of Kernel Drivers, LLC and Your File System, Inc.
18 * nor the names of their contributors may be used to endorse or promote
19 * products derived from this software without specific prior written
20 * permission from Kernel Drivers, LLC and Your File System, Inc.
22 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS"
23 * AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
24 * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
25 * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER
26 * OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
27 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
28 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
29 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
30 * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
31 * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
32 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36 // File: AFSMD5Support.cpp
39 #include "AFSCommon.h"
42 // BEGIN Aladdin Enterprises MD5 SOURCES
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.
68 /* $Id: md5.h,v 1.4 2002/04/13 19:20:28 lpd Exp $ */
70 Independent implementation of MD5 (RFC 1321).
72 This code implements the MD5 Algorithm defined in RFC 1321, whose
74 http://www.ietf.org/rfc/rfc1321.txt
75 The code is derived from the text of the RFC, including the test suite
76 (section A.5) but excluding the rest of Appendix A. It does not include
77 any code or documentation that is identified in the RFC as being
80 The original and principal author of md5.h is L. Peter Deutsch
81 <ghost@aladdin.com>. Other authors are noted in the change history
82 that follows (in reverse chronological order):
84 2002-04-13 lpd Removed support for non-ANSI compilers; removed
85 references to Ghostscript; clarified derivation from RFC 1321;
86 now handles byte order either statically or dynamically.
87 1999-11-04 lpd Edited comments slightly for automatic TOC extraction.
88 1999-10-18 lpd Fixed typo in header comment (ansi2knr rather than md5);
89 added conditionalization for C++ compilation from Martin
90 Purschke <purschke@bnl.gov>.
91 1999-05-03 lpd Original version.
94 typedef unsigned char md5_byte_t; /* 8-bit byte */
95 typedef unsigned int md5_word_t; /* 32-bit word */
97 /* Define the state of the MD5 Algorithm. */
98 typedef struct md5_state_s {
99 md5_word_t count[2]; /* message length in bits, lsw first */
100 md5_word_t abcd[4]; /* digest buffer */
101 md5_byte_t buf[64]; /* accumulate block */
107 /* Initialize the algorithm. */
108 void md5_init(md5_state_t *pms);
110 /* Append a string to the message. */
111 void md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes);
113 /* Finish the message and return the digest. */
114 void md5_finish(md5_state_t *pms, md5_byte_t digest[16]);
116 } /* end extern "C" */
118 #define T_MASK ((md5_word_t)~0)
119 #define T1 /* 0xd76aa478 */ (T_MASK ^ 0x28955b87)
120 #define T2 /* 0xe8c7b756 */ (T_MASK ^ 0x173848a9)
121 #define T3 0x242070db
122 #define T4 /* 0xc1bdceee */ (T_MASK ^ 0x3e423111)
123 #define T5 /* 0xf57c0faf */ (T_MASK ^ 0x0a83f050)
124 #define T6 0x4787c62a
125 #define T7 /* 0xa8304613 */ (T_MASK ^ 0x57cfb9ec)
126 #define T8 /* 0xfd469501 */ (T_MASK ^ 0x02b96afe)
127 #define T9 0x698098d8
128 #define T10 /* 0x8b44f7af */ (T_MASK ^ 0x74bb0850)
129 #define T11 /* 0xffff5bb1 */ (T_MASK ^ 0x0000a44e)
130 #define T12 /* 0x895cd7be */ (T_MASK ^ 0x76a32841)
131 #define T13 0x6b901122
132 #define T14 /* 0xfd987193 */ (T_MASK ^ 0x02678e6c)
133 #define T15 /* 0xa679438e */ (T_MASK ^ 0x5986bc71)
134 #define T16 0x49b40821
135 #define T17 /* 0xf61e2562 */ (T_MASK ^ 0x09e1da9d)
136 #define T18 /* 0xc040b340 */ (T_MASK ^ 0x3fbf4cbf)
137 #define T19 0x265e5a51
138 #define T20 /* 0xe9b6c7aa */ (T_MASK ^ 0x16493855)
139 #define T21 /* 0xd62f105d */ (T_MASK ^ 0x29d0efa2)
140 #define T22 0x02441453
141 #define T23 /* 0xd8a1e681 */ (T_MASK ^ 0x275e197e)
142 #define T24 /* 0xe7d3fbc8 */ (T_MASK ^ 0x182c0437)
143 #define T25 0x21e1cde6
144 #define T26 /* 0xc33707d6 */ (T_MASK ^ 0x3cc8f829)
145 #define T27 /* 0xf4d50d87 */ (T_MASK ^ 0x0b2af278)
146 #define T28 0x455a14ed
147 #define T29 /* 0xa9e3e905 */ (T_MASK ^ 0x561c16fa)
148 #define T30 /* 0xfcefa3f8 */ (T_MASK ^ 0x03105c07)
149 #define T31 0x676f02d9
150 #define T32 /* 0x8d2a4c8a */ (T_MASK ^ 0x72d5b375)
151 #define T33 /* 0xfffa3942 */ (T_MASK ^ 0x0005c6bd)
152 #define T34 /* 0x8771f681 */ (T_MASK ^ 0x788e097e)
153 #define T35 0x6d9d6122
154 #define T36 /* 0xfde5380c */ (T_MASK ^ 0x021ac7f3)
155 #define T37 /* 0xa4beea44 */ (T_MASK ^ 0x5b4115bb)
156 #define T38 0x4bdecfa9
157 #define T39 /* 0xf6bb4b60 */ (T_MASK ^ 0x0944b49f)
158 #define T40 /* 0xbebfbc70 */ (T_MASK ^ 0x4140438f)
159 #define T41 0x289b7ec6
160 #define T42 /* 0xeaa127fa */ (T_MASK ^ 0x155ed805)
161 #define T43 /* 0xd4ef3085 */ (T_MASK ^ 0x2b10cf7a)
162 #define T44 0x04881d05
163 #define T45 /* 0xd9d4d039 */ (T_MASK ^ 0x262b2fc6)
164 #define T46 /* 0xe6db99e5 */ (T_MASK ^ 0x1924661a)
165 #define T47 0x1fa27cf8
166 #define T48 /* 0xc4ac5665 */ (T_MASK ^ 0x3b53a99a)
167 #define T49 /* 0xf4292244 */ (T_MASK ^ 0x0bd6ddbb)
168 #define T50 0x432aff97
169 #define T51 /* 0xab9423a7 */ (T_MASK ^ 0x546bdc58)
170 #define T52 /* 0xfc93a039 */ (T_MASK ^ 0x036c5fc6)
171 #define T53 0x655b59c3
172 #define T54 /* 0x8f0ccc92 */ (T_MASK ^ 0x70f3336d)
173 #define T55 /* 0xffeff47d */ (T_MASK ^ 0x00100b82)
174 #define T56 /* 0x85845dd1 */ (T_MASK ^ 0x7a7ba22e)
175 #define T57 0x6fa87e4f
176 #define T58 /* 0xfe2ce6e0 */ (T_MASK ^ 0x01d3191f)
177 #define T59 /* 0xa3014314 */ (T_MASK ^ 0x5cfebceb)
178 #define T60 0x4e0811a1
179 #define T61 /* 0xf7537e82 */ (T_MASK ^ 0x08ac817d)
180 #define T62 /* 0xbd3af235 */ (T_MASK ^ 0x42c50dca)
181 #define T63 0x2ad7d2bb
182 #define T64 /* 0xeb86d391 */ (T_MASK ^ 0x14792c6e)
185 md5_process(md5_state_t *pms, const md5_byte_t *data /*[64]*/)
188 a = pms->abcd[0], b = pms->abcd[1],
189 c = pms->abcd[2], d = pms->abcd[3];
192 /* Define storage for little-endian or both types of CPUs. */
197 * On little-endian machines, we can process properly aligned
198 * data without copying it.
200 if (!((data - (const md5_byte_t *)0) & 3))
202 /* data are properly aligned */
203 X = (const md5_word_t *)data;
214 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32 - (n))))
217 /* Let [abcd k s i] denote the operation
218 a = b + ((a + F(b,c,d) + X[k] + T[i]) <<< s). */
219 #define F(x, y, z) (((x) & (y)) | (~(x) & (z)))
220 #define SET(a, b, c, d, k, s, Ti)\
221 t = a + F(b,c,d) + X[k] + Ti;\
222 a = ROTATE_LEFT(t, s) + b
223 /* Do the following 16 operations. */
224 SET(a, b, c, d, 0, 7, T1);
225 SET(d, a, b, c, 1, 12, T2);
226 SET(c, d, a, b, 2, 17, T3);
227 SET(b, c, d, a, 3, 22, T4);
228 SET(a, b, c, d, 4, 7, T5);
229 SET(d, a, b, c, 5, 12, T6);
230 SET(c, d, a, b, 6, 17, T7);
231 SET(b, c, d, a, 7, 22, T8);
232 SET(a, b, c, d, 8, 7, T9);
233 SET(d, a, b, c, 9, 12, T10);
234 SET(c, d, a, b, 10, 17, T11);
235 SET(b, c, d, a, 11, 22, T12);
236 SET(a, b, c, d, 12, 7, T13);
237 SET(d, a, b, c, 13, 12, T14);
238 SET(c, d, a, b, 14, 17, T15);
239 SET(b, c, d, a, 15, 22, T16);
243 /* Let [abcd k s i] denote the operation
244 a = b + ((a + G(b,c,d) + X[k] + T[i]) <<< s). */
245 #define G(x, y, z) (((x) & (z)) | ((y) & ~(z)))
246 #define SET(a, b, c, d, k, s, Ti)\
247 t = a + G(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, 1, 5, T17);
251 SET(d, a, b, c, 6, 9, T18);
252 SET(c, d, a, b, 11, 14, T19);
253 SET(b, c, d, a, 0, 20, T20);
254 SET(a, b, c, d, 5, 5, T21);
255 SET(d, a, b, c, 10, 9, T22);
256 SET(c, d, a, b, 15, 14, T23);
257 SET(b, c, d, a, 4, 20, T24);
258 SET(a, b, c, d, 9, 5, T25);
259 SET(d, a, b, c, 14, 9, T26);
260 SET(c, d, a, b, 3, 14, T27);
261 SET(b, c, d, a, 8, 20, T28);
262 SET(a, b, c, d, 13, 5, T29);
263 SET(d, a, b, c, 2, 9, T30);
264 SET(c, d, a, b, 7, 14, T31);
265 SET(b, c, d, a, 12, 20, T32);
269 /* Let [abcd k s t] denote the operation
270 a = b + ((a + H(b,c,d) + X[k] + T[i]) <<< s). */
271 #define H(x, y, z) ((x) ^ (y) ^ (z))
272 #define SET(a, b, c, d, k, s, Ti)\
273 t = a + H(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, 5, 4, T33);
277 SET(d, a, b, c, 8, 11, T34);
278 SET(c, d, a, b, 11, 16, T35);
279 SET(b, c, d, a, 14, 23, T36);
280 SET(a, b, c, d, 1, 4, T37);
281 SET(d, a, b, c, 4, 11, T38);
282 SET(c, d, a, b, 7, 16, T39);
283 SET(b, c, d, a, 10, 23, T40);
284 SET(a, b, c, d, 13, 4, T41);
285 SET(d, a, b, c, 0, 11, T42);
286 SET(c, d, a, b, 3, 16, T43);
287 SET(b, c, d, a, 6, 23, T44);
288 SET(a, b, c, d, 9, 4, T45);
289 SET(d, a, b, c, 12, 11, T46);
290 SET(c, d, a, b, 15, 16, T47);
291 SET(b, c, d, a, 2, 23, T48);
295 /* Let [abcd k s t] denote the operation
296 a = b + ((a + I(b,c,d) + X[k] + T[i]) <<< s). */
297 #define I(x, y, z) ((y) ^ ((x) | ~(z)))
298 #define SET(a, b, c, d, k, s, Ti)\
299 t = a + I(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, 0, 6, T49);
303 SET(d, a, b, c, 7, 10, T50);
304 SET(c, d, a, b, 14, 15, T51);
305 SET(b, c, d, a, 5, 21, T52);
306 SET(a, b, c, d, 12, 6, T53);
307 SET(d, a, b, c, 3, 10, T54);
308 SET(c, d, a, b, 10, 15, T55);
309 SET(b, c, d, a, 1, 21, T56);
310 SET(a, b, c, d, 8, 6, T57);
311 SET(d, a, b, c, 15, 10, T58);
312 SET(c, d, a, b, 6, 15, T59);
313 SET(b, c, d, a, 13, 21, T60);
314 SET(a, b, c, d, 4, 6, T61);
315 SET(d, a, b, c, 11, 10, T62);
316 SET(c, d, a, b, 2, 15, T63);
317 SET(b, c, d, a, 9, 21, T64);
320 /* Then perform the following additions. (That is increment each
321 of the four registers by the value it had before this block
330 md5_init(md5_state_t *pms)
332 pms->count[0] = pms->count[1] = 0;
333 pms->abcd[0] = 0x67452301;
334 pms->abcd[1] = /*0xefcdab89*/ T_MASK ^ 0x10325476;
335 pms->abcd[2] = /*0x98badcfe*/ T_MASK ^ 0x67452301;
336 pms->abcd[3] = 0x10325476;
340 md5_append(md5_state_t *pms, const md5_byte_t *data, int nbytes)
342 const md5_byte_t *p = data;
344 int offset = (pms->count[0] >> 3) & 63;
345 md5_word_t nbits = (md5_word_t)(nbytes << 3);
350 /* Update the message length. */
351 pms->count[1] += nbytes >> 29;
352 pms->count[0] += nbits;
353 if (pms->count[0] < nbits)
356 /* Process an initial partial block. */
360 int copy = (offset + nbytes > 64 ? 64 - offset : nbytes);
362 RtlCopyMemory( pms->buf + offset,
366 if (offset + copy < 64)
370 md5_process(pms, pms->buf);
373 /* Process full blocks. */
374 for (; left >= 64; p += 64, left -= 64)
377 /* Process a final partial block. */
379 RtlCopyMemory( pms->buf, p, left);
383 md5_finish(md5_state_t *pms, md5_byte_t digest[16])
385 static const md5_byte_t pad[64] = {
386 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
387 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
388 0, 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
394 /* Save the length before padding. */
395 for (i = 0; i < 8; ++i)
396 data[i] = (md5_byte_t)(pms->count[i >> 2] >> ((i & 3) << 3));
398 /* Pad to 56 bytes mod 64. */
399 md5_append(pms, pad, ((55 - (pms->count[0] >> 3)) & 63) + 1);
401 /* Append the length. */
402 md5_append(pms, data, 8);
404 for (i = 0; i < 16; ++i)
405 digest[i] = (md5_byte_t)(pms->abcd[i >> 2] >> ((i & 3) << 3));
411 // END Aladdin Enterprises MD5 SOURCES
415 AFSGenerateMD5( IN char *DataBuffer,
417 OUT UCHAR *MD5Digest)
420 md5_state_t stMD5State;
426 // Initialize the md5 context
429 md5_init( &stMD5State);
431 md5_append( &stMD5State,
432 (const md5_byte_t *)DataBuffer,
435 md5_finish( &stMD5State,
436 (md5_byte_t *)MD5Digest);