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