1/*
2 * RFC 1321 compliant MD5 implementation
3 *
4 * Copyright The Mbed TLS Contributors
5 * SPDX-License-Identifier: Apache-2.0
6 *
7 * Licensed under the Apache License, Version 2.0 (the "License"); you may
8 * not use this file except in compliance with the License.
9 * You may obtain a copy of the License at
10 *
11 * http://www.apache.org/licenses/LICENSE-2.0
12 *
13 * Unless required by applicable law or agreed to in writing, software
14 * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
15 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
16 * See the License for the specific language governing permissions and
17 * limitations under the License.
18 */
19/*
20 * The MD5 algorithm was designed by Ron Rivest in 1991.
21 *
22 * http://www.ietf.org/rfc/rfc1321.txt
23 */
24
25#include "common.h"
26
27#if defined(MBEDTLS_MD5_C)
28
29#include "mbedtls/md5.h"
30#include "mbedtls/platform_util.h"
31#include "mbedtls/error.h"
32
33#include <string.h>
34
35#include "mbedtls/platform.h"
36
37#if !defined(MBEDTLS_MD5_ALT)
38
39void mbedtls_md5_init(mbedtls_md5_context *ctx)
40{
41 memset(ctx, 0, sizeof(mbedtls_md5_context));
42}
43
44void mbedtls_md5_free(mbedtls_md5_context *ctx)
45{
46 if (ctx == NULL) {
47 return;
48 }
49
50 mbedtls_platform_zeroize(ctx, sizeof(mbedtls_md5_context));
51}
52
53void mbedtls_md5_clone(mbedtls_md5_context *dst,
54 const mbedtls_md5_context *src)
55{
56 *dst = *src;
57}
58
59/*
60 * MD5 context setup
61 */
62int mbedtls_md5_starts_ret(mbedtls_md5_context *ctx)
63{
64 ctx->total[0] = 0;
65 ctx->total[1] = 0;
66
67 ctx->state[0] = 0x67452301;
68 ctx->state[1] = 0xEFCDAB89;
69 ctx->state[2] = 0x98BADCFE;
70 ctx->state[3] = 0x10325476;
71
72 return 0;
73}
74
75#if !defined(MBEDTLS_DEPRECATED_REMOVED)
76void mbedtls_md5_starts(mbedtls_md5_context *ctx)
77{
78 mbedtls_md5_starts_ret(ctx);
79}
80#endif
81
82#if !defined(MBEDTLS_MD5_PROCESS_ALT)
83int mbedtls_internal_md5_process(mbedtls_md5_context *ctx,
84 const unsigned char data[64])
85{
86 struct {
87 uint32_t X[16], A, B, C, D;
88 } local;
89
90 local.X[0] = MBEDTLS_GET_UINT32_LE(data, 0);
91 local.X[1] = MBEDTLS_GET_UINT32_LE(data, 4);
92 local.X[2] = MBEDTLS_GET_UINT32_LE(data, 8);
93 local.X[3] = MBEDTLS_GET_UINT32_LE(data, 12);
94 local.X[4] = MBEDTLS_GET_UINT32_LE(data, 16);
95 local.X[5] = MBEDTLS_GET_UINT32_LE(data, 20);
96 local.X[6] = MBEDTLS_GET_UINT32_LE(data, 24);
97 local.X[7] = MBEDTLS_GET_UINT32_LE(data, 28);
98 local.X[8] = MBEDTLS_GET_UINT32_LE(data, 32);
99 local.X[9] = MBEDTLS_GET_UINT32_LE(data, 36);
100 local.X[10] = MBEDTLS_GET_UINT32_LE(data, 40);
101 local.X[11] = MBEDTLS_GET_UINT32_LE(data, 44);
102 local.X[12] = MBEDTLS_GET_UINT32_LE(data, 48);
103 local.X[13] = MBEDTLS_GET_UINT32_LE(data, 52);
104 local.X[14] = MBEDTLS_GET_UINT32_LE(data, 56);
105 local.X[15] = MBEDTLS_GET_UINT32_LE(data, 60);
106
107#define S(x, n) \
108 (((x) << (n)) | (((x) & 0xFFFFFFFF) >> (32 - (n))))
109
110#define P(a, b, c, d, k, s, t) \
111 do \
112 { \
113 (a) += F((b), (c), (d)) + local.X[(k)] + (t); \
114 (a) = S((a), (s)) + (b); \
115 } while (0)
116
117 local.A = ctx->state[0];
118 local.B = ctx->state[1];
119 local.C = ctx->state[2];
120 local.D = ctx->state[3];
121
122#define F(x, y, z) ((z) ^ ((x) & ((y) ^ (z))))
123
124 P(local.A, local.B, local.C, local.D, 0, 7, 0xD76AA478);
125 P(local.D, local.A, local.B, local.C, 1, 12, 0xE8C7B756);
126 P(local.C, local.D, local.A, local.B, 2, 17, 0x242070DB);
127 P(local.B, local.C, local.D, local.A, 3, 22, 0xC1BDCEEE);
128 P(local.A, local.B, local.C, local.D, 4, 7, 0xF57C0FAF);
129 P(local.D, local.A, local.B, local.C, 5, 12, 0x4787C62A);
130 P(local.C, local.D, local.A, local.B, 6, 17, 0xA8304613);
131 P(local.B, local.C, local.D, local.A, 7, 22, 0xFD469501);
132 P(local.A, local.B, local.C, local.D, 8, 7, 0x698098D8);
133 P(local.D, local.A, local.B, local.C, 9, 12, 0x8B44F7AF);
134 P(local.C, local.D, local.A, local.B, 10, 17, 0xFFFF5BB1);
135 P(local.B, local.C, local.D, local.A, 11, 22, 0x895CD7BE);
136 P(local.A, local.B, local.C, local.D, 12, 7, 0x6B901122);
137 P(local.D, local.A, local.B, local.C, 13, 12, 0xFD987193);
138 P(local.C, local.D, local.A, local.B, 14, 17, 0xA679438E);
139 P(local.B, local.C, local.D, local.A, 15, 22, 0x49B40821);
140
141#undef F
142
143#define F(x, y, z) ((y) ^ ((z) & ((x) ^ (y))))
144
145 P(local.A, local.B, local.C, local.D, 1, 5, 0xF61E2562);
146 P(local.D, local.A, local.B, local.C, 6, 9, 0xC040B340);
147 P(local.C, local.D, local.A, local.B, 11, 14, 0x265E5A51);
148 P(local.B, local.C, local.D, local.A, 0, 20, 0xE9B6C7AA);
149 P(local.A, local.B, local.C, local.D, 5, 5, 0xD62F105D);
150 P(local.D, local.A, local.B, local.C, 10, 9, 0x02441453);
151 P(local.C, local.D, local.A, local.B, 15, 14, 0xD8A1E681);
152 P(local.B, local.C, local.D, local.A, 4, 20, 0xE7D3FBC8);
153 P(local.A, local.B, local.C, local.D, 9, 5, 0x21E1CDE6);
154 P(local.D, local.A, local.B, local.C, 14, 9, 0xC33707D6);
155 P(local.C, local.D, local.A, local.B, 3, 14, 0xF4D50D87);
156 P(local.B, local.C, local.D, local.A, 8, 20, 0x455A14ED);
157 P(local.A, local.B, local.C, local.D, 13, 5, 0xA9E3E905);
158 P(local.D, local.A, local.B, local.C, 2, 9, 0xFCEFA3F8);
159 P(local.C, local.D, local.A, local.B, 7, 14, 0x676F02D9);
160 P(local.B, local.C, local.D, local.A, 12, 20, 0x8D2A4C8A);
161
162#undef F
163
164#define F(x, y, z) ((x) ^ (y) ^ (z))
165
166 P(local.A, local.B, local.C, local.D, 5, 4, 0xFFFA3942);
167 P(local.D, local.A, local.B, local.C, 8, 11, 0x8771F681);
168 P(local.C, local.D, local.A, local.B, 11, 16, 0x6D9D6122);
169 P(local.B, local.C, local.D, local.A, 14, 23, 0xFDE5380C);
170 P(local.A, local.B, local.C, local.D, 1, 4, 0xA4BEEA44);
171 P(local.D, local.A, local.B, local.C, 4, 11, 0x4BDECFA9);
172 P(local.C, local.D, local.A, local.B, 7, 16, 0xF6BB4B60);
173 P(local.B, local.C, local.D, local.A, 10, 23, 0xBEBFBC70);
174 P(local.A, local.B, local.C, local.D, 13, 4, 0x289B7EC6);
175 P(local.D, local.A, local.B, local.C, 0, 11, 0xEAA127FA);
176 P(local.C, local.D, local.A, local.B, 3, 16, 0xD4EF3085);
177 P(local.B, local.C, local.D, local.A, 6, 23, 0x04881D05);
178 P(local.A, local.B, local.C, local.D, 9, 4, 0xD9D4D039);
179 P(local.D, local.A, local.B, local.C, 12, 11, 0xE6DB99E5);
180 P(local.C, local.D, local.A, local.B, 15, 16, 0x1FA27CF8);
181 P(local.B, local.C, local.D, local.A, 2, 23, 0xC4AC5665);
182
183#undef F
184
185#define F(x, y, z) ((y) ^ ((x) | ~(z)))
186
187 P(local.A, local.B, local.C, local.D, 0, 6, 0xF4292244);
188 P(local.D, local.A, local.B, local.C, 7, 10, 0x432AFF97);
189 P(local.C, local.D, local.A, local.B, 14, 15, 0xAB9423A7);
190 P(local.B, local.C, local.D, local.A, 5, 21, 0xFC93A039);
191 P(local.A, local.B, local.C, local.D, 12, 6, 0x655B59C3);
192 P(local.D, local.A, local.B, local.C, 3, 10, 0x8F0CCC92);
193 P(local.C, local.D, local.A, local.B, 10, 15, 0xFFEFF47D);
194 P(local.B, local.C, local.D, local.A, 1, 21, 0x85845DD1);
195 P(local.A, local.B, local.C, local.D, 8, 6, 0x6FA87E4F);
196 P(local.D, local.A, local.B, local.C, 15, 10, 0xFE2CE6E0);
197 P(local.C, local.D, local.A, local.B, 6, 15, 0xA3014314);
198 P(local.B, local.C, local.D, local.A, 13, 21, 0x4E0811A1);
199 P(local.A, local.B, local.C, local.D, 4, 6, 0xF7537E82);
200 P(local.D, local.A, local.B, local.C, 11, 10, 0xBD3AF235);
201 P(local.C, local.D, local.A, local.B, 2, 15, 0x2AD7D2BB);
202 P(local.B, local.C, local.D, local.A, 9, 21, 0xEB86D391);
203
204#undef F
205
206 ctx->state[0] += local.A;
207 ctx->state[1] += local.B;
208 ctx->state[2] += local.C;
209 ctx->state[3] += local.D;
210
211 /* Zeroise variables to clear sensitive data from memory. */
212 mbedtls_platform_zeroize(&local, sizeof(local));
213
214 return 0;
215}
216
217#if !defined(MBEDTLS_DEPRECATED_REMOVED)
218void mbedtls_md5_process(mbedtls_md5_context *ctx,
219 const unsigned char data[64])
220{
221 mbedtls_internal_md5_process(ctx, data);
222}
223#endif
224#endif /* !MBEDTLS_MD5_PROCESS_ALT */
225
226/*
227 * MD5 process buffer
228 */
229int mbedtls_md5_update_ret(mbedtls_md5_context *ctx,
230 const unsigned char *input,
231 size_t ilen)
232{
233 int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
234 size_t fill;
235 uint32_t left;
236
237 if (ilen == 0) {
238 return 0;
239 }
240
241 left = ctx->total[0] & 0x3F;
242 fill = 64 - left;
243
244 ctx->total[0] += (uint32_t) ilen;
245 ctx->total[0] &= 0xFFFFFFFF;
246
247 if (ctx->total[0] < (uint32_t) ilen) {
248 ctx->total[1]++;
249 }
250
251 if (left && ilen >= fill) {
252 memcpy((void *) (ctx->buffer + left), input, fill);
253 if ((ret = mbedtls_internal_md5_process(ctx, ctx->buffer)) != 0) {
254 return ret;
255 }
256
257 input += fill;
258 ilen -= fill;
259 left = 0;
260 }
261
262 while (ilen >= 64) {
263 if ((ret = mbedtls_internal_md5_process(ctx, input)) != 0) {
264 return ret;
265 }
266
267 input += 64;
268 ilen -= 64;
269 }
270
271 if (ilen > 0) {
272 memcpy((void *) (ctx->buffer + left), input, ilen);
273 }
274
275 return 0;
276}
277
278#if !defined(MBEDTLS_DEPRECATED_REMOVED)
279void mbedtls_md5_update(mbedtls_md5_context *ctx,
280 const unsigned char *input,
281 size_t ilen)
282{
283 mbedtls_md5_update_ret(ctx, input, ilen);
284}
285#endif
286
287/*
288 * MD5 final digest
289 */
290int mbedtls_md5_finish_ret(mbedtls_md5_context *ctx,
291 unsigned char output[16])
292{
293 int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
294 uint32_t used;
295 uint32_t high, low;
296
297 /*
298 * Add padding: 0x80 then 0x00 until 8 bytes remain for the length
299 */
300 used = ctx->total[0] & 0x3F;
301
302 ctx->buffer[used++] = 0x80;
303
304 if (used <= 56) {
305 /* Enough room for padding + length in current block */
306 memset(ctx->buffer + used, 0, 56 - used);
307 } else {
308 /* We'll need an extra block */
309 memset(ctx->buffer + used, 0, 64 - used);
310
311 if ((ret = mbedtls_internal_md5_process(ctx, ctx->buffer)) != 0) {
312 return ret;
313 }
314
315 memset(ctx->buffer, 0, 56);
316 }
317
318 /*
319 * Add message length
320 */
321 high = (ctx->total[0] >> 29)
322 | (ctx->total[1] << 3);
323 low = (ctx->total[0] << 3);
324
325 MBEDTLS_PUT_UINT32_LE(low, ctx->buffer, 56);
326 MBEDTLS_PUT_UINT32_LE(high, ctx->buffer, 60);
327
328 if ((ret = mbedtls_internal_md5_process(ctx, ctx->buffer)) != 0) {
329 return ret;
330 }
331
332 /*
333 * Output final state
334 */
335 MBEDTLS_PUT_UINT32_LE(ctx->state[0], output, 0);
336 MBEDTLS_PUT_UINT32_LE(ctx->state[1], output, 4);
337 MBEDTLS_PUT_UINT32_LE(ctx->state[2], output, 8);
338 MBEDTLS_PUT_UINT32_LE(ctx->state[3], output, 12);
339
340 return 0;
341}
342
343#if !defined(MBEDTLS_DEPRECATED_REMOVED)
344void mbedtls_md5_finish(mbedtls_md5_context *ctx,
345 unsigned char output[16])
346{
347 mbedtls_md5_finish_ret(ctx, output);
348}
349#endif
350
351#endif /* !MBEDTLS_MD5_ALT */
352
353/*
354 * output = MD5( input buffer )
355 */
356int mbedtls_md5_ret(const unsigned char *input,
357 size_t ilen,
358 unsigned char output[16])
359{
360 int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
361 mbedtls_md5_context ctx;
362
363 mbedtls_md5_init(&ctx);
364
365 if ((ret = mbedtls_md5_starts_ret(&ctx)) != 0) {
366 goto exit;
367 }
368
369 if ((ret = mbedtls_md5_update_ret(&ctx, input, ilen)) != 0) {
370 goto exit;
371 }
372
373 if ((ret = mbedtls_md5_finish_ret(&ctx, output)) != 0) {
374 goto exit;
375 }
376
377exit:
378 mbedtls_md5_free(&ctx);
379
380 return ret;
381}
382
383#if !defined(MBEDTLS_DEPRECATED_REMOVED)
384void mbedtls_md5(const unsigned char *input,
385 size_t ilen,
386 unsigned char output[16])
387{
388 mbedtls_md5_ret(input, ilen, output);
389}
390#endif
391
392#if defined(MBEDTLS_SELF_TEST)
393/*
394 * RFC 1321 test vectors
395 */
396static const unsigned char md5_test_buf[7][81] =
397{
398 { "" },
399 { "a" },
400 { "abc" },
401 { "message digest" },
402 { "abcdefghijklmnopqrstuvwxyz" },
403 { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
404 { "12345678901234567890123456789012345678901234567890123456789012345678901234567890" }
405};
406
407static const size_t md5_test_buflen[7] =
408{
409 0, 1, 3, 14, 26, 62, 80
410};
411
412static const unsigned char md5_test_sum[7][16] =
413{
414 { 0xD4, 0x1D, 0x8C, 0xD9, 0x8F, 0x00, 0xB2, 0x04,
415 0xE9, 0x80, 0x09, 0x98, 0xEC, 0xF8, 0x42, 0x7E },
416 { 0x0C, 0xC1, 0x75, 0xB9, 0xC0, 0xF1, 0xB6, 0xA8,
417 0x31, 0xC3, 0x99, 0xE2, 0x69, 0x77, 0x26, 0x61 },
418 { 0x90, 0x01, 0x50, 0x98, 0x3C, 0xD2, 0x4F, 0xB0,
419 0xD6, 0x96, 0x3F, 0x7D, 0x28, 0xE1, 0x7F, 0x72 },
420 { 0xF9, 0x6B, 0x69, 0x7D, 0x7C, 0xB7, 0x93, 0x8D,
421 0x52, 0x5A, 0x2F, 0x31, 0xAA, 0xF1, 0x61, 0xD0 },
422 { 0xC3, 0xFC, 0xD3, 0xD7, 0x61, 0x92, 0xE4, 0x00,
423 0x7D, 0xFB, 0x49, 0x6C, 0xCA, 0x67, 0xE1, 0x3B },
424 { 0xD1, 0x74, 0xAB, 0x98, 0xD2, 0x77, 0xD9, 0xF5,
425 0xA5, 0x61, 0x1C, 0x2C, 0x9F, 0x41, 0x9D, 0x9F },
426 { 0x57, 0xED, 0xF4, 0xA2, 0x2B, 0xE3, 0xC9, 0x55,
427 0xAC, 0x49, 0xDA, 0x2E, 0x21, 0x07, 0xB6, 0x7A }
428};
429
430/*
431 * Checkup routine
432 */
433int mbedtls_md5_self_test(int verbose)
434{
435 int i, ret = 0;
436 unsigned char md5sum[16];
437
438 for (i = 0; i < 7; i++) {
439 if (verbose != 0) {
440 mbedtls_printf(" MD5 test #%d: ", i + 1);
441 }
442
443 ret = mbedtls_md5_ret(md5_test_buf[i], md5_test_buflen[i], md5sum);
444 if (ret != 0) {
445 goto fail;
446 }
447
448 if (memcmp(md5sum, md5_test_sum[i], 16) != 0) {
449 ret = 1;
450 goto fail;
451 }
452
453 if (verbose != 0) {
454 mbedtls_printf("passed\n");
455 }
456 }
457
458 if (verbose != 0) {
459 mbedtls_printf("\n");
460 }
461
462 return 0;
463
464fail:
465 if (verbose != 0) {
466 mbedtls_printf("failed\n");
467 }
468
469 return ret;
470}
471
472#endif /* MBEDTLS_SELF_TEST */
473
474#endif /* MBEDTLS_MD5_C */
475