1 /* MD5 checksum routines used for authentication. Not covered by GPL, but
2 in the public domain as per the copyright below */
5 # include <machine/endian.h>
9 # include <sys/types.h>
10 #elif defined(SOLARIS)
11 /* each solaris is different -- this won't work on 2.6 or 2.7 */
12 # include <sys/isa_defs.h> /* Defines either _LITTLE_ENDIAN or _BIG_ENDIAN */
13 # define __BIG_ENDIAN 4321
14 # define __LITTLE_ENDIAN 1234
15 # define BIG_ENDIAN 4321
16 # define LITTLE_ENDIAN 1234
17 # ifdef _LITTLE_ENDIAN
18 # define __BYTE_ORDER __LITTLE_ENDIAN
19 # define BYTE_ORDER LITTLE_ENDIAN
21 # define __BYTE_ORDER __BIG_ENDIAN
22 # define BYTE_ORDER BIG_ENDIAN
26 #if __BYTE_ORDER == __BIG_ENDIAN || BYTE_ORDER == BIG_ENDIAN
28 #elif __BYTE_ORDER == __LITTLE_ENDIAN || BYTE_ORDER == LITLE_ENDIAN
31 # error "Please fix <bits/endian.h>"
35 * This code implements the MD5 message-digest algorithm.
36 * The algorithm is due to Ron Rivest. This code was
37 * written by Colin Plumb in 1993, no copyright is claimed.
38 * This code is in the public domain; do with it what you wish.
40 * Equivalent code is available from RSA Data Security, Inc.
41 * This code has been tested against that, and is equivalent,
42 * except that you don't need to include two pages of legalese
45 * To compute the message digest of a chunk of bytes, declare an
46 * MD5Context structure, pass it to MD5Init, call MD5Update as
47 * needed on buffers full of bytes, and then call MD5Final, which
48 * will fill a supplied 16-byte array with the digest.
50 #include <string.h> /* for memcpy() */
54 #define byteReverse(buf, len) /* Nothing */
56 void byteReverse(uint8_t *buf, unsigned int longs);
60 * Note: this code is harmless on little-endian machines.
62 void byteReverse(uint8_t *buf, unsigned int longs)
66 t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
67 ((unsigned) buf[1] << 8 | buf[0]);
68 *(uint32_t *) buf = t;
76 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
77 * initialization constants.
79 void MD5Init(struct MD5Context *ctx)
81 ctx->buf[0] = 0x67452301;
82 ctx->buf[1] = 0xefcdab89;
83 ctx->buf[2] = 0x98badcfe;
84 ctx->buf[3] = 0x10325476;
91 * Update context to reflect the concatenation of another buffer full
94 void MD5Update(struct MD5Context *ctx, uint8_t const *buf, unsigned int len)
101 if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
102 ctx->bits[1]++; /* Carry from low to high */
103 ctx->bits[1] += len >> 29;
105 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
107 /* Handle any leading odd-sized chunks */
110 uint8_t *p = (uint8_t *) ctx->in + t;
118 byteReverse(ctx->in, 16);
119 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
123 /* Process data in 64-byte chunks */
126 memcpy(ctx->in, buf, 64);
127 byteReverse(ctx->in, 16);
128 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
133 /* Handle any remaining bytes of data. */
135 memcpy(ctx->in, buf, len);
139 * Final wrapup - pad to 64-byte boundary with the bit pattern
140 * 1 0* (64-bit count of bits processed, MSB-first)
142 void MD5Final(uint8_t digest[16], struct MD5Context *ctx)
147 /* Compute number of bytes mod 64 */
148 count = (ctx->bits[0] >> 3) & 0x3F;
150 /* Set the first char of padding to 0x80. This is safe since there is
151 always at least one byte free */
155 /* Bytes of padding needed to make 64 bytes */
156 count = 64 - 1 - count;
158 /* Pad out to 56 mod 64 */
160 /* Two lots of padding: Pad the first block to 64 bytes */
162 byteReverse(ctx->in, 16);
163 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
165 /* Now fill the next block with 56 bytes */
166 memset(ctx->in, 0, 56);
168 /* Pad block to 56 bytes */
169 memset(p, 0, count - 8);
171 byteReverse(ctx->in, 14);
173 /* Append length in bits and transform */
174 ((uint32_t *) ctx->in)[14] = ctx->bits[0];
175 ((uint32_t *) ctx->in)[15] = ctx->bits[1];
177 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
178 byteReverse((uint8_t *) ctx->buf, 4);
179 memcpy(digest, ctx->buf, 16);
180 memset(ctx, 0, sizeof(*ctx)); /* In case it's sensitive */
185 /* The four core functions - F1 is optimized somewhat */
187 /* #define F1(x, y, z) (x & y | ~x & z) */
188 #define F1(x, y, z) (z ^ (x & (y ^ z)))
189 #define F2(x, y, z) F1(z, x, y)
190 #define F3(x, y, z) (x ^ y ^ z)
191 #define F4(x, y, z) (y ^ (x | ~z))
193 /* This is the central step in the MD5 algorithm. */
194 #define MD5STEP(f, w, x, y, z, data, s) \
195 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
198 * The core of the MD5 algorithm, this alters an existing MD5 hash to
199 * reflect the addition of 16 longwords of new data. MD5Update blocks
200 * the data and converts bytes into longwords for this routine.
202 void MD5Transform(uint32_t buf[4], uint32_t const in[16])
211 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
212 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
213 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
214 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
215 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
216 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
217 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
218 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
219 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
220 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
221 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
222 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
223 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
224 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
225 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
226 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
228 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
229 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
230 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
231 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
232 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
233 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
234 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
235 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
236 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
237 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
238 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
239 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
240 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
241 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
242 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
243 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
245 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
246 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
247 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
248 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
249 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
250 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
251 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
252 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
253 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
254 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
255 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
256 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
257 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
258 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
259 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
260 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
262 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
263 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
264 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
265 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
266 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
267 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
268 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
269 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
270 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
271 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
272 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
273 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
274 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
275 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
276 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
277 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);