2 * Modified by Kurt D. Zeilenga for inclusion into OpenLDAP
3 * I hereby disclaim copyright in any changes I have made; this
4 * code remains in the public domain.
8 * This code implements the MD5 message-digest algorithm.
9 * The algorithm is due to Ron Rivest. This code was
10 * written by Colin Plumb in 1993, no copyright is claimed.
11 * This code is in the public domain; do with it what you wish.
13 * Equivalent code is available from RSA Data Security, Inc.
14 * This code has been tested against that, and is equivalent,
15 * except that you don't need to include two pages of legalese
18 * To compute the message digest of a chunk of bytes, declare an
19 * MD5Context structure, pass it to MD5Init, call MD5Update as
20 * needed on buffers full of bytes, and then call MD5Final, which
21 * will fill a supplied 16-byte array with the digest.
24 /* This code was modified in 1997 by Jim Kingdon of Cyclic Software to
25 not require an integer type which is exactly 32 bits. This work
26 draws on the changes for the same purpose by Tatu Ylonen
27 <ylo@cs.hut.fi> as part of SSH, but since I didn't actually use
28 that code, there is no copyright issue. I hereby disclaim
29 copyright in any changes I have made; this code remains in the
34 #include <ac/string.h>
36 /* include socket.h to get sys/types.h and/or winsock2.h */
37 #include <ac/socket.h>
39 #include <lutil_md5.h>
41 /* Little-endian byte-swapping routines. Note that these do not
42 depend on the size of datatypes such as uint32, nor do they require
43 us to detect the endianness of the machine we are running on. It
44 is possible they should be macros for speed, but I would be
45 surprised if they were a performance bottleneck for MD5. */
48 getu32( const unsigned char *addr )
50 return (((((unsigned long)addr[3] << 8) | addr[2]) << 8)
51 | addr[1]) << 8 | addr[0];
55 putu32( uint32 data, unsigned char *addr )
57 addr[0] = (unsigned char)data;
58 addr[1] = (unsigned char)(data >> 8);
59 addr[2] = (unsigned char)(data >> 16);
60 addr[3] = (unsigned char)(data >> 24);
64 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
65 * initialization constants.
68 lutil_MD5Init( struct lutil_MD5Context *ctx )
70 ctx->buf[0] = 0x67452301;
71 ctx->buf[1] = 0xefcdab89;
72 ctx->buf[2] = 0x98badcfe;
73 ctx->buf[3] = 0x10325476;
80 * Update context to reflect the concatenation of another buffer full
85 struct lutil_MD5Context *ctx,
86 const unsigned char *buf,
95 if ((ctx->bits[0] = (t + ((uint32)len << 3)) & 0xffffffff) < t)
96 ctx->bits[1]++; /* Carry from low to high */
97 ctx->bits[1] += len >> 29;
99 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
101 /* Handle any leading odd-sized chunks */
104 unsigned char *p = ctx->in + t;
112 lutil_MD5Transform(ctx->buf, ctx->in);
117 /* Process data in 64-byte chunks */
120 memcpy(ctx->in, buf, 64);
121 lutil_MD5Transform(ctx->buf, ctx->in);
126 /* Handle any remaining bytes of data. */
128 memcpy(ctx->in, buf, len);
132 * Final wrapup - pad to 64-byte boundary with the bit pattern
133 * 1 0* (64-bit count of bits processed, MSB-first)
136 lutil_MD5Final( unsigned char *digest, struct lutil_MD5Context *ctx )
141 /* Compute number of bytes mod 64 */
142 count = (ctx->bits[0] >> 3) & 0x3F;
144 /* Set the first char of padding to 0x80. This is safe since there is
145 always at least one byte free */
149 /* Bytes of padding needed to make 64 bytes */
150 count = 64 - 1 - count;
152 /* Pad out to 56 mod 64 */
154 /* Two lots of padding: Pad the first block to 64 bytes */
156 lutil_MD5Transform(ctx->buf, ctx->in);
158 /* Now fill the next block with 56 bytes */
159 memset(ctx->in, 0, 56);
161 /* Pad block to 56 bytes */
162 memset(p, 0, count-8);
165 /* Append length in bits and transform */
166 putu32(ctx->bits[0], ctx->in + 56);
167 putu32(ctx->bits[1], ctx->in + 60);
169 lutil_MD5Transform(ctx->buf, ctx->in);
170 putu32(ctx->buf[0], digest);
171 putu32(ctx->buf[1], digest + 4);
172 putu32(ctx->buf[2], digest + 8);
173 putu32(ctx->buf[3], digest + 12);
174 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
179 /* The four core functions - F1 is optimized somewhat */
181 /* #define F1(x, y, z) (x & y | ~x & z) */
182 #define F1(x, y, z) (z ^ (x & (y ^ z)))
183 #define F2(x, y, z) F1(z, x, y)
184 #define F3(x, y, z) (x ^ y ^ z)
185 #define F4(x, y, z) (y ^ (x | ~z))
187 /* This is the central step in the MD5 algorithm. */
188 #define MD5STEP(f, w, x, y, z, data, s) \
189 ( w += f(x, y, z) + data, w &= 0xffffffff, w = w<<s | w>>(32-s), w += x )
192 * The core of the MD5 algorithm, this alters an existing MD5 hash to
193 * reflect the addition of 16 longwords of new data. MD5Update blocks
194 * the data and converts bytes into longwords for this routine.
197 lutil_MD5Transform( uint32 *buf, const unsigned char *inraw )
199 register uint32 a, b, c, d;
203 for (i = 0; i < 16; ++i)
204 in[i] = getu32 (inraw + 4 * i);
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);
287 /* Simple test program. Can use it to manually run the tests from
288 RFC1321 for example. */
292 main (int argc, char **argv )
294 struct lutil_MD5Context context;
295 unsigned char checksum[16];
301 fprintf (stderr, "usage: %s string-to-hash\n", argv[0]);
304 for (j = 1; j < argc; ++j)
306 printf ("MD5 (\"%s\") = ", argv[j]);
307 lutil_MD5Init (&context);
308 lutil_MD5Update (&context, argv[j], strlen (argv[j]));
309 lutil_MD5Final (checksum, &context);
310 for (i = 0; i < 16; i++)
312 printf ("%02x", (unsigned int) checksum[i]);