2 * MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm
4 * Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
7 * License to copy and use this software is granted provided that it
8 * is identified as the "RSA Data Security, Inc. MD5 Message-Digest
9 * Algorithm" in all material mentioning or referencing this software
12 * License is also granted to make and use derivative works provided
13 * that such works are identified as "derived from the RSA Data
14 * Security, Inc. MD5 Message-Digest Algorithm" in all material
15 * mentioning or referencing the derived work.
17 * RSA Data Security, Inc. makes no representations concerning either
18 * the merchantability of this software or the suitability of this
19 * software for any particular purpose. It is provided "as is"
20 * without express or implied warranty of any kind.
22 * These notices must be retained in any copies of any part of this
23 * documentation and/or software.
25 * This code is the same as the code published by RSA Inc. It has been
26 * edited for clarity and style only.
29 #include <sys/types.h>
34 static void MD5Transform(unsigned int [4], const unsigned char [64]);
36 #if (BYTE_ORDER == LITTLE_ENDIAN)
42 * Encodes input (unsigned int) into output (unsigned char). Assumes len is
47 Encode (unsigned char *output, unsigned int *input, unsigned int len)
50 unsigned int *op = (unsigned int *)output;
52 for (i = 0; i < len / 4; i++)
53 op[i] = htole32(input[i]);
57 * Decodes input (unsigned char) into output (unsigned int). Assumes len is
62 Decode (unsigned int *output, const unsigned char *input, unsigned int len)
65 const unsigned int *ip = (const unsigned int *)input;
67 for (i = 0; i < len / 4; i++)
68 output[i] = le32toh(ip[i]);
72 static unsigned char PADDING[64] = {
73 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
74 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
75 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
78 /* F, G, H and I are basic MD5 functions. */
79 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
80 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
81 #define H(x, y, z) ((x) ^ (y) ^ (z))
82 #define I(x, y, z) ((y) ^ ((x) | (~z)))
84 /* ROTATE_LEFT rotates x left n bits. */
85 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
88 * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
89 * Rotation is separate from addition to prevent recomputation.
91 #define FF(a, b, c, d, x, s, ac) { \
92 (a) += F ((b), (c), (d)) + (x) + (unsigned int)(ac); \
93 (a) = ROTATE_LEFT ((a), (s)); \
96 #define GG(a, b, c, d, x, s, ac) { \
97 (a) += G ((b), (c), (d)) + (x) + (unsigned int)(ac); \
98 (a) = ROTATE_LEFT ((a), (s)); \
101 #define HH(a, b, c, d, x, s, ac) { \
102 (a) += H ((b), (c), (d)) + (x) + (unsigned int)(ac); \
103 (a) = ROTATE_LEFT ((a), (s)); \
106 #define II(a, b, c, d, x, s, ac) { \
107 (a) += I ((b), (c), (d)) + (x) + (unsigned int)(ac); \
108 (a) = ROTATE_LEFT ((a), (s)); \
112 /* MD5 initialization. Begins an MD5 operation, writing a new context. */
119 context->count[0] = context->count[1] = 0;
121 /* Load magic initialization constants. */
122 context->state[0] = 0x67452301;
123 context->state[1] = 0xefcdab89;
124 context->state[2] = 0x98badcfe;
125 context->state[3] = 0x10325476;
129 * MD5 block update operation. Continues an MD5 message-digest
130 * operation, processing another message block, and updating the
135 MD5Update (context, in, inputLen)
138 unsigned int inputLen;
140 unsigned int i, idx, partLen;
141 const unsigned char *input = in;
143 /* Compute number of bytes mod 64 */
144 idx = (unsigned int)((context->count[0] >> 3) & 0x3F);
146 /* Update number of bits */
147 if ((context->count[0] += ((unsigned int)inputLen << 3))
148 < ((unsigned int)inputLen << 3))
150 context->count[1] += ((unsigned int)inputLen >> 29);
154 /* Transform as many times as possible. */
155 if (inputLen >= partLen) {
156 memcpy((void *)&context->buffer[idx], (const void *)input,
158 MD5Transform (context->state, context->buffer);
160 for (i = partLen; i + 63 < inputLen; i += 64)
161 MD5Transform (context->state, &input[i]);
168 /* Buffer remaining input */
169 memcpy ((void *)&context->buffer[idx], (const void *)&input[i],
174 * MD5 padding. Adds padding followed by original length.
181 unsigned char bits[8];
182 unsigned int idx, padLen;
184 /* Save number of bits */
185 Encode (bits, context->count, 8);
187 /* Pad out to 56 mod 64. */
188 idx = (unsigned int)((context->count[0] >> 3) & 0x3f);
189 padLen = (idx < 56) ? (56 - idx) : (120 - idx);
190 MD5Update (context, PADDING, padLen);
192 /* Append length (before padding) */
193 MD5Update (context, bits, 8);
197 * MD5 finalization. Ends an MD5 message-digest operation, writing the
198 * the message digest and zeroizing the context.
202 MD5Final (digest, context)
203 unsigned char digest[16];
209 /* Store state in digest */
210 Encode (digest, context->state, 16);
212 /* Zeroize sensitive information. */
213 memset ((void *)context, 0, sizeof (*context));
216 /* MD5 basic transformation. Transforms state based on block. */
219 MD5Transform (state, block)
220 unsigned int state[4];
221 const unsigned char block[64];
223 unsigned int a = state[0], b = state[1], c = state[2], d = state[3], x[16];
225 Decode (x, block, 64);
232 FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
233 FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
234 FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
235 FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
236 FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
237 FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
238 FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
239 FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
240 FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
241 FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
242 FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
243 FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
244 FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
245 FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
246 FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
247 FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
254 GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
255 GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
256 GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
257 GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
258 GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
259 GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
260 GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
261 GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
262 GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
263 GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
264 GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
265 GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
266 GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
267 GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
268 GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
269 GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
276 HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
277 HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
278 HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
279 HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
280 HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
281 HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
282 HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
283 HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
284 HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
285 HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
286 HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
287 HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
288 HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
289 HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
290 HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
291 HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
298 II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
299 II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
300 II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
301 II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
302 II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
303 II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
304 II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
305 II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
306 II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
307 II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
308 II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
309 II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
310 II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
311 II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
312 II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
313 II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
320 /* Zeroize sensitive information. */
321 memset ((void *)x, 0, sizeof (x));