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/cdefs.h>
30 #include <sys/types.h>
34 static void MD5Transform( u_int32_t[4], const unsigned char[64]);
36 #if (BYTE_ORDER == LITTLE_ENDIAN)
42 * Encodes input (u_int32_t) into output (unsigned char). Assumes len is
46 static void Encode (unsigned char *output, u_int32_t *input, unsigned int len) {
48 u_int32_t *op = (u_int32_t *)output;
50 for (i = 0; i < len / 4; i++)
51 op[i] = htole32(input[i]);
55 * Decodes input (unsigned char) into output (u_int32_t). Assumes len is
59 static void Decode (u_int32_t *output, const unsigned char *input, unsigned int len) {
61 const u_int32_t *ip = (const u_int32_t *)input;
63 for (i = 0; i < len / 4; i++)
64 output[i] = le32toh(ip[i]);
68 static unsigned char PADDING[64] = { 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
69 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
70 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
73 /* F, G, H and I are basic MD5 functions. */
74 #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
75 #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
76 #define H(x, y, z) ((x) ^ (y) ^ (z))
77 #define I(x, y, z) ((y) ^ ((x) | (~z)))
79 /* ROTATE_LEFT rotates x left n bits. */
80 #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
83 * FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
84 * Rotation is separate from addition to prevent recomputation.
86 #define FF(a, b, c, d, x, s, ac) { \
87 (a) += F ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
88 (a) = ROTATE_LEFT ((a), (s)); \
91 #define GG(a, b, c, d, x, s, ac) { \
92 (a) += G ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
93 (a) = ROTATE_LEFT ((a), (s)); \
96 #define HH(a, b, c, d, x, s, ac) { \
97 (a) += H ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
98 (a) = ROTATE_LEFT ((a), (s)); \
101 #define II(a, b, c, d, x, s, ac) { \
102 (a) += I ((b), (c), (d)) + (x) + (u_int32_t)(ac); \
103 (a) = ROTATE_LEFT ((a), (s)); \
107 /* MD5 initialization. Begins an MD5 operation, writing a new context. */
109 void MD5Init(MD5_CTX *context) {
111 context->count[0] = context->count[1] = 0;
113 /* Load magic initialization constants. */
114 context->state[0] = 0x67452301;
115 context->state[1] = 0xefcdab89;
116 context->state[2] = 0x98badcfe;
117 context->state[3] = 0x10325476;
121 * MD5 block update operation. Continues an MD5 message-digest
122 * operation, processing another message block, and updating the
126 void MD5Update(MD5_CTX *context, const unsigned char *input,
127 unsigned int inputLen) {
128 unsigned int i, idx, partLen;
130 /* Compute number of bytes mod 64 */
131 idx = (unsigned int) ((context->count[0] >> 3) & 0x3F);
133 /* Update number of bits */
134 if ((context->count[0] += ((u_int32_t) inputLen << 3))
135 < ((u_int32_t) inputLen << 3))
137 context->count[1] += ((u_int32_t) inputLen >> 29);
141 /* Transform as many times as possible. */
142 if (inputLen >= partLen) {
143 memcpy((void *) &context->buffer[idx], (const void *) input, partLen);
144 MD5Transform(context->state, context->buffer);
146 for (i = partLen; i + 63 < inputLen; i += 64)
147 MD5Transform(context->state, &input[i]);
153 /* Buffer remaining input */
154 memcpy((void *) &context->buffer[idx], (const void *) &input[i],
159 * MD5 padding. Adds padding followed by original length.
162 static void MD5Pad(MD5_CTX *context) {
163 unsigned char bits[8];
164 unsigned int idx, padLen;
166 /* Save number of bits */
167 Encode(bits, context->count, 8);
169 /* Pad out to 56 mod 64. */
170 idx = (unsigned int) ((context->count[0] >> 3) & 0x3f);
171 padLen = (idx < 56) ? (56 - idx) : (120 - idx);
172 MD5Update(context, PADDING, padLen);
174 /* Append length (before padding) */
175 MD5Update(context, bits, 8);
179 * MD5 finalization. Ends an MD5 message-digest operation, writing the
180 * the message digest and zeroizing the context.
183 void MD5Final(unsigned char digest[16], MD5_CTX *context) {
187 /* Store state in digest */
188 Encode(digest, context->state, 16);
190 /* Zeroize sensitive information. */
191 memset((void *) context, 0, sizeof(*context));
194 /* MD5 basic transformation. Transforms state based on block. */
196 static void MD5Transform(u_int32_t state[4], const unsigned char block[64]) {
197 u_int32_t a = state[0], b = state[1], c = state[2], d = state[3], x[16];
199 Decode(x, block, 64);
206 FF(a, b, c, d, x[0], S11, 0xd76aa478); /* 1 */
207 FF(d, a, b, c, x[1], S12, 0xe8c7b756); /* 2 */
208 FF(c, d, a, b, x[2], S13, 0x242070db); /* 3 */
209 FF(b, c, d, a, x[3], S14, 0xc1bdceee); /* 4 */
210 FF(a, b, c, d, x[4], S11, 0xf57c0faf); /* 5 */
211 FF(d, a, b, c, x[5], S12, 0x4787c62a); /* 6 */
212 FF(c, d, a, b, x[6], S13, 0xa8304613); /* 7 */
213 FF(b, c, d, a, x[7], S14, 0xfd469501); /* 8 */
214 FF(a, b, c, d, x[8], S11, 0x698098d8); /* 9 */
215 FF(d, a, b, c, x[9], S12, 0x8b44f7af); /* 10 */
216 FF(c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
217 FF(b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
218 FF(a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
219 FF(d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
220 FF(c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
221 FF(b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
228 GG(a, b, c, d, x[1], S21, 0xf61e2562); /* 17 */
229 GG(d, a, b, c, x[6], S22, 0xc040b340); /* 18 */
230 GG(c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
231 GG(b, c, d, a, x[0], S24, 0xe9b6c7aa); /* 20 */
232 GG(a, b, c, d, x[5], S21, 0xd62f105d); /* 21 */
233 GG(d, a, b, c, x[10], S22, 0x2441453); /* 22 */
234 GG(c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
235 GG(b, c, d, a, x[4], S24, 0xe7d3fbc8); /* 24 */
236 GG(a, b, c, d, x[9], S21, 0x21e1cde6); /* 25 */
237 GG(d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
238 GG(c, d, a, b, x[3], S23, 0xf4d50d87); /* 27 */
239 GG(b, c, d, a, x[8], S24, 0x455a14ed); /* 28 */
240 GG(a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
241 GG(d, a, b, c, x[2], S22, 0xfcefa3f8); /* 30 */
242 GG(c, d, a, b, x[7], S23, 0x676f02d9); /* 31 */
243 GG(b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
250 HH(a, b, c, d, x[5], S31, 0xfffa3942); /* 33 */
251 HH(d, a, b, c, x[8], S32, 0x8771f681); /* 34 */
252 HH(c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
253 HH(b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
254 HH(a, b, c, d, x[1], S31, 0xa4beea44); /* 37 */
255 HH(d, a, b, c, x[4], S32, 0x4bdecfa9); /* 38 */
256 HH(c, d, a, b, x[7], S33, 0xf6bb4b60); /* 39 */
257 HH(b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
258 HH(a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
259 HH(d, a, b, c, x[0], S32, 0xeaa127fa); /* 42 */
260 HH(c, d, a, b, x[3], S33, 0xd4ef3085); /* 43 */
261 HH(b, c, d, a, x[6], S34, 0x4881d05); /* 44 */
262 HH(a, b, c, d, x[9], S31, 0xd9d4d039); /* 45 */
263 HH(d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
264 HH(c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
265 HH(b, c, d, a, x[2], S34, 0xc4ac5665); /* 48 */
272 II(a, b, c, d, x[0], S41, 0xf4292244); /* 49 */
273 II(d, a, b, c, x[7], S42, 0x432aff97); /* 50 */
274 II(c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
275 II(b, c, d, a, x[5], S44, 0xfc93a039); /* 52 */
276 II(a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
277 II(d, a, b, c, x[3], S42, 0x8f0ccc92); /* 54 */
278 II(c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
279 II(b, c, d, a, x[1], S44, 0x85845dd1); /* 56 */
280 II(a, b, c, d, x[8], S41, 0x6fa87e4f); /* 57 */
281 II(d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
282 II(c, d, a, b, x[6], S43, 0xa3014314); /* 59 */
283 II(b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
284 II(a, b, c, d, x[4], S41, 0xf7537e82); /* 61 */
285 II(d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
286 II(c, d, a, b, x[2], S43, 0x2ad7d2bb); /* 63 */
287 II(b, c, d, a, x[9], S44, 0xeb86d391); /* 64 */
294 /* Zeroize sensitive information. */
295 memset((void *) x, 0, sizeof(x));