2 * MD5 hash implementation and interface functions
3 * Copyright (c) 2003-2005, Jouni Malinen <j@w1.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.
15 #include "eyefi-config.h"
21 * hmac_md5_vector - HMAC-MD5 over data vector (RFC 2104)
22 * @key: Key for HMAC operations
23 * @key_len: Length of the key in bytes
24 * @num_elem: Number of elements in the data vector
25 * @addr: Pointers to the data areas
26 * @len: Lengths of the data blocks
27 * @mac: Buffer for the hash (16 bytes)
29 void hmac_md5_vector(const u8 *key, size_t key_len, size_t num_elem,
30 const u8 *addr[], const size_t *len, u8 *mac)
32 u8 k_pad[64]; /* padding - key XORd with ipad/opad */
39 * Fixed limit on the number of fragments to avoid having to
40 * allocate memory (which could fail).
45 /* if key is longer than 64 bytes reset it to key = MD5(key) */
47 md5_vector(1, &key, &key_len, tk);
52 /* the HMAC_MD5 transform looks like:
54 * MD5(K XOR opad, MD5(K XOR ipad, text))
56 * where K is an n byte key
57 * ipad is the byte 0x36 repeated 64 times
58 * opad is the byte 0x5c repeated 64 times
59 * and text is the data being protected */
61 /* start out by storing key in ipad */
62 os_memset(k_pad, 0, sizeof(k_pad));
63 os_memcpy(k_pad, key, key_len);
65 /* XOR key with ipad values */
66 for (i = 0; i < 64; i++)
69 /* perform inner MD5 */
72 for (i = 0; i < num_elem; i++) {
73 _addr[i + 1] = addr[i];
76 md5_vector(1 + num_elem, _addr, _len, mac);
78 os_memset(k_pad, 0, sizeof(k_pad));
79 os_memcpy(k_pad, key, key_len);
80 /* XOR key with opad values */
81 for (i = 0; i < 64; i++)
84 /* perform outer MD5 */
88 _len[1] = MD5_MAC_LEN;
89 md5_vector(2, _addr, _len, mac);
94 * hmac_md5 - HMAC-MD5 over data buffer (RFC 2104)
95 * @key: Key for HMAC operations
96 * @key_len: Length of the key in bytes
97 * @data: Pointers to the data area
98 * @data_len: Length of the data area
99 * @mac: Buffer for the hash (16 bytes)
101 void hmac_md5(const u8 *key, size_t key_len, const u8 *data, size_t data_len,
104 hmac_md5_vector(key, key_len, 1, &data, &data_len, mac);
107 #define INTERNAL_MD5 1
117 #ifndef CONFIG_CRYPTO_INTERNAL
118 static void MD5Init(struct MD5Context *context);
119 static void MD5Update(struct MD5Context *context, unsigned char const *buf,
121 static void MD5Final(unsigned char digest[16], struct MD5Context *context);
122 #endif /* CONFIG_CRYPTO_INTERNAL */
123 static void MD5Transform(u32 buf[4], u32 const in[16]);
126 typedef struct MD5Context MD5_CTX;
130 * md5_vector - MD5 hash for data vector
131 * @num_elem: Number of elements in the data vector
132 * @addr: Pointers to the data areas
133 * @len: Lengths of the data blocks
134 * @mac: Buffer for the hash
136 void md5_vector(size_t num_elem, const u8 *addr[], const size_t *len, u8 *mac)
142 for (i = 0; i < num_elem; i++)
143 MD5Update(&ctx, addr[i], len[i]);
148 /* ===== start - public domain MD5 implementation ===== */
150 * This code implements the MD5 message-digest algorithm.
151 * The algorithm is due to Ron Rivest. This code was
152 * written by Colin Plumb in 1993, no copyright is claimed.
153 * This code is in the public domain; do with it what you wish.
155 * Equivalent code is available from RSA Data Security, Inc.
156 * This code has been tested against that, and is equivalent,
157 * except that you don't need to include two pages of legalese
160 * To compute the message digest of a chunk of bytes, declare an
161 * MD5Context structure, pass it to MD5Init, call MD5Update as
162 * needed on buffers full of bytes, and then call MD5Final, which
163 * will fill a supplied 16-byte array with the digest.
166 #ifndef WORDS_BIGENDIAN
167 #define byteReverse(buf, len) /* Nothing */
170 * Note: this code is harmless on little-endian machines.
172 static void byteReverse(unsigned char *buf, unsigned longs)
176 t = (u32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
177 ((unsigned) buf[1] << 8 | buf[0]);
185 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
186 * initialization constants.
188 void MD5Init(struct MD5Context *ctx)
190 ctx->buf[0] = 0x67452301;
191 ctx->buf[1] = 0xefcdab89;
192 ctx->buf[2] = 0x98badcfe;
193 ctx->buf[3] = 0x10325476;
200 * Update context to reflect the concatenation of another buffer full
203 void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
207 /* Update bitcount */
210 if ((ctx->bits[0] = t + ((u32) len << 3)) < t)
211 ctx->bits[1]++; /* Carry from low to high */
212 ctx->bits[1] += len >> 29;
214 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
216 /* Handle any leading odd-sized chunks */
219 unsigned char *p = (unsigned char *) ctx->in + t;
223 os_memcpy(p, buf, len);
226 os_memcpy(p, buf, t);
227 byteReverse(ctx->in, 16);
228 MD5Transform(ctx->buf, (u32 *) ctx->in);
232 /* Process data in 64-byte chunks */
235 os_memcpy(ctx->in, buf, 64);
236 byteReverse(ctx->in, 16);
237 MD5Transform(ctx->buf, (u32 *) ctx->in);
242 /* Handle any remaining bytes of data. */
244 os_memcpy(ctx->in, buf, len);
248 * Final wrapup - pad to 64-byte boundary with the bit pattern
249 * 1 0* (64-bit count of bits processed, MSB-first)
251 void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
256 /* Compute number of bytes mod 64 */
257 count = (ctx->bits[0] >> 3) & 0x3F;
259 /* Set the first char of padding to 0x80. This is safe since there is
260 always at least one byte free */
264 /* Bytes of padding needed to make 64 bytes */
265 count = 64 - 1 - count;
267 /* Pad out to 56 mod 64 */
269 /* Two lots of padding: Pad the first block to 64 bytes */
270 os_memset(p, 0, count);
271 byteReverse(ctx->in, 16);
272 MD5Transform(ctx->buf, (u32 *) ctx->in);
274 /* Now fill the next block with 56 bytes */
275 os_memset(ctx->in, 0, 56);
277 /* Pad block to 56 bytes */
278 os_memset(p, 0, count - 8);
280 byteReverse(ctx->in, 14);
282 /* Append length in bits and transform */
283 ((u32 *) ctx->in)[14] = ctx->bits[0];
284 ((u32 *) ctx->in)[15] = ctx->bits[1];
286 MD5Transform(ctx->buf, (u32 *) ctx->in);
287 byteReverse((unsigned char *) ctx->buf, 4);
288 os_memcpy(digest, ctx->buf, 16);
289 os_memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
292 /* The four core functions - F1 is optimized somewhat */
294 /* #define F1(x, y, z) (x & y | ~x & z) */
295 #define F1(x, y, z) (z ^ (x & (y ^ z)))
296 #define F2(x, y, z) F1(z, x, y)
297 #define F3(x, y, z) (x ^ y ^ z)
298 #define F4(x, y, z) (y ^ (x | ~z))
300 /* This is the central step in the MD5 algorithm. */
301 #define MD5STEP(f, w, x, y, z, data, s) \
302 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
305 * The core of the MD5 algorithm, this alters an existing MD5 hash to
306 * reflect the addition of 16 longwords of new data. MD5Update blocks
307 * the data and converts bytes into longwords for this routine.
309 static void MD5Transform(u32 buf[4], u32 const in[16])
311 register u32 a, b, c, d;
318 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
319 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
320 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
321 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
322 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
323 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
324 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
325 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
326 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
327 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
328 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
329 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
330 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
331 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
332 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
333 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
335 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
336 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
337 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
338 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
339 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
340 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
341 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
342 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
343 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
344 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
345 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
346 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
347 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
348 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
349 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
350 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
352 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
353 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
354 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
355 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
356 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
357 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
358 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
359 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
360 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
361 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
362 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
363 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
364 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
365 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
366 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
367 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
369 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
370 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
371 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
372 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
373 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
374 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
375 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
376 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
377 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
378 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
379 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
380 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
381 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
382 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
383 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
384 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
391 /* ===== end - public domain MD5 implementation ===== */
393 #endif /* INTERNAL_MD5 */