1 /*
2 * MD5 hash implementation and interface functions
3 * Copyright (c) 2003-2005, Jouni Malinen <j@w1.fi>
4 *
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.
8 *
9 * Alternatively, this software may be distributed under the terms of BSD
10 * license.
11 *
12 * See README and COPYING for more details.
13 */
14
15 #include <stdint.h>
16 #include <string.h>
17 #include "esp_rom_md5.h"
18
19 static void byteReverse(unsigned char *buf, unsigned longs);
20 static void MD5Transform(uint32_t buf[4], uint32_t const in[16]);
21
22 /* ===== start - public domain MD5 implementation ===== */
23 /*
24 * This code implements the MD5 message-digest algorithm.
25 * The algorithm is due to Ron Rivest. This code was
26 * written by Colin Plumb in 1993, no copyright is claimed.
27 * This code is in the public domain; do with it what you wish.
28 *
29 * Equivalent code is available from RSA Data Security, Inc.
30 * This code has been tested against that, and is equivalent,
31 * except that you don't need to include two pages of legalese
32 * with every copy.
33 *
34 * To compute the message digest of a chunk of bytes, declare an
35 * MD5Context structure, pass it to MD5Init, call MD5Update as
36 * needed on buffers full of bytes, and then call MD5Final, which
37 * will fill a supplied 16-byte array with the digest.
38 */
39
esp_rom_md5_init(md5_context_t * context)40 void esp_rom_md5_init(md5_context_t *context)
41 {
42 context->buf[0] = 0x67452301;
43 context->buf[1] = 0xefcdab89;
44 context->buf[2] = 0x98badcfe;
45 context->buf[3] = 0x10325476;
46
47 context->bits[0] = 0;
48 context->bits[1] = 0;
49 }
50
esp_rom_md5_update(md5_context_t * context,const void * buf,uint32_t len)51 void esp_rom_md5_update(md5_context_t *context, const void *buf, uint32_t len)
52 {
53 uint32_t t;
54
55 /* Update bitcount */
56
57 t = context->bits[0];
58 if ((context->bits[0] = t + ((uint32_t) len << 3)) < t)
59 context->bits[1]++; /* Carry from low to high */
60 context->bits[1] += len >> 29;
61
62 t = (t >> 3) & 0x3f; /* Bytes already in shsInfo->data */
63
64 /* Handle any leading odd-sized chunks */
65
66 if (t) {
67 unsigned char *p = (unsigned char *) context->in + t;
68
69 t = 64 - t;
70 if (len < t) {
71 memcpy(p, buf, len);
72 return;
73 }
74 memcpy(p, buf, t);
75 byteReverse(context->in, 16);
76 MD5Transform(context->buf, (uint32_t *) context->in);
77 buf += t;
78 len -= t;
79 }
80 /* Process data in 64-byte chunks */
81
82 while (len >= 64) {
83 memcpy(context->in, buf, 64);
84 byteReverse(context->in, 16);
85 MD5Transform(context->buf, (uint32_t *) context->in);
86 buf += 64;
87 len -= 64;
88 }
89
90 /* Handle any remaining bytes of data. */
91
92 memcpy(context->in, buf, len);
93 }
94
esp_rom_md5_final(uint8_t * digest,md5_context_t * context)95 void esp_rom_md5_final(uint8_t *digest, md5_context_t *context)
96 {
97 unsigned count;
98 unsigned char *p;
99
100 /* Compute number of bytes mod 64 */
101 count = (context->bits[0] >> 3) & 0x3F;
102
103 /* Set the first char of padding to 0x80. This is safe since there is
104 always at least one byte free */
105 p = context->in + count;
106 *p++ = 0x80;
107
108 /* Bytes of padding needed to make 64 bytes */
109 count = 64 - 1 - count;
110
111 /* Pad out to 56 mod 64 */
112 if (count < 8) {
113 /* Two lots of padding: Pad the first block to 64 bytes */
114 memset(p, 0, count);
115 byteReverse(context->in, 16);
116 MD5Transform(context->buf, (uint32_t *) context->in);
117
118 /* Now fill the next block with 56 bytes */
119 memset(context->in, 0, 56);
120 } else {
121 /* Pad block to 56 bytes */
122 memset(p, 0, count - 8);
123 }
124 byteReverse(context->in, 14);
125
126 /* Append length in bits and transform */
127 ((uint32_t *) context->in)[14] = context->bits[0];
128 ((uint32_t *) context->in)[15] = context->bits[1];
129
130 MD5Transform(context->buf, (uint32_t *) context->in);
131 byteReverse((unsigned char *) context->buf, 4);
132 memcpy(digest, context->buf, 16);
133 memset(context, 0, sizeof(*context)); /* In case it's sensitive */
134 }
135
byteReverse(unsigned char * buf,unsigned longs)136 static void byteReverse(unsigned char *buf, unsigned longs)
137 {
138 uint32_t t;
139 do {
140 t = (uint32_t) ((unsigned) buf[3] << 8 | buf[2]) << 16 |
141 ((unsigned) buf[1] << 8 | buf[0]);
142 *(uint32_t *) buf = t;
143 buf += 4;
144 } while (--longs);
145 }
146
147 /* The four core functions - F1 is optimized somewhat */
148
149 /* #define F1(x, y, z) (x & y | ~x & z) */
150 #define F1(x, y, z) (z ^ (x & (y ^ z)))
151 #define F2(x, y, z) F1(z, x, y)
152 #define F3(x, y, z) (x ^ y ^ z)
153 #define F4(x, y, z) (y ^ (x | ~z))
154
155 /* This is the central step in the MD5 algorithm. */
156 #define MD5STEP(f, w, x, y, z, data, s) \
157 ( w += f(x, y, z) + data, w = w<<s | w>>(32-s), w += x )
158
159 /*
160 * The core of the MD5 algorithm, this alters an existing MD5 hash to
161 * reflect the addition of 16 longwords of new data. MD5Update blocks
162 * the data and converts bytes into longwords for this routine.
163 */
MD5Transform(uint32_t buf[4],uint32_t const in[16])164 static void MD5Transform(uint32_t buf[4], uint32_t const in[16])
165 {
166 register uint32_t a, b, c, d;
167
168 a = buf[0];
169 b = buf[1];
170 c = buf[2];
171 d = buf[3];
172
173 MD5STEP(F1, a, b, c, d, in[0] + 0xd76aa478, 7);
174 MD5STEP(F1, d, a, b, c, in[1] + 0xe8c7b756, 12);
175 MD5STEP(F1, c, d, a, b, in[2] + 0x242070db, 17);
176 MD5STEP(F1, b, c, d, a, in[3] + 0xc1bdceee, 22);
177 MD5STEP(F1, a, b, c, d, in[4] + 0xf57c0faf, 7);
178 MD5STEP(F1, d, a, b, c, in[5] + 0x4787c62a, 12);
179 MD5STEP(F1, c, d, a, b, in[6] + 0xa8304613, 17);
180 MD5STEP(F1, b, c, d, a, in[7] + 0xfd469501, 22);
181 MD5STEP(F1, a, b, c, d, in[8] + 0x698098d8, 7);
182 MD5STEP(F1, d, a, b, c, in[9] + 0x8b44f7af, 12);
183 MD5STEP(F1, c, d, a, b, in[10] + 0xffff5bb1, 17);
184 MD5STEP(F1, b, c, d, a, in[11] + 0x895cd7be, 22);
185 MD5STEP(F1, a, b, c, d, in[12] + 0x6b901122, 7);
186 MD5STEP(F1, d, a, b, c, in[13] + 0xfd987193, 12);
187 MD5STEP(F1, c, d, a, b, in[14] + 0xa679438e, 17);
188 MD5STEP(F1, b, c, d, a, in[15] + 0x49b40821, 22);
189
190 MD5STEP(F2, a, b, c, d, in[1] + 0xf61e2562, 5);
191 MD5STEP(F2, d, a, b, c, in[6] + 0xc040b340, 9);
192 MD5STEP(F2, c, d, a, b, in[11] + 0x265e5a51, 14);
193 MD5STEP(F2, b, c, d, a, in[0] + 0xe9b6c7aa, 20);
194 MD5STEP(F2, a, b, c, d, in[5] + 0xd62f105d, 5);
195 MD5STEP(F2, d, a, b, c, in[10] + 0x02441453, 9);
196 MD5STEP(F2, c, d, a, b, in[15] + 0xd8a1e681, 14);
197 MD5STEP(F2, b, c, d, a, in[4] + 0xe7d3fbc8, 20);
198 MD5STEP(F2, a, b, c, d, in[9] + 0x21e1cde6, 5);
199 MD5STEP(F2, d, a, b, c, in[14] + 0xc33707d6, 9);
200 MD5STEP(F2, c, d, a, b, in[3] + 0xf4d50d87, 14);
201 MD5STEP(F2, b, c, d, a, in[8] + 0x455a14ed, 20);
202 MD5STEP(F2, a, b, c, d, in[13] + 0xa9e3e905, 5);
203 MD5STEP(F2, d, a, b, c, in[2] + 0xfcefa3f8, 9);
204 MD5STEP(F2, c, d, a, b, in[7] + 0x676f02d9, 14);
205 MD5STEP(F2, b, c, d, a, in[12] + 0x8d2a4c8a, 20);
206
207 MD5STEP(F3, a, b, c, d, in[5] + 0xfffa3942, 4);
208 MD5STEP(F3, d, a, b, c, in[8] + 0x8771f681, 11);
209 MD5STEP(F3, c, d, a, b, in[11] + 0x6d9d6122, 16);
210 MD5STEP(F3, b, c, d, a, in[14] + 0xfde5380c, 23);
211 MD5STEP(F3, a, b, c, d, in[1] + 0xa4beea44, 4);
212 MD5STEP(F3, d, a, b, c, in[4] + 0x4bdecfa9, 11);
213 MD5STEP(F3, c, d, a, b, in[7] + 0xf6bb4b60, 16);
214 MD5STEP(F3, b, c, d, a, in[10] + 0xbebfbc70, 23);
215 MD5STEP(F3, a, b, c, d, in[13] + 0x289b7ec6, 4);
216 MD5STEP(F3, d, a, b, c, in[0] + 0xeaa127fa, 11);
217 MD5STEP(F3, c, d, a, b, in[3] + 0xd4ef3085, 16);
218 MD5STEP(F3, b, c, d, a, in[6] + 0x04881d05, 23);
219 MD5STEP(F3, a, b, c, d, in[9] + 0xd9d4d039, 4);
220 MD5STEP(F3, d, a, b, c, in[12] + 0xe6db99e5, 11);
221 MD5STEP(F3, c, d, a, b, in[15] + 0x1fa27cf8, 16);
222 MD5STEP(F3, b, c, d, a, in[2] + 0xc4ac5665, 23);
223
224 MD5STEP(F4, a, b, c, d, in[0] + 0xf4292244, 6);
225 MD5STEP(F4, d, a, b, c, in[7] + 0x432aff97, 10);
226 MD5STEP(F4, c, d, a, b, in[14] + 0xab9423a7, 15);
227 MD5STEP(F4, b, c, d, a, in[5] + 0xfc93a039, 21);
228 MD5STEP(F4, a, b, c, d, in[12] + 0x655b59c3, 6);
229 MD5STEP(F4, d, a, b, c, in[3] + 0x8f0ccc92, 10);
230 MD5STEP(F4, c, d, a, b, in[10] + 0xffeff47d, 15);
231 MD5STEP(F4, b, c, d, a, in[1] + 0x85845dd1, 21);
232 MD5STEP(F4, a, b, c, d, in[8] + 0x6fa87e4f, 6);
233 MD5STEP(F4, d, a, b, c, in[15] + 0xfe2ce6e0, 10);
234 MD5STEP(F4, c, d, a, b, in[6] + 0xa3014314, 15);
235 MD5STEP(F4, b, c, d, a, in[13] + 0x4e0811a1, 21);
236 MD5STEP(F4, a, b, c, d, in[4] + 0xf7537e82, 6);
237 MD5STEP(F4, d, a, b, c, in[11] + 0xbd3af235, 10);
238 MD5STEP(F4, c, d, a, b, in[2] + 0x2ad7d2bb, 15);
239 MD5STEP(F4, b, c, d, a, in[9] + 0xeb86d391, 21);
240
241 buf[0] += a;
242 buf[1] += b;
243 buf[2] += c;
244 buf[3] += d;
245 }
246 /* ===== end - public domain MD5 implementation ===== */
247
