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.
20 #include <cpu/byteorder.h>
23 static void MD5Transform(uint32_t buf[4], uint32_t in[16]);
25 static void byteReverse(uint32_t *buf, unsigned longs)
28 *buf = le32_to_cpu(*buf);
34 * Start MD5 accumulation. Set bit count to 0 and buffer to mysterious
35 * initialization constants.
37 static void MD5_begin(Hash *h)
39 MD5_Context *ctx = (MD5_Context *)h;
41 ctx->buf[0] = 0x67452301;
42 ctx->buf[1] = 0xefcdab89;
43 ctx->buf[2] = 0x98badcfe;
44 ctx->buf[3] = 0x10325476;
50 * Update context to reflect the concatenation of another buffer full
53 static void MD5_update(Hash *h, const void* vbuf, size_t len)
55 MD5_Context *ctx = (MD5_Context *)h;
56 const char *buf = (const char *)vbuf;
60 t = (ctx->bits >> 3) & 0x3f; /* Bytes already in shsInfo->data */
63 /* Handle any leading odd-sized chunks */
66 uint8_t *p = (uint8_t*) ctx->in + t;
74 byteReverse((uint32_t*)ctx->in, 16);
75 MD5Transform(ctx->buf, (uint32_t*)ctx->in);
79 /* Process data in 64-byte chunks */
82 memcpy(ctx->in, buf, 64);
83 byteReverse((uint32_t*)ctx->in, 16);
84 MD5Transform(ctx->buf, (uint32_t*)ctx->in);
89 /* Handle any remaining bytes of data. */
90 memcpy(ctx->in, buf, len);
94 * Final wrapup - pad to 64-byte boundary with the bit pattern
95 * 1 0* (64-bit count of bits processed, MSB-first)
97 static uint8_t* MD5_final(struct Hash *h)
99 MD5_Context *ctx = (MD5_Context *)h;
103 /* Compute number of bytes mod 64 */
104 count = (ctx->bits >> 3) & 0x3F;
106 /* Set the first char of padding to 0x80. This is safe since there is
107 always at least one byte free */
111 /* Bytes of padding needed to make 64 bytes */
112 count = 64 - 1 - count;
114 /* Pad out to 56 mod 64 */
116 /* Two lots of padding: Pad the first block to 64 bytes */
118 byteReverse((uint32_t*)ctx->in, 16);
119 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
121 /* Now fill the next block with 56 bytes */
122 memset(ctx->in, 0, 56);
124 /* Pad block to 56 bytes */
125 memset(p, 0, count - 8);
127 byteReverse((uint32_t*)ctx->in, 14);
129 /* Append length in bits and transform */
130 ((uint32_t*) ctx->in)[14] = (uint32_t)ctx->bits;
131 ((uint32_t*) ctx->in)[15] = (uint32_t)(ctx->bits >> 32);
133 MD5Transform(ctx->buf, (uint32_t *) ctx->in);
134 byteReverse((uint32_t*)ctx->buf, 4);
139 return (uint8_t *)ctx->buf;
143 /* The four core functions - F1 is optimized somewhat */
145 /* #define F1(x, y, z) (x & y | ~x & z) */
146 #define F1(x, y, z) (z ^ (x & (y ^ z)))
147 #define F2(x, y, z) F1(z, x, y)
148 #define F3(x, y, z) (x ^ y ^ z)
149 #define F4(x, y, z) (y ^ (x | ~z))
151 /* This is the central step in the MD5 algorithm. */
152 #define MD5STEP(f, w, x, y, z, data, s) \
153 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
156 * The core of the MD5 algorithm, this alters an existing MD5 hash to
157 * reflect the addition of 16 longwords of new data. MD5Update blocks
158 * the data and converts bytes into longwords for this routine.
160 static void MD5Transform(uint32_t buf[4], uint32_t in[16])
162 register uint32_t a, b, c, d;
169 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
170 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
171 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
172 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
173 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
174 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
175 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
176 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
177 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
178 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
179 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
180 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
181 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
182 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
183 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
184 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
186 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
187 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
188 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
189 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
190 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
191 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
192 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
193 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
194 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
195 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
196 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
197 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
198 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
199 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
200 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
201 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
203 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
204 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
205 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
206 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
207 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
208 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
209 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
210 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
211 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
212 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
213 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
214 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
215 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
216 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
217 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
218 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
220 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
221 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
222 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
223 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
224 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
225 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
226 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
227 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
228 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
229 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
230 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
231 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
232 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
233 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
234 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
235 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
243 /*******************************************************************/
245 void MD5_init(MD5_Context *ctx)
247 ctx->h.begin = MD5_begin;
248 ctx->h.update = MD5_update;
249 ctx->h.final = MD5_final;
250 ctx->h.digest_len = 16;
251 ctx->h.block_len = 64;