2 * Copyright (C) 2001 Nikos Mavroyanopoulos
3 * Copyright (C) 2004 Hans Leidekker
5 * This library is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU Lesser General Public
7 * License as published by the Free Software Foundation; either
8 * version 2.1 of the License, or (at your option) any later version.
10 * This library is distributed in the hope that it will be useful,
11 * but WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * Lesser General Public License for more details.
15 * You should have received a copy of the GNU Lesser General Public
16 * License along with this library; if not, write to the Free Software
17 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
21 * This code implements the MD5 message-digest algorithm.
22 * It is based on code in the public domain written by Colin
23 * Plumb in 1993. The algorithm is due to Ron Rivest.
25 * Equivalent code is available from RSA Data Security, Inc.
26 * This code has been tested against that, and is equivalent,
27 * except that you don't need to include two pages of legalese
30 * To compute the message digest of a chunk of bytes, declare an
31 * MD5_CTX structure, pass it to MD5Init, call MD5Update as
32 * needed on buffers full of bytes, and then call MD5Final, which
33 * will fill a supplied 16-byte array with the digest.
46 unsigned char digest
[16];
49 static void MD5Transform( unsigned int buf
[4], const unsigned int in
[16] );
52 * Note: this code is harmless on little-endian machines.
54 static void byteReverse( unsigned char *buf
, unsigned longs
)
59 t
= (unsigned int)((unsigned)buf
[3] << 8 | buf
[2]) << 16 |
60 ((unsigned)buf
[1] << 8 | buf
[0]);
61 *(unsigned int *)buf
= t
;
67 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
68 * initialization constants.
70 VOID WINAPI
MD5Init( MD5_CTX
*ctx
)
72 ctx
->buf
[0] = 0x67452301;
73 ctx
->buf
[1] = 0xefcdab89;
74 ctx
->buf
[2] = 0x98badcfe;
75 ctx
->buf
[3] = 0x10325476;
77 ctx
->i
[0] = ctx
->i
[1] = 0;
81 * Update context to reflect the concatenation of another buffer full
84 VOID WINAPI
MD5Update( MD5_CTX
*ctx
, const unsigned char *buf
, unsigned int len
)
86 register unsigned int t
;
91 if ((ctx
->i
[0] = t
+ ((unsigned int)len
<< 3)) < t
)
92 ctx
->i
[1]++; /* Carry from low to high */
94 ctx
->i
[1] += len
>> 29;
97 /* Handle any leading odd-sized chunks */
100 unsigned char *p
= (unsigned char *)ctx
->in
+ t
;
105 memcpy( p
, buf
, len
);
110 byteReverse( ctx
->in
, 16 );
112 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
118 /* Process data in 64-byte chunks */
121 memcpy( ctx
->in
, buf
, 64 );
122 byteReverse( ctx
->in
, 16 );
124 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
130 /* Handle any remaining bytes of data. */
131 memcpy( ctx
->in
, buf
, len
);
135 * Final wrapup - pad to 64-byte boundary with the bit pattern
136 * 1 0* (64-bit count of bits processed, MSB-first)
138 VOID WINAPI
MD5Final( MD5_CTX
*ctx
)
143 /* Compute number of bytes mod 64 */
144 count
= (ctx
->i
[0] >> 3) & 0x3F;
146 /* Set the first char of padding to 0x80. This is safe since there is
147 always at least one byte free */
151 /* Bytes of padding needed to make 64 bytes */
152 count
= 64 - 1 - count
;
154 /* Pad out to 56 mod 64 */
157 /* Two lots of padding: Pad the first block to 64 bytes */
158 memset( p
, 0, count
);
159 byteReverse( ctx
->in
, 16 );
160 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
162 /* Now fill the next block with 56 bytes */
163 memset( ctx
->in
, 0, 56 );
167 /* Pad block to 56 bytes */
168 memset( p
, 0, count
- 8 );
171 byteReverse( ctx
->in
, 14 );
173 /* Append length in bits and transform */
174 ((unsigned int *)ctx
->in
)[14] = ctx
->i
[0];
175 ((unsigned int *)ctx
->in
)[15] = ctx
->i
[1];
177 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
178 byteReverse( (unsigned char *)ctx
->buf
, 4 );
179 memcpy( ctx
->digest
, ctx
->buf
, 16 );
182 /* The four core functions - F1 is optimized somewhat */
184 /* #define F1( x, y, z ) (x & y | ~x & z) */
185 #define F1( x, y, z ) (z ^ (x & (y ^ z)))
186 #define F2( x, y, z ) F1( z, x, y )
187 #define F3( x, y, z ) (x ^ y ^ z)
188 #define F4( x, y, z ) (y ^ (x | ~z))
190 /* This is the central step in the MD5 algorithm. */
191 #define MD5STEP( f, w, x, y, z, data, s ) \
192 ( w += f( x, y, z ) + data, w = w << s | w >> (32 - s), w += x )
195 * The core of the MD5 algorithm, this alters an existing MD5 hash to
196 * reflect the addition of 16 longwords of new data. MD5Update blocks
197 * the data and converts bytes into longwords for this routine.
199 static void MD5Transform( unsigned int buf
[4], const unsigned int in
[16] )
201 register unsigned int a
, b
, c
, d
;
208 MD5STEP( F1
, a
, b
, c
, d
, in
[0] + 0xd76aa478, 7 );
209 MD5STEP( F1
, d
, a
, b
, c
, in
[1] + 0xe8c7b756, 12 );
210 MD5STEP( F1
, c
, d
, a
, b
, in
[2] + 0x242070db, 17 );
211 MD5STEP( F1
, b
, c
, d
, a
, in
[3] + 0xc1bdceee, 22 );
212 MD5STEP( F1
, a
, b
, c
, d
, in
[4] + 0xf57c0faf, 7 );
213 MD5STEP( F1
, d
, a
, b
, c
, in
[5] + 0x4787c62a, 12 );
214 MD5STEP( F1
, c
, d
, a
, b
, in
[6] + 0xa8304613, 17 );
215 MD5STEP( F1
, b
, c
, d
, a
, in
[7] + 0xfd469501, 22 );
216 MD5STEP( F1
, a
, b
, c
, d
, in
[8] + 0x698098d8, 7 );
217 MD5STEP( F1
, d
, a
, b
, c
, in
[9] + 0x8b44f7af, 12 );
218 MD5STEP( F1
, c
, d
, a
, b
, in
[10] + 0xffff5bb1, 17 );
219 MD5STEP( F1
, b
, c
, d
, a
, in
[11] + 0x895cd7be, 22 );
220 MD5STEP( F1
, a
, b
, c
, d
, in
[12] + 0x6b901122, 7 );
221 MD5STEP( F1
, d
, a
, b
, c
, in
[13] + 0xfd987193, 12 );
222 MD5STEP( F1
, c
, d
, a
, b
, in
[14] + 0xa679438e, 17 );
223 MD5STEP( F1
, b
, c
, d
, a
, in
[15] + 0x49b40821, 22 );
225 MD5STEP( F2
, a
, b
, c
, d
, in
[1] + 0xf61e2562, 5 );
226 MD5STEP( F2
, d
, a
, b
, c
, in
[6] + 0xc040b340, 9 );
227 MD5STEP( F2
, c
, d
, a
, b
, in
[11] + 0x265e5a51, 14 );
228 MD5STEP( F2
, b
, c
, d
, a
, in
[0] + 0xe9b6c7aa, 20 );
229 MD5STEP( F2
, a
, b
, c
, d
, in
[5] + 0xd62f105d, 5 );
230 MD5STEP( F2
, d
, a
, b
, c
, in
[10] + 0x02441453, 9 );
231 MD5STEP( F2
, c
, d
, a
, b
, in
[15] + 0xd8a1e681, 14 );
232 MD5STEP( F2
, b
, c
, d
, a
, in
[4] + 0xe7d3fbc8, 20 );
233 MD5STEP( F2
, a
, b
, c
, d
, in
[9] + 0x21e1cde6, 5 );
234 MD5STEP( F2
, d
, a
, b
, c
, in
[14] + 0xc33707d6, 9 );
235 MD5STEP( F2
, c
, d
, a
, b
, in
[3] + 0xf4d50d87, 14 );
236 MD5STEP( F2
, b
, c
, d
, a
, in
[8] + 0x455a14ed, 20 );
237 MD5STEP( F2
, a
, b
, c
, d
, in
[13] + 0xa9e3e905, 5 );
238 MD5STEP( F2
, d
, a
, b
, c
, in
[2] + 0xfcefa3f8, 9 );
239 MD5STEP( F2
, c
, d
, a
, b
, in
[7] + 0x676f02d9, 14 );
240 MD5STEP( F2
, b
, c
, d
, a
, in
[12] + 0x8d2a4c8a, 20 );
242 MD5STEP( F3
, a
, b
, c
, d
, in
[5] + 0xfffa3942, 4 );
243 MD5STEP( F3
, d
, a
, b
, c
, in
[8] + 0x8771f681, 11 );
244 MD5STEP( F3
, c
, d
, a
, b
, in
[11] + 0x6d9d6122, 16 );
245 MD5STEP( F3
, b
, c
, d
, a
, in
[14] + 0xfde5380c, 23 );
246 MD5STEP( F3
, a
, b
, c
, d
, in
[1] + 0xa4beea44, 4 );
247 MD5STEP( F3
, d
, a
, b
, c
, in
[4] + 0x4bdecfa9, 11 );
248 MD5STEP( F3
, c
, d
, a
, b
, in
[7] + 0xf6bb4b60, 16 );
249 MD5STEP( F3
, b
, c
, d
, a
, in
[10] + 0xbebfbc70, 23 );
250 MD5STEP( F3
, a
, b
, c
, d
, in
[13] + 0x289b7ec6, 4 );
251 MD5STEP( F3
, d
, a
, b
, c
, in
[0] + 0xeaa127fa, 11 );
252 MD5STEP( F3
, c
, d
, a
, b
, in
[3] + 0xd4ef3085, 16 );
253 MD5STEP( F3
, b
, c
, d
, a
, in
[6] + 0x04881d05, 23 );
254 MD5STEP( F3
, a
, b
, c
, d
, in
[9] + 0xd9d4d039, 4 );
255 MD5STEP( F3
, d
, a
, b
, c
, in
[12] + 0xe6db99e5, 11 );
256 MD5STEP( F3
, c
, d
, a
, b
, in
[15] + 0x1fa27cf8, 16 );
257 MD5STEP( F3
, b
, c
, d
, a
, in
[2] + 0xc4ac5665, 23 );
259 MD5STEP( F4
, a
, b
, c
, d
, in
[0] + 0xf4292244, 6 );
260 MD5STEP( F4
, d
, a
, b
, c
, in
[7] + 0x432aff97, 10 );
261 MD5STEP( F4
, c
, d
, a
, b
, in
[14] + 0xab9423a7, 15 );
262 MD5STEP( F4
, b
, c
, d
, a
, in
[5] + 0xfc93a039, 21 );
263 MD5STEP( F4
, a
, b
, c
, d
, in
[12] + 0x655b59c3, 6 );
264 MD5STEP( F4
, d
, a
, b
, c
, in
[3] + 0x8f0ccc92, 10 );
265 MD5STEP( F4
, c
, d
, a
, b
, in
[10] + 0xffeff47d, 15 );
266 MD5STEP( F4
, b
, c
, d
, a
, in
[1] + 0x85845dd1, 21 );
267 MD5STEP( F4
, a
, b
, c
, d
, in
[8] + 0x6fa87e4f, 6 );
268 MD5STEP( F4
, d
, a
, b
, c
, in
[15] + 0xfe2ce6e0, 10 );
269 MD5STEP( F4
, c
, d
, a
, b
, in
[6] + 0xa3014314, 15 );
270 MD5STEP( F4
, b
, c
, d
, a
, in
[13] + 0x4e0811a1, 21 );
271 MD5STEP( F4
, a
, b
, c
, d
, in
[4] + 0xf7537e82, 6 );
272 MD5STEP( F4
, d
, a
, b
, c
, in
[11] + 0xbd3af235, 10 );
273 MD5STEP( F4
, c
, d
, a
, b
, in
[2] + 0x2ad7d2bb, 15 );
274 MD5STEP( F4
, b
, c
, d
, a
, in
[9] + 0xeb86d391, 21 );