2 * This code implements the MD5 message-digest algorithm.
3 * The algorithm is due to Ron Rivest. This code was
4 * written by Colin Plumb in 1993, no copyright is claimed.
5 * This code is in the public domain; do with it what you wish.
7 * Equivalent code is available from RSA Data Security, Inc.
8 * This code has been tested against that, and is equivalent,
9 * except that you don't need to include two pages of legalese
12 * To compute the message digest of a chunk of bytes, declare an
13 * MD5Context structure, pass it to MD5Init, call MD5Update as
14 * needed on buffers full of bytes, and then call MD5Final, which
15 * will fill a supplied 16-byte array with the digest.
18 #include "textclient.h"
21 #define byteReverse(buf, len) /* Nothing */
23 void byteReverse(unsigned char *buf, unsigned longs);
27 * Note: this code is harmless on little-endian machines.
29 void byteReverse(unsigned char *buf, unsigned longs)
33 t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 | ((unsigned) buf[1] << 8 | buf[0]);
34 *(uint32_t *) buf = t;
44 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
45 * initialization constants.
47 void MD5Init(struct MD5Context *ctx)
49 ctx->buf[0] = 0x67452301;
50 ctx->buf[1] = 0xefcdab89;
51 ctx->buf[2] = 0x98badcfe;
52 ctx->buf[3] = 0x10325476;
59 * Update context to reflect the concatenation of another buffer full
62 void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
69 if ((ctx->bits[0] = t + ((uint32_t) len << 3)) < t)
70 ctx->bits[1]++; /* Carry from low to high */
71 ctx->bits[1] += len >> 29;
73 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
75 /* Handle any leading odd-sized chunks */
78 unsigned char *p = (unsigned char *) ctx->in + t;
86 byteReverse(ctx->in, 16);
87 MD5Transform(ctx->buf, ctx->in);
91 /* Process data in 64-byte chunks */
94 memcpy(ctx->in, buf, 64);
95 byteReverse(ctx->in, 16);
96 MD5Transform(ctx->buf, ctx->in);
101 /* Handle any remaining bytes of data. */
103 memcpy(ctx->in, buf, len);
107 * Final wrapup - pad to 64-byte boundary with the bit pattern
108 * 1 0* (64-bit count of bits processed, MSB-first)
110 void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
115 /* Compute number of bytes mod 64 */
116 count = (ctx->bits[0] >> 3) & 0x3F;
118 /* Set the first char of padding to 0x80. This is safe since there is
119 always at least one byte free */
120 p = ((unsigned char *) ctx->in) + count;
123 /* Bytes of padding needed to make 64 bytes */
124 count = 64 - 1 - count;
126 /* Pad out to 56 mod 64 */
128 /* Two lots of padding: Pad the first block to 64 bytes */
130 byteReverse(ctx->in, 16);
131 MD5Transform(ctx->buf, ctx->in);
133 /* Now fill the next block with 56 bytes */
134 memset(ctx->in, 0, 56);
136 /* Pad block to 56 bytes */
137 memset(p, 0, count - 8);
139 byteReverse(ctx->in, 14);
141 /* Append length in bits and transform */
142 ((uint32_t *) ctx->in)[14] = ctx->bits[0];
143 ((uint32_t *) ctx->in)[15] = ctx->bits[1];
145 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
146 byteReverse((unsigned char *) ctx->buf, 4);
147 memcpy(digest, ctx->buf, 16);
148 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
153 /* The four core functions - F1 is optimized somewhat */
155 /* #define F1(x, y, z) (x & y | ~x & z) */
156 #define F1(x, y, z) (z ^ (x & (y ^ z)))
157 #define F2(x, y, z) F1(z, x, y)
158 #define F3(x, y, z) (x ^ y ^ z)
159 #define F4(x, y, z) (y ^ (x | ~z))
161 /* This is the central step in the MD5 algorithm. */
163 #define MD5STEP(f, w, x, y, z, data, s) \
164 ( w += f /*(x, y, z)*/ + data, w = w<<s | w>>(32-s), w += x )
166 #define MD5STEP(f, w, x, y, z, data, s) \
167 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
171 * The core of the MD5 algorithm, this alters an existing MD5 hash to
172 * reflect the addition of 16 longwords of new data. MD5Update blocks
173 * the data and converts bytes into longwords for this routine.
175 void MD5Transform(uint32_t buf[4], uint32_t const in[16])
177 register uint32_t a, b, c, d;
184 #ifdef __PUREC__ /* PureC Weirdness... (GG) */
185 MD5STEP(F1(b, c, d), a, b, c, d, in[0] + 0xd76aa478L, 7);
186 MD5STEP(F1(a, b, c), d, a, b, c, in[1] + 0xe8c7b756L, 12);
187 MD5STEP(F1(d, a, b), c, d, a, b, in[2] + 0x242070dbL, 17);
188 MD5STEP(F1(c, d, a), b, c, d, a, in[3] + 0xc1bdceeeL, 22);
189 MD5STEP(F1(b, c, d), a, b, c, d, in[4] + 0xf57c0fafL, 7);
190 MD5STEP(F1(a, b, c), d, a, b, c, in[5] + 0x4787c62aL, 12);
191 MD5STEP(F1(d, a, b), c, d, a, b, in[6] + 0xa8304613L, 17);
192 MD5STEP(F1(c, d, a), b, c, d, a, in[7] + 0xfd469501L, 22);
193 MD5STEP(F1(b, c, d), a, b, c, d, in[8] + 0x698098d8L, 7);
194 MD5STEP(F1(a, b, c), d, a, b, c, in[9] + 0x8b44f7afL, 12);
195 MD5STEP(F1(d, a, b), c, d, a, b, in[10] + 0xffff5bb1L, 17);
196 MD5STEP(F1(c, d, a), b, c, d, a, in[11] + 0x895cd7beL, 22);
197 MD5STEP(F1(b, c, d), a, b, c, d, in[12] + 0x6b901122L, 7);
198 MD5STEP(F1(a, b, c), d, a, b, c, in[13] + 0xfd987193L, 12);
199 MD5STEP(F1(d, a, b), c, d, a, b, in[14] + 0xa679438eL, 17);
200 MD5STEP(F1(c, d, a), b, c, d, a, in[15] + 0x49b40821L, 22);
202 MD5STEP(F2(b, c, d), a, b, c, d, in[1] + 0xf61e2562L, 5);
203 MD5STEP(F2(a, b, c), d, a, b, c, in[6] + 0xc040b340L, 9);
204 MD5STEP(F2(d, a, b), c, d, a, b, in[11] + 0x265e5a51L, 14);
205 MD5STEP(F2(c, d, a), b, c, d, a, in[0] + 0xe9b6c7aaL, 20);
206 MD5STEP(F2(b, c, d), a, b, c, d, in[5] + 0xd62f105dL, 5);
207 MD5STEP(F2(a, b, c), d, a, b, c, in[10] + 0x02441453L, 9);
208 MD5STEP(F2(d, a, b), c, d, a, b, in[15] + 0xd8a1e681L, 14);
209 MD5STEP(F2(c, d, a), b, c, d, a, in[4] + 0xe7d3fbc8L, 20);
210 MD5STEP(F2(b, c, d), a, b, c, d, in[9] + 0x21e1cde6L, 5);
211 MD5STEP(F2(a, b, c), d, a, b, c, in[14] + 0xc33707d6L, 9);
212 MD5STEP(F2(d, a, b), c, d, a, b, in[3] + 0xf4d50d87L, 14);
213 MD5STEP(F2(c, d, a), b, c, d, a, in[8] + 0x455a14edL, 20);
214 MD5STEP(F2(b, c, d), a, b, c, d, in[13] + 0xa9e3e905L, 5);
215 MD5STEP(F2(a, b, c), d, a, b, c, in[2] + 0xfcefa3f8L, 9);
216 MD5STEP(F2(d, a, b), c, d, a, b, in[7] + 0x676f02d9L, 14);
217 MD5STEP(F2(c, d, a), b, c, d, a, in[12] + 0x8d2a4c8aL, 20);
219 MD5STEP(F3(b, c, d), a, b, c, d, in[5] + 0xfffa3942L, 4);
220 MD5STEP(F3(a, b, c), d, a, b, c, in[8] + 0x8771f681L, 11);
221 MD5STEP(F3(d, a, b), c, d, a, b, in[11] + 0x6d9d6122L, 16);
222 MD5STEP(F3(c, d, a), b, c, d, a, in[14] + 0xfde5380cL, 23);
223 MD5STEP(F3(b, c, d), a, b, c, d, in[1] + 0xa4beea44L, 4);
224 MD5STEP(F3(a, b, c), d, a, b, c, in[4] + 0x4bdecfa9L, 11);
225 MD5STEP(F3(d, a, b), c, d, a, b, in[7] + 0xf6bb4b60L, 16);
226 MD5STEP(F3(c, d, a), b, c, d, a, in[10] + 0xbebfbc70L, 23);
227 MD5STEP(F3(b, c, d), a, b, c, d, in[13] + 0x289b7ec6L, 4);
228 MD5STEP(F3(a, b, c), d, a, b, c, in[0] + 0xeaa127faL, 11);
229 MD5STEP(F3(d, a, b), c, d, a, b, in[3] + 0xd4ef3085L, 16);
230 MD5STEP(F3(c, d, a), b, c, d, a, in[6] + 0x04881d05L, 23);
231 MD5STEP(F3(b, c, d), a, b, c, d, in[9] + 0xd9d4d039L, 4);
232 MD5STEP(F3(a, b, c), d, a, b, c, in[12] + 0xe6db99e5L, 11);
233 MD5STEP(F3(d, a, b), c, d, a, b, in[15] + 0x1fa27cf8L, 16);
234 MD5STEP(F3(c, d, a), b, c, d, a, in[2] + 0xc4ac5665L, 23);
236 MD5STEP(F4(b, c, d), a, b, c, d, in[0] + 0xf4292244L, 6);
237 MD5STEP(F4(a, b, c), d, a, b, c, in[7] + 0x432aff97L, 10);
238 MD5STEP(F4(d, a, b), c, d, a, b, in[14] + 0xab9423a7L, 15);
239 MD5STEP(F4(c, d, a), b, c, d, a, in[5] + 0xfc93a039L, 21);
240 MD5STEP(F4(b, c, d), a, b, c, d, in[12] + 0x655b59c3L, 6);
241 MD5STEP(F4(a, b, c), d, a, b, c, in[3] + 0x8f0ccc92L, 10);
242 MD5STEP(F4(d, a, b), c, d, a, b, in[10] + 0xffeff47dL, 15);
243 MD5STEP(F4(c, d, a), b, c, d, a, in[1] + 0x85845dd1L, 21);
244 MD5STEP(F4(b, c, d), a, b, c, d, in[8] + 0x6fa87e4fL, 6);
245 MD5STEP(F4(a, b, c), d, a, b, c, in[15] + 0xfe2ce6e0L, 10);
246 MD5STEP(F4(d, a, b), c, d, a, b, in[6] + 0xa3014314L, 15);
247 MD5STEP(F4(c, d, a), b, c, d, a, in[13] + 0x4e0811a1L, 21);
248 MD5STEP(F4(b, c, d), a, b, c, d, in[4] + 0xf7537e82L, 6);
249 MD5STEP(F4(a, b, c), d, a, b, c, in[11] + 0xbd3af235L, 10);
250 MD5STEP(F4(d, a, b), c, d, a, b, in[2] + 0x2ad7d2bbL, 15);
251 MD5STEP(F4(c, d, a), b, c, d, a, in[9] + 0xeb86d391L, 21);
253 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
254 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
255 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
256 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
257 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
258 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
259 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
260 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
261 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
262 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
263 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
264 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
265 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
266 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
267 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
268 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
270 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
271 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
272 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
273 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
274 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
275 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
276 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
277 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
278 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
279 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
280 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
281 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
282 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
283 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
284 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
285 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
287 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
288 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
289 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
290 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
291 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
292 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
293 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
294 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
295 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
296 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
297 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
298 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
299 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
300 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
301 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
302 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
304 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
305 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
306 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
307 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
308 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
309 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
310 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
311 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
312 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
313 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
314 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
315 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
316 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
317 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
318 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
319 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
329 * This part was added by Brian Costello <btx@calyx.net>
330 * For citadel's APOP auth - makes a lower case (as per APOP RFC)
334 char *make_apop_string(char *realpass, char *nonce, char *buffer, size_t n)
336 struct MD5Context ctx;
337 u_char rawdigest[MD5_DIGEST_LEN];
341 MD5Update(&ctx, (u_char *) nonce, strlen(nonce));
342 MD5Update(&ctx, (u_char *) realpass, strlen(realpass));
343 MD5Final(rawdigest, &ctx);
344 for (i = 0; i < MD5_DIGEST_LEN; i++) {
345 snprintf(&buffer[i * 2], n - i * 2, "%02X", (unsigned char) (rawdigest[i] & 0xff));
346 buffer[i * 2] = tolower(buffer[i * 2]);
347 buffer[(i * 2) + 1] = tolower(buffer[(i * 2) + 1]);