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.
27 #ifndef CONFIG_CRYPTO_INTERNAL
28 static void MD5Init(struct MD5Context *context);
29 static void MD5Update(struct MD5Context *context, unsigned char const *buf,
31 static void MD5Final(unsigned char digest[16], struct MD5Context *context);
32 #endif /* CONFIG_CRYPTO_INTERNAL */
33 static void MD5Transform(u32 buf[4], u32 const in[16]);
36 typedef struct MD5Context MD5_CTX;
40 * md5_vector - MD5 hash for data vector
41 * @num_elem: Number of elements in the data vector
42 * @addr: Pointers to the data areas
43 * @len: Lengths of the data blocks
44 * @mac: Buffer for the hash
46 void md5_vector(size_t num_elem, const u8 *addr[], const size_t *len, u8 *mac)
52 for (i = 0; i < num_elem; i++)
53 MD5Update(&ctx, addr[i], len[i]);
58 /* ===== start - public domain MD5 implementation ===== */
60 * This code implements the MD5 message-digest algorithm.
61 * The algorithm is due to Ron Rivest. This code was
62 * written by Colin Plumb in 1993, no copyright is claimed.
63 * This code is in the public domain; do with it what you wish.
65 * Equivalent code is available from RSA Data Security, Inc.
66 * This code has been tested against that, and is equivalent,
67 * except that you don't need to include two pages of legalese
70 * To compute the message digest of a chunk of bytes, declare an
71 * MD5Context structure, pass it to MD5Init, call MD5Update as
72 * needed on buffers full of bytes, and then call MD5Final, which
73 * will fill a supplied 16-byte array with the digest.
76 #ifndef WORDS_BIGENDIAN
77 #define byteReverse(buf, len) /* Nothing */
80 * Note: this code is harmless on little-endian machines.
82 static void byteReverse(unsigned char *buf, unsigned longs)
86 t = (u32) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
87 ((unsigned) buf[1] << 8 | buf[0]);
95 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
96 * initialization constants.
98 void MD5Init(struct MD5Context *ctx)
100 ctx->buf[0] = 0x67452301;
101 ctx->buf[1] = 0xefcdab89;
102 ctx->buf[2] = 0x98badcfe;
103 ctx->buf[3] = 0x10325476;
110 * Update context to reflect the concatenation of another buffer full
113 void MD5Update(struct MD5Context *ctx, unsigned char const *buf, unsigned len)
117 /* Update bitcount */
120 if ((ctx->bits[0] = t + ((u32) len << 3)) < t)
121 ctx->bits[1]++; /* Carry from low to high */
122 ctx->bits[1] += len >> 29;
124 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
126 /* Handle any leading odd-sized chunks */
129 unsigned char *p = (unsigned char *) ctx->in + t;
133 os_memcpy(p, buf, len);
136 os_memcpy(p, buf, t);
137 byteReverse(ctx->in, 16);
138 MD5Transform(ctx->buf, (u32 *) ctx->in);
142 /* Process data in 64-byte chunks */
145 os_memcpy(ctx->in, buf, 64);
146 byteReverse(ctx->in, 16);
147 MD5Transform(ctx->buf, (u32 *) ctx->in);
152 /* Handle any remaining bytes of data. */
154 os_memcpy(ctx->in, buf, len);
158 * Final wrapup - pad to 64-byte boundary with the bit pattern
159 * 1 0* (64-bit count of bits processed, MSB-first)
161 void MD5Final(unsigned char digest[16], struct MD5Context *ctx)
166 /* Compute number of bytes mod 64 */
167 count = (ctx->bits[0] >> 3) & 0x3F;
169 /* Set the first char of padding to 0x80. This is safe since there is
170 always at least one byte free */
174 /* Bytes of padding needed to make 64 bytes */
175 count = 64 - 1 - count;
177 /* Pad out to 56 mod 64 */
179 /* Two lots of padding: Pad the first block to 64 bytes */
180 os_memset(p, 0, count);
181 byteReverse(ctx->in, 16);
182 MD5Transform(ctx->buf, (u32 *) ctx->in);
184 /* Now fill the next block with 56 bytes */
185 os_memset(ctx->in, 0, 56);
187 /* Pad block to 56 bytes */
188 os_memset(p, 0, count - 8);
190 byteReverse(ctx->in, 14);
192 /* Append length in bits and transform */
193 ((u32 *) ctx->in)[14] = ctx->bits[0];
194 ((u32 *) ctx->in)[15] = ctx->bits[1];
196 MD5Transform(ctx->buf, (u32 *) ctx->in);
197 byteReverse((unsigned char *) ctx->buf, 4);
198 os_memcpy(digest, ctx->buf, 16);
199 os_memset(ctx, 0, sizeof(ctx)); /* In case it's sensitive */
202 /* The four core functions - F1 is optimized somewhat */
204 /* #define F1(x, y, z) (x & y | ~x & z) */
205 #define F1(x, y, z) (z ^ (x & (y ^ z)))
206 #define F2(x, y, z) F1(z, x, y)
207 #define F3(x, y, z) (x ^ y ^ z)
208 #define F4(x, y, z) (y ^ (x | ~z))
210 /* This is the central step in the MD5 algorithm. */
211 #define MD5STEP(f, w, x, y, z, data, s) \
212 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
215 * The core of the MD5 algorithm, this alters an existing MD5 hash to
216 * reflect the addition of 16 longwords of new data. MD5Update blocks
217 * the data and converts bytes into longwords for this routine.
219 static void MD5Transform(u32 buf[4], u32 const in[16])
221 register u32 a, b, c, d;
228 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
229 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
230 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
231 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
232 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
233 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
234 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
235 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
236 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
237 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
238 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
239 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
240 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
241 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
242 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
243 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
245 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
246 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
247 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
248 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
249 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
250 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
251 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
252 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
253 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
254 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
255 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
256 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
257 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
258 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
259 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
260 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
262 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
263 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
264 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
265 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
266 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
267 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
268 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
269 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
270 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
271 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
272 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
273 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
274 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
275 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
276 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
277 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
279 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
280 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
281 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
282 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
283 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
284 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
285 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
286 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
287 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
288 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
289 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
290 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
291 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
292 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
293 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
294 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
301 /* ===== end - public domain MD5 implementation ===== */