2 * MD5 hash implementation and interface functions
3 * Copyright (c) 2003-2004, Jouni Malinen <jkmaline@cc.hut.fi>
5 * This program is free software; you can redistribute it and/or modify
6 * it under the terms of the GNU General Public License version 2 as
7 * published by the Free Software Foundation.
9 * Alternatively, this software may be distributed under the terms of BSD
12 * See README and COPYING for more details.
23 void md5_mac(const u8 *key, size_t key_len, const u8 *data, size_t data_len,
28 MD5Update(&context, key, key_len);
29 MD5Update(&context, data, data_len);
30 MD5Update(&context, key, key_len);
31 MD5Final(mac, &context);
35 /* HMAC code is based on RFC 2104 */
36 void hmac_md5_vector(const u8 *key, size_t key_len, size_t num_elem,
37 const u8 *addr[], const size_t *len, u8 *mac)
40 u8 k_ipad[65]; /* inner padding - key XORd with ipad */
41 u8 k_opad[65]; /* outer padding - key XORd with opad */
45 /* if key is longer than 64 bytes reset it to key = MD5(key) */
48 MD5Update(&context, key, key_len);
49 MD5Final(tk, &context);
55 /* the HMAC_MD5 transform looks like:
57 * MD5(K XOR opad, MD5(K XOR ipad, text))
59 * where K is an n byte key
60 * ipad is the byte 0x36 repeated 64 times
61 * opad is the byte 0x5c repeated 64 times
62 * and text is the data being protected */
64 /* start out by storing key in pads */
65 memset(k_ipad, 0, sizeof(k_ipad));
66 memset(k_opad, 0, sizeof(k_opad));
67 memcpy(k_ipad, key, key_len);
68 memcpy(k_opad, key, key_len);
70 /* XOR key with ipad and opad values */
71 for (i = 0; i < 64; i++) {
76 /* perform inner MD5 */
77 MD5Init(&context); /* init context for 1st pass */
78 MD5Update(&context, k_ipad, 64); /* start with inner pad */
79 /* then text of datagram; all fragments */
80 for (i = 0; i < num_elem; i++) {
81 MD5Update(&context, addr[i], len[i]);
83 MD5Final(mac, &context); /* finish up 1st pass */
85 /* perform outer MD5 */
86 MD5Init(&context); /* init context for 2nd pass */
87 MD5Update(&context, k_opad, 64); /* start with outer pad */
88 MD5Update(&context, mac, 16); /* then results of 1st hash */
89 MD5Final(mac, &context); /* finish up 2nd pass */
93 void hmac_md5(const u8 *key, size_t key_len, const u8 *data, size_t data_len,
96 hmac_md5_vector(key, key_len, 1, &data, &data_len, mac);
100 #ifndef EAP_TLS_FUNCS
102 /* ===== start - public domain MD5 implementation ===== */
104 * This code implements the MD5 message-digest algorithm.
105 * The algorithm is due to Ron Rivest. This code was
106 * written by Colin Plumb in 1993, no copyright is claimed.
107 * This code is in the public domain; do with it what you wish.
109 * Equivalent code is available from RSA Data Security, Inc.
110 * This code has been tested against that, and is equivalent,
111 * except that you don't need to include two pages of legalese
114 * To compute the message digest of a chunk of bytes, declare an
115 * MD5Context structure, pass it to MD5Init, call MD5Update as
116 * needed on buffers full of bytes, and then call MD5Final, which
117 * will fill a supplied 16-byte array with the digest.
120 #ifndef WORDS_BIGENDIAN
121 #define byteReverse(buf, len) /* Nothing */
123 void byteReverse(unsigned char *buf, unsigned longs);
127 * Note: this code is harmless on little-endian machines.
129 void byteReverse(unsigned char *buf, unsigned longs)
133 t = (u32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
134 ((unsigned) buf[1] << 8 | buf[0]);
143 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
144 * initialization constants.
146 void MD5Init(struct MD5Context *ctx)
148 ctx->buf[0] = 0x67452301;
149 ctx->buf[1] = 0xefcdab89;
150 ctx->buf[2] = 0x98badcfe;
151 ctx->buf[3] = 0x10325476;
158 * Update context to reflect the concatenation of another buffer full
161 void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
165 /* Update bitcount */
168 if ((ctx->bits[0] = t + ((u32) len << 3)) < t)
169 ctx->bits[1]++; /* Carry from low to high */
170 ctx->bits[1] += len >> 29;
172 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
174 /* Handle any leading odd-sized chunks */
177 unsigned char *p = (unsigned char *) ctx->in + t;
185 byteReverse(ctx->in, 16);
186 MD5Transform(ctx->buf, (u32 *) ctx->in);
190 /* Process data in 64-byte chunks */
193 memcpy(ctx->in, buf, 64);
194 byteReverse(ctx->in, 16);
195 MD5Transform(ctx->buf, (u32 *) ctx->in);
200 /* Handle any remaining bytes of data. */
202 memcpy(ctx->in, buf, len);
206 * Final wrapup - pad to 64-byte boundary with the bit pattern
207 * 1 0* (64-bit count of bits processed, MSB-first)
209 void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
214 /* Compute number of bytes mod 64 */
215 count = (ctx->bits[0] >> 3) & 0x3F;
217 /* Set the first char of padding to 0x80. This is safe since there is
218 always at least one byte free */
222 /* Bytes of padding needed to make 64 bytes */
223 count = 64 - 1 - count;
225 /* Pad out to 56 mod 64 */
227 /* Two lots of padding: Pad the first block to 64 bytes */
229 byteReverse(ctx->in, 16);
230 MD5Transform(ctx->buf, (u32 *) ctx->in);
232 /* Now fill the next block with 56 bytes */
233 memset(ctx->in, 0, 56);
235 /* Pad block to 56 bytes */
236 memset(p, 0, count - 8);
238 byteReverse(ctx->in, 14);
240 /* Append length in bits and transform */
241 ((u32 *) ctx->in)[14] = ctx->bits[0];
242 ((u32 *) ctx->in)[15] = ctx->bits[1];
244 MD5Transform(ctx->buf, (u32 *) ctx->in);
245 byteReverse((unsigned char *) ctx->buf, 4);
246 memcpy(digest, ctx->buf, 16);
247 memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
252 /* The four core functions - F1 is optimized somewhat */
254 /* #define F1(x, y, z) (x & y | ~x & z) */
255 #define F1(x, y, z) (z ^ (x & (y ^ z)))
256 #define F2(x, y, z) F1(z, x, y)
257 #define F3(x, y, z) (x ^ y ^ z)
258 #define F4(x, y, z) (y ^ (x | ~z))
260 /* This is the central step in the MD5 algorithm. */
261 #define MD5STEP(f, w, x, y, z, data, s) \
262 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
265 * The core of the MD5 algorithm, this alters an existing MD5 hash to
266 * reflect the addition of 16 longwords of new data. MD5Update blocks
267 * the data and converts bytes into longwords for this routine.
269 void MD5Transform(u32 buf[4], u32 const in[16])
271 register u32 a, b, c, d;
278 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
279 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
280 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
281 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
282 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
283 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
284 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
285 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
286 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
287 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
288 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
289 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
290 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
291 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
292 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
293 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
295 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
296 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
297 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
298 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
299 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
300 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
301 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
302 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
303 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
304 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
305 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
306 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
307 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
308 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
309 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
310 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
312 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
313 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
314 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
315 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
316 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
317 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
318 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
319 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
320 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
321 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
322 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
323 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
324 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
325 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
326 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
327 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
329 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
330 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
331 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
332 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
333 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
334 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
335 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
336 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
337 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
338 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
339 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
340 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
341 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
342 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
343 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
344 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
353 /* ===== end - public domain MD5 implementation ===== */
355 #endif /* !EAP_TLS_FUNCS */