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., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, 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.
45 unsigned char digest
[16];
49 /* The four core functions - F1 is optimized somewhat */
51 /* #define F1( x, y, z ) (x & y | ~x & z) */
52 #define F1( x, y, z ) (z ^ (x & (y ^ z)))
53 #define F2( x, y, z ) F1( z, x, y )
54 #define F3( x, y, z ) (x ^ y ^ z)
55 #define F4( x, y, z ) (y ^ (x | ~z))
57 /* This is the central step in the MD5 algorithm. */
58 #define MD5STEP( f, w, x, y, z, data, s ) \
59 ( w += f( x, y, z ) + data, w = w << s | w >> (32 - s), w += x )
62 * The core of the MD5 algorithm, this alters an existing MD5 hash to
63 * reflect the addition of 16 longwords of new data. MD5Update blocks
64 * the data and converts bytes into longwords for this routine.
66 static void MD5Transform( unsigned int buf
[4], const unsigned int in
[16] )
68 register unsigned int a
, b
, c
, d
;
75 MD5STEP( F1
, a
, b
, c
, d
, in
[0] + 0xd76aa478, 7 );
76 MD5STEP( F1
, d
, a
, b
, c
, in
[1] + 0xe8c7b756, 12 );
77 MD5STEP( F1
, c
, d
, a
, b
, in
[2] + 0x242070db, 17 );
78 MD5STEP( F1
, b
, c
, d
, a
, in
[3] + 0xc1bdceee, 22 );
79 MD5STEP( F1
, a
, b
, c
, d
, in
[4] + 0xf57c0faf, 7 );
80 MD5STEP( F1
, d
, a
, b
, c
, in
[5] + 0x4787c62a, 12 );
81 MD5STEP( F1
, c
, d
, a
, b
, in
[6] + 0xa8304613, 17 );
82 MD5STEP( F1
, b
, c
, d
, a
, in
[7] + 0xfd469501, 22 );
83 MD5STEP( F1
, a
, b
, c
, d
, in
[8] + 0x698098d8, 7 );
84 MD5STEP( F1
, d
, a
, b
, c
, in
[9] + 0x8b44f7af, 12 );
85 MD5STEP( F1
, c
, d
, a
, b
, in
[10] + 0xffff5bb1, 17 );
86 MD5STEP( F1
, b
, c
, d
, a
, in
[11] + 0x895cd7be, 22 );
87 MD5STEP( F1
, a
, b
, c
, d
, in
[12] + 0x6b901122, 7 );
88 MD5STEP( F1
, d
, a
, b
, c
, in
[13] + 0xfd987193, 12 );
89 MD5STEP( F1
, c
, d
, a
, b
, in
[14] + 0xa679438e, 17 );
90 MD5STEP( F1
, b
, c
, d
, a
, in
[15] + 0x49b40821, 22 );
92 MD5STEP( F2
, a
, b
, c
, d
, in
[1] + 0xf61e2562, 5 );
93 MD5STEP( F2
, d
, a
, b
, c
, in
[6] + 0xc040b340, 9 );
94 MD5STEP( F2
, c
, d
, a
, b
, in
[11] + 0x265e5a51, 14 );
95 MD5STEP( F2
, b
, c
, d
, a
, in
[0] + 0xe9b6c7aa, 20 );
96 MD5STEP( F2
, a
, b
, c
, d
, in
[5] + 0xd62f105d, 5 );
97 MD5STEP( F2
, d
, a
, b
, c
, in
[10] + 0x02441453, 9 );
98 MD5STEP( F2
, c
, d
, a
, b
, in
[15] + 0xd8a1e681, 14 );
99 MD5STEP( F2
, b
, c
, d
, a
, in
[4] + 0xe7d3fbc8, 20 );
100 MD5STEP( F2
, a
, b
, c
, d
, in
[9] + 0x21e1cde6, 5 );
101 MD5STEP( F2
, d
, a
, b
, c
, in
[14] + 0xc33707d6, 9 );
102 MD5STEP( F2
, c
, d
, a
, b
, in
[3] + 0xf4d50d87, 14 );
103 MD5STEP( F2
, b
, c
, d
, a
, in
[8] + 0x455a14ed, 20 );
104 MD5STEP( F2
, a
, b
, c
, d
, in
[13] + 0xa9e3e905, 5 );
105 MD5STEP( F2
, d
, a
, b
, c
, in
[2] + 0xfcefa3f8, 9 );
106 MD5STEP( F2
, c
, d
, a
, b
, in
[7] + 0x676f02d9, 14 );
107 MD5STEP( F2
, b
, c
, d
, a
, in
[12] + 0x8d2a4c8a, 20 );
109 MD5STEP( F3
, a
, b
, c
, d
, in
[5] + 0xfffa3942, 4 );
110 MD5STEP( F3
, d
, a
, b
, c
, in
[8] + 0x8771f681, 11 );
111 MD5STEP( F3
, c
, d
, a
, b
, in
[11] + 0x6d9d6122, 16 );
112 MD5STEP( F3
, b
, c
, d
, a
, in
[14] + 0xfde5380c, 23 );
113 MD5STEP( F3
, a
, b
, c
, d
, in
[1] + 0xa4beea44, 4 );
114 MD5STEP( F3
, d
, a
, b
, c
, in
[4] + 0x4bdecfa9, 11 );
115 MD5STEP( F3
, c
, d
, a
, b
, in
[7] + 0xf6bb4b60, 16 );
116 MD5STEP( F3
, b
, c
, d
, a
, in
[10] + 0xbebfbc70, 23 );
117 MD5STEP( F3
, a
, b
, c
, d
, in
[13] + 0x289b7ec6, 4 );
118 MD5STEP( F3
, d
, a
, b
, c
, in
[0] + 0xeaa127fa, 11 );
119 MD5STEP( F3
, c
, d
, a
, b
, in
[3] + 0xd4ef3085, 16 );
120 MD5STEP( F3
, b
, c
, d
, a
, in
[6] + 0x04881d05, 23 );
121 MD5STEP( F3
, a
, b
, c
, d
, in
[9] + 0xd9d4d039, 4 );
122 MD5STEP( F3
, d
, a
, b
, c
, in
[12] + 0xe6db99e5, 11 );
123 MD5STEP( F3
, c
, d
, a
, b
, in
[15] + 0x1fa27cf8, 16 );
124 MD5STEP( F3
, b
, c
, d
, a
, in
[2] + 0xc4ac5665, 23 );
126 MD5STEP( F4
, a
, b
, c
, d
, in
[0] + 0xf4292244, 6 );
127 MD5STEP( F4
, d
, a
, b
, c
, in
[7] + 0x432aff97, 10 );
128 MD5STEP( F4
, c
, d
, a
, b
, in
[14] + 0xab9423a7, 15 );
129 MD5STEP( F4
, b
, c
, d
, a
, in
[5] + 0xfc93a039, 21 );
130 MD5STEP( F4
, a
, b
, c
, d
, in
[12] + 0x655b59c3, 6 );
131 MD5STEP( F4
, d
, a
, b
, c
, in
[3] + 0x8f0ccc92, 10 );
132 MD5STEP( F4
, c
, d
, a
, b
, in
[10] + 0xffeff47d, 15 );
133 MD5STEP( F4
, b
, c
, d
, a
, in
[1] + 0x85845dd1, 21 );
134 MD5STEP( F4
, a
, b
, c
, d
, in
[8] + 0x6fa87e4f, 6 );
135 MD5STEP( F4
, d
, a
, b
, c
, in
[15] + 0xfe2ce6e0, 10 );
136 MD5STEP( F4
, c
, d
, a
, b
, in
[6] + 0xa3014314, 15 );
137 MD5STEP( F4
, b
, c
, d
, a
, in
[13] + 0x4e0811a1, 21 );
138 MD5STEP( F4
, a
, b
, c
, d
, in
[4] + 0xf7537e82, 6 );
139 MD5STEP( F4
, d
, a
, b
, c
, in
[11] + 0xbd3af235, 10 );
140 MD5STEP( F4
, c
, d
, a
, b
, in
[2] + 0x2ad7d2bb, 15 );
141 MD5STEP( F4
, b
, c
, d
, a
, in
[9] + 0xeb86d391, 21 );
150 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
151 * initialization constants.
153 VOID WINAPI
MD5Init( MD5_CTX
*ctx
)
155 ctx
->buf
[0] = 0x67452301;
156 ctx
->buf
[1] = 0xefcdab89;
157 ctx
->buf
[2] = 0x98badcfe;
158 ctx
->buf
[3] = 0x10325476;
160 ctx
->i
[0] = ctx
->i
[1] = 0;
164 * Update context to reflect the concatenation of another buffer full
167 VOID WINAPI
MD5Update( MD5_CTX
*ctx
, const unsigned char *buf
, unsigned int len
)
169 register unsigned int t
;
171 /* Update bitcount */
174 if ((ctx
->i
[0] = t
+ (len
<< 3)) < t
)
175 ctx
->i
[1]++; /* Carry from low to high */
177 ctx
->i
[1] += len
>> 29;
180 /* Handle any leading odd-sized chunks */
183 unsigned char *p
= (unsigned char *)ctx
->in
+ t
;
188 memcpy( p
, buf
, len
);
193 byteReverse( ctx
->in
, 16 );
195 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
201 /* Process data in 64-byte chunks */
204 memcpy( ctx
->in
, buf
, 64 );
205 byteReverse( ctx
->in
, 16 );
207 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
213 /* Handle any remaining bytes of data. */
214 memcpy( ctx
->in
, buf
, len
);
218 * Final wrapup - pad to 64-byte boundary with the bit pattern
219 * 1 0* (64-bit count of bits processed, MSB-first)
221 VOID WINAPI
MD5Final( MD5_CTX
*ctx
)
226 /* Compute number of bytes mod 64 */
227 count
= (ctx
->i
[0] >> 3) & 0x3F;
229 /* Set the first char of padding to 0x80. This is safe since there is
230 always at least one byte free */
234 /* Bytes of padding needed to make 64 bytes */
235 count
= 64 - 1 - count
;
237 /* Pad out to 56 mod 64 */
240 /* Two lots of padding: Pad the first block to 64 bytes */
241 memset( p
, 0, count
);
242 byteReverse( ctx
->in
, 16 );
243 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
245 /* Now fill the next block with 56 bytes */
246 memset( ctx
->in
, 0, 56 );
250 /* Pad block to 56 bytes */
251 memset( p
, 0, count
- 8 );
254 byteReverse( ctx
->in
, 14 );
256 /* Append length in bits and transform */
257 ((unsigned int *)ctx
->in
)[14] = ctx
->i
[0];
258 ((unsigned int *)ctx
->in
)[15] = ctx
->i
[1];
260 MD5Transform( ctx
->buf
, (unsigned int *)ctx
->in
);
261 byteReverse( (unsigned char *)ctx
->buf
, 4 );
262 memcpy( ctx
->digest
, ctx
->buf
, 16 );