1 /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
4 * License to copy and use this software is granted provided that it
5 * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
6 * Algorithm" in all material mentioning or referencing this software
9 * License is also granted to make and use derivative works provided
10 * that such works are identified as "derived from the RSA Data
11 * Security, Inc. MD5 Message-Digest Algorithm" in all material
12 * mentioning or referencing the derived work.
14 * RSA Data Security, Inc. makes no representations concerning either
15 * the merchantability of this software or the suitability of this
16 * software for any particular purpose. It is provided "as is"
17 * without express or implied warranty of any kind.
19 * These notices must be retained in any copies of any part of this
20 * documentation and/or software.
27 // Constants for MD5Transform routine.
28 static const int S11 = 7;
29 static const int S12 = 12;
30 static const int S13 = 17;
31 static const int S14 = 22;
32 static const int S21 = 5;
33 static const int S22 = 9;
34 static const int S23 = 14;
35 static const int S24 = 20;
36 static const int S31 = 4;
37 static const int S32 = 11;
38 static const int S33 = 16;
39 static const int S34 = 23;
40 static const int S41 = 6;
41 static const int S42 = 10;
42 static const int S43 = 15;
43 static const int S44 = 21;
45 static unsigned char PADDING[64] = {
46 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
47 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
48 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
51 // F, G, H and I are basic MD5 functions.
52 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
53 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
54 #define H(x, y, z) ((x) ^ (y) ^ (z))
55 #define I(x, y, z) ((y) ^ ((x) | (~z)))
57 // ROTATE_LEFT rotates x left n bits.
58 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
60 // FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
61 // Rotation is separate from addition to prevent recomputation.
62 #define FF(a, b, c, d, x, s, ac) { \
63 (a) += F ((b), (c), (d)) + (x) + (uint32_t)(ac); \
64 (a) = ROTATE_LEFT ((a), (s)); \
67 #define GG(a, b, c, d, x, s, ac) { \
68 (a) += G ((b), (c), (d)) + (x) + (uint32_t)(ac); \
69 (a) = ROTATE_LEFT ((a), (s)); \
72 #define HH(a, b, c, d, x, s, ac) { \
73 (a) += H ((b), (c), (d)) + (x) + (uint32_t)(ac); \
74 (a) = ROTATE_LEFT ((a), (s)); \
77 #define II(a, b, c, d, x, s, ac) { \
78 (a) += I ((b), (c), (d)) + (x) + (uint32_t)(ac); \
79 (a) = ROTATE_LEFT ((a), (s)); \
91 context.count[0] = context.count[1] = 0;
92 // Load magic initialization constants.
93 context.state[0] = 0x67452301;
94 context.state[1] = 0xefcdab89;
95 context.state[2] = 0x98badcfe;
96 context.state[3] = 0x10325476;
99 /** MD5 block update operation. Continues an MD5 message-digest
100 * operation, processing another message block, and updating the
105 MD5::Update(uint8_t const *input, size_t inputLen)
107 unsigned int i, index, partLen;
109 // Compute number of bytes mod 64
110 index = (unsigned int)((context.count[0] >> 3) & 0x3F);
112 // Update number of bits
113 if ((context.count[0] += ((uint32_t)inputLen << 3))
114 < ((uint32_t)inputLen << 3))
116 context.count[1] += ((uint32_t)inputLen >> 29);
118 partLen = 64 - index;
120 // Transform as many times as possible.
121 if (inputLen >= partLen) {
122 memcpy((void*)&context.buffer[index], (void const *)input, partLen);
123 Transform (context.state, context.buffer);
125 for (i = partLen; i + 63 < inputLen; i += 64) {
126 Transform (context.state, (uint8_t const *) &input[i]);
134 /* Buffer remaining input */
135 memcpy ((void*)&context.buffer[index], (void const *)&input[i], inputLen-i);
138 // MD5 finalization. Ends an MD5 message-digest operation, writing the
139 // the message digest and zeroizing the context.
140 // Writes to digestRaw
146 size_t index, padLen;
148 // Save number of bits
149 Encode (bits, context.count, 8);
151 // Pad out to 56 mod 64.
152 index = (size_t)((context.count[0] >> 3) & 0x3f);
153 padLen = (index < 56) ? (56 - index) : (120 - index);
154 Update (PADDING, padLen);
156 // Append length (before padding)
159 // Store state in digest
160 Encode (digestRaw, context.state, 16);
162 // Zeroize sensitive information.
163 memset((void*)&context, 0, sizeof (context));
168 /// Buffer must be 32+1 (nul) = 33 chars long at least
174 for (pos = 0; pos < 16; pos++) {
175 sprintf (digestChars+(pos*2), "%02x", digestRaw[pos]);
179 /// Load a file from disk and digest it
180 // Digests a file and returns the result.
182 MD5::digestFile (char *filename)
188 unsigned char buffer[1024];
190 if ((file = fopen (filename, "rb")) == NULL) {
191 printf ("%s can't be opened\n", filename);
193 while ((len = fread (buffer, 1, 1024, file))) {
194 Update (buffer, len);
203 /// Digests a byte-array already in memory
205 MD5::digestMemory (uint8_t const * memchunk, size_t len)
208 Update (memchunk, len);
214 // Digests a string and prints the result.
216 MD5::digestString (char const * string)
219 Update ((uint8_t const *) string, strlen (string));
226 MD5::Transform (uint32_t state[4], uint8_t const * block)
228 uint32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];
230 Decode (x, block, 64);
233 FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
234 FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
235 FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
236 FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
237 FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
238 FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
239 FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
240 FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
241 FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
242 FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
243 FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
244 FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
245 FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
246 FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
247 FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
248 FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
251 GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
252 GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
253 GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
254 GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
255 GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
256 GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
257 GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
258 GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
259 GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
260 GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
261 GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
262 GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
263 GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
264 GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
265 GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
266 GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
269 HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
270 HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
271 HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
272 HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
273 HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
274 HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
275 HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
276 HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
277 HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
278 HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
279 HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
280 HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
281 HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
282 HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
283 HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
284 HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
287 II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
288 II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
289 II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
290 II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
291 II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
292 II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
293 II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
294 II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
295 II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
296 II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
297 II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
298 II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
299 II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
300 II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
301 II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
302 II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
309 // Zeroize sensitive information.
310 memset((void*)x, 0, sizeof (x));
313 /* Encodes input (uint32_t) into output (unsigned char). Assumes len is
317 MD5::Encode (uint8_t *output, uint32_t const * input, size_t len)
321 for (i = 0, j = 0; j < len; i++, j += 4) {
322 output[j] = (unsigned char)(input[i] & 0xff);
323 output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
324 output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
325 output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
329 /** Decodes input (unsigned char) into output (uint32_t). Assumes len is
334 MD5::Decode (uint32_t *output, uint8_t const * input, size_t len)
338 for (i = 0, j = 0; j < len; i++, j += 4)
339 output[i] = ((uint32_t)input[j]) | (((uint32_t)input[j+1]) << 8) |
340 (((uint32_t)input[j+2]) << 16) | (((uint32_t)input[j+3]) << 24);