md5.c 11 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404
  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
  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. * This file is part of mbed TLS (https://tls.mbed.org)
  20. */
  21. /*
  22. * The MD5 algorithm was designed by Ron Rivest in 1991.
  23. *
  24. * http://www.ietf.org/rfc/rfc1321.txt
  25. */
  26. #if !defined(MBEDTLS_CONFIG_FILE)
  27. #include "mbedtls/config.h"
  28. #else
  29. #include MBEDTLS_CONFIG_FILE
  30. #endif
  31. #if defined(MBEDTLS_MD5_C)
  32. #include "mbedtls/md5.h"
  33. #include <string.h>
  34. #if defined(MBEDTLS_SELF_TEST)
  35. #if defined(MBEDTLS_PLATFORM_C)
  36. #include "mbedtls/platform.h"
  37. #else
  38. #include <stdio.h>
  39. #define mbedtls_printf printf
  40. #endif /* MBEDTLS_PLATFORM_C */
  41. #endif /* MBEDTLS_SELF_TEST */
  42. #if !defined(MBEDTLS_MD5_ALT)
  43. /* Implementation that should never be optimized out by the compiler */
  44. static void mbedtls_zeroize( void *v, size_t n ) {
  45. volatile unsigned char *p = v; while( n-- ) *p++ = 0;
  46. }
  47. /*
  48. * 32-bit integer manipulation macros (little endian)
  49. */
  50. #ifndef GET_UINT32_LE
  51. #define GET_UINT32_LE(n,b,i) \
  52. { \
  53. (n) = ( (uint32_t) (b)[(i) ] ) \
  54. | ( (uint32_t) (b)[(i) + 1] << 8 ) \
  55. | ( (uint32_t) (b)[(i) + 2] << 16 ) \
  56. | ( (uint32_t) (b)[(i) + 3] << 24 ); \
  57. }
  58. #endif
  59. #ifndef PUT_UINT32_LE
  60. #define PUT_UINT32_LE(n,b,i) \
  61. { \
  62. (b)[(i) ] = (unsigned char) ( ( (n) ) & 0xFF ); \
  63. (b)[(i) + 1] = (unsigned char) ( ( (n) >> 8 ) & 0xFF ); \
  64. (b)[(i) + 2] = (unsigned char) ( ( (n) >> 16 ) & 0xFF ); \
  65. (b)[(i) + 3] = (unsigned char) ( ( (n) >> 24 ) & 0xFF ); \
  66. }
  67. #endif
  68. void mbedtls_md5_init( mbedtls_md5_context *ctx )
  69. {
  70. memset( ctx, 0, sizeof( mbedtls_md5_context ) );
  71. }
  72. void mbedtls_md5_free( mbedtls_md5_context *ctx )
  73. {
  74. if( ctx == NULL )
  75. return;
  76. mbedtls_zeroize( ctx, sizeof( mbedtls_md5_context ) );
  77. }
  78. void mbedtls_md5_clone( mbedtls_md5_context *dst,
  79. const mbedtls_md5_context *src )
  80. {
  81. *dst = *src;
  82. }
  83. /*
  84. * MD5 context setup
  85. */
  86. void mbedtls_md5_starts( mbedtls_md5_context *ctx )
  87. {
  88. ctx->total[0] = 0;
  89. ctx->total[1] = 0;
  90. ctx->state[0] = 0x67452301;
  91. ctx->state[1] = 0xEFCDAB89;
  92. ctx->state[2] = 0x98BADCFE;
  93. ctx->state[3] = 0x10325476;
  94. }
  95. #if !defined(MBEDTLS_MD5_PROCESS_ALT)
  96. void mbedtls_md5_process( mbedtls_md5_context *ctx, const unsigned char data[64] )
  97. {
  98. uint32_t X[16], A, B, C, D;
  99. GET_UINT32_LE( X[ 0], data, 0 );
  100. GET_UINT32_LE( X[ 1], data, 4 );
  101. GET_UINT32_LE( X[ 2], data, 8 );
  102. GET_UINT32_LE( X[ 3], data, 12 );
  103. GET_UINT32_LE( X[ 4], data, 16 );
  104. GET_UINT32_LE( X[ 5], data, 20 );
  105. GET_UINT32_LE( X[ 6], data, 24 );
  106. GET_UINT32_LE( X[ 7], data, 28 );
  107. GET_UINT32_LE( X[ 8], data, 32 );
  108. GET_UINT32_LE( X[ 9], data, 36 );
  109. GET_UINT32_LE( X[10], data, 40 );
  110. GET_UINT32_LE( X[11], data, 44 );
  111. GET_UINT32_LE( X[12], data, 48 );
  112. GET_UINT32_LE( X[13], data, 52 );
  113. GET_UINT32_LE( X[14], data, 56 );
  114. GET_UINT32_LE( X[15], data, 60 );
  115. #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  116. #define P(a,b,c,d,k,s,t) \
  117. { \
  118. a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \
  119. }
  120. A = ctx->state[0];
  121. B = ctx->state[1];
  122. C = ctx->state[2];
  123. D = ctx->state[3];
  124. #define F(x,y,z) (z ^ (x & (y ^ z)))
  125. P( A, B, C, D, 0, 7, 0xD76AA478 );
  126. P( D, A, B, C, 1, 12, 0xE8C7B756 );
  127. P( C, D, A, B, 2, 17, 0x242070DB );
  128. P( B, C, D, A, 3, 22, 0xC1BDCEEE );
  129. P( A, B, C, D, 4, 7, 0xF57C0FAF );
  130. P( D, A, B, C, 5, 12, 0x4787C62A );
  131. P( C, D, A, B, 6, 17, 0xA8304613 );
  132. P( B, C, D, A, 7, 22, 0xFD469501 );
  133. P( A, B, C, D, 8, 7, 0x698098D8 );
  134. P( D, A, B, C, 9, 12, 0x8B44F7AF );
  135. P( C, D, A, B, 10, 17, 0xFFFF5BB1 );
  136. P( B, C, D, A, 11, 22, 0x895CD7BE );
  137. P( A, B, C, D, 12, 7, 0x6B901122 );
  138. P( D, A, B, C, 13, 12, 0xFD987193 );
  139. P( C, D, A, B, 14, 17, 0xA679438E );
  140. P( B, C, D, A, 15, 22, 0x49B40821 );
  141. #undef F
  142. #define F(x,y,z) (y ^ (z & (x ^ y)))
  143. P( A, B, C, D, 1, 5, 0xF61E2562 );
  144. P( D, A, B, C, 6, 9, 0xC040B340 );
  145. P( C, D, A, B, 11, 14, 0x265E5A51 );
  146. P( B, C, D, A, 0, 20, 0xE9B6C7AA );
  147. P( A, B, C, D, 5, 5, 0xD62F105D );
  148. P( D, A, B, C, 10, 9, 0x02441453 );
  149. P( C, D, A, B, 15, 14, 0xD8A1E681 );
  150. P( B, C, D, A, 4, 20, 0xE7D3FBC8 );
  151. P( A, B, C, D, 9, 5, 0x21E1CDE6 );
  152. P( D, A, B, C, 14, 9, 0xC33707D6 );
  153. P( C, D, A, B, 3, 14, 0xF4D50D87 );
  154. P( B, C, D, A, 8, 20, 0x455A14ED );
  155. P( A, B, C, D, 13, 5, 0xA9E3E905 );
  156. P( D, A, B, C, 2, 9, 0xFCEFA3F8 );
  157. P( C, D, A, B, 7, 14, 0x676F02D9 );
  158. P( B, C, D, A, 12, 20, 0x8D2A4C8A );
  159. #undef F
  160. #define F(x,y,z) (x ^ y ^ z)
  161. P( A, B, C, D, 5, 4, 0xFFFA3942 );
  162. P( D, A, B, C, 8, 11, 0x8771F681 );
  163. P( C, D, A, B, 11, 16, 0x6D9D6122 );
  164. P( B, C, D, A, 14, 23, 0xFDE5380C );
  165. P( A, B, C, D, 1, 4, 0xA4BEEA44 );
  166. P( D, A, B, C, 4, 11, 0x4BDECFA9 );
  167. P( C, D, A, B, 7, 16, 0xF6BB4B60 );
  168. P( B, C, D, A, 10, 23, 0xBEBFBC70 );
  169. P( A, B, C, D, 13, 4, 0x289B7EC6 );
  170. P( D, A, B, C, 0, 11, 0xEAA127FA );
  171. P( C, D, A, B, 3, 16, 0xD4EF3085 );
  172. P( B, C, D, A, 6, 23, 0x04881D05 );
  173. P( A, B, C, D, 9, 4, 0xD9D4D039 );
  174. P( D, A, B, C, 12, 11, 0xE6DB99E5 );
  175. P( C, D, A, B, 15, 16, 0x1FA27CF8 );
  176. P( B, C, D, A, 2, 23, 0xC4AC5665 );
  177. #undef F
  178. #define F(x,y,z) (y ^ (x | ~z))
  179. P( A, B, C, D, 0, 6, 0xF4292244 );
  180. P( D, A, B, C, 7, 10, 0x432AFF97 );
  181. P( C, D, A, B, 14, 15, 0xAB9423A7 );
  182. P( B, C, D, A, 5, 21, 0xFC93A039 );
  183. P( A, B, C, D, 12, 6, 0x655B59C3 );
  184. P( D, A, B, C, 3, 10, 0x8F0CCC92 );
  185. P( C, D, A, B, 10, 15, 0xFFEFF47D );
  186. P( B, C, D, A, 1, 21, 0x85845DD1 );
  187. P( A, B, C, D, 8, 6, 0x6FA87E4F );
  188. P( D, A, B, C, 15, 10, 0xFE2CE6E0 );
  189. P( C, D, A, B, 6, 15, 0xA3014314 );
  190. P( B, C, D, A, 13, 21, 0x4E0811A1 );
  191. P( A, B, C, D, 4, 6, 0xF7537E82 );
  192. P( D, A, B, C, 11, 10, 0xBD3AF235 );
  193. P( C, D, A, B, 2, 15, 0x2AD7D2BB );
  194. P( B, C, D, A, 9, 21, 0xEB86D391 );
  195. #undef F
  196. ctx->state[0] += A;
  197. ctx->state[1] += B;
  198. ctx->state[2] += C;
  199. ctx->state[3] += D;
  200. }
  201. #endif /* !MBEDTLS_MD5_PROCESS_ALT */
  202. /*
  203. * MD5 process buffer
  204. */
  205. void mbedtls_md5_update( mbedtls_md5_context *ctx, const unsigned char *input, size_t ilen )
  206. {
  207. size_t fill;
  208. uint32_t left;
  209. if( ilen == 0 )
  210. return;
  211. left = ctx->total[0] & 0x3F;
  212. fill = 64 - left;
  213. ctx->total[0] += (uint32_t) ilen;
  214. ctx->total[0] &= 0xFFFFFFFF;
  215. if( ctx->total[0] < (uint32_t) ilen )
  216. ctx->total[1]++;
  217. if( left && ilen >= fill )
  218. {
  219. memcpy( (void *) (ctx->buffer + left), input, fill );
  220. mbedtls_md5_process( ctx, ctx->buffer );
  221. input += fill;
  222. ilen -= fill;
  223. left = 0;
  224. }
  225. while( ilen >= 64 )
  226. {
  227. mbedtls_md5_process( ctx, input );
  228. input += 64;
  229. ilen -= 64;
  230. }
  231. if( ilen > 0 )
  232. {
  233. memcpy( (void *) (ctx->buffer + left), input, ilen );
  234. }
  235. }
  236. static const unsigned char md5_padding[64] =
  237. {
  238. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  239. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  240. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  241. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  242. };
  243. /*
  244. * MD5 final digest
  245. */
  246. void mbedtls_md5_finish( mbedtls_md5_context *ctx, unsigned char output[16] )
  247. {
  248. uint32_t last, padn;
  249. uint32_t high, low;
  250. unsigned char msglen[8];
  251. high = ( ctx->total[0] >> 29 )
  252. | ( ctx->total[1] << 3 );
  253. low = ( ctx->total[0] << 3 );
  254. PUT_UINT32_LE( low, msglen, 0 );
  255. PUT_UINT32_LE( high, msglen, 4 );
  256. last = ctx->total[0] & 0x3F;
  257. padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
  258. mbedtls_md5_update( ctx, md5_padding, padn );
  259. mbedtls_md5_update( ctx, msglen, 8 );
  260. PUT_UINT32_LE( ctx->state[0], output, 0 );
  261. PUT_UINT32_LE( ctx->state[1], output, 4 );
  262. PUT_UINT32_LE( ctx->state[2], output, 8 );
  263. PUT_UINT32_LE( ctx->state[3], output, 12 );
  264. }
  265. #endif /* !MBEDTLS_MD5_ALT */
  266. /*
  267. * output = MD5( input buffer )
  268. */
  269. void mbedtls_md5( const unsigned char *input, size_t ilen, unsigned char output[16] )
  270. {
  271. mbedtls_md5_context ctx;
  272. mbedtls_md5_init( &ctx );
  273. mbedtls_md5_starts( &ctx );
  274. mbedtls_md5_update( &ctx, input, ilen );
  275. mbedtls_md5_finish( &ctx, output );
  276. mbedtls_md5_free( &ctx );
  277. }
  278. #if defined(MBEDTLS_SELF_TEST)
  279. /*
  280. * RFC 1321 test vectors
  281. */
  282. static const unsigned char md5_test_buf[7][81] =
  283. {
  284. { "" },
  285. { "a" },
  286. { "abc" },
  287. { "message digest" },
  288. { "abcdefghijklmnopqrstuvwxyz" },
  289. { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
  290. { "12345678901234567890123456789012345678901234567890123456789012" \
  291. "345678901234567890" }
  292. };
  293. static const int md5_test_buflen[7] =
  294. {
  295. 0, 1, 3, 14, 26, 62, 80
  296. };
  297. static const unsigned char md5_test_sum[7][16] =
  298. {
  299. { 0xD4, 0x1D, 0x8C, 0xD9, 0x8F, 0x00, 0xB2, 0x04,
  300. 0xE9, 0x80, 0x09, 0x98, 0xEC, 0xF8, 0x42, 0x7E },
  301. { 0x0C, 0xC1, 0x75, 0xB9, 0xC0, 0xF1, 0xB6, 0xA8,
  302. 0x31, 0xC3, 0x99, 0xE2, 0x69, 0x77, 0x26, 0x61 },
  303. { 0x90, 0x01, 0x50, 0x98, 0x3C, 0xD2, 0x4F, 0xB0,
  304. 0xD6, 0x96, 0x3F, 0x7D, 0x28, 0xE1, 0x7F, 0x72 },
  305. { 0xF9, 0x6B, 0x69, 0x7D, 0x7C, 0xB7, 0x93, 0x8D,
  306. 0x52, 0x5A, 0x2F, 0x31, 0xAA, 0xF1, 0x61, 0xD0 },
  307. { 0xC3, 0xFC, 0xD3, 0xD7, 0x61, 0x92, 0xE4, 0x00,
  308. 0x7D, 0xFB, 0x49, 0x6C, 0xCA, 0x67, 0xE1, 0x3B },
  309. { 0xD1, 0x74, 0xAB, 0x98, 0xD2, 0x77, 0xD9, 0xF5,
  310. 0xA5, 0x61, 0x1C, 0x2C, 0x9F, 0x41, 0x9D, 0x9F },
  311. { 0x57, 0xED, 0xF4, 0xA2, 0x2B, 0xE3, 0xC9, 0x55,
  312. 0xAC, 0x49, 0xDA, 0x2E, 0x21, 0x07, 0xB6, 0x7A }
  313. };
  314. /*
  315. * Checkup routine
  316. */
  317. int mbedtls_md5_self_test( int verbose )
  318. {
  319. int i;
  320. unsigned char md5sum[16];
  321. for( i = 0; i < 7; i++ )
  322. {
  323. if( verbose != 0 )
  324. mbedtls_printf( " MD5 test #%d: ", i + 1 );
  325. mbedtls_md5( md5_test_buf[i], md5_test_buflen[i], md5sum );
  326. if( memcmp( md5sum, md5_test_sum[i], 16 ) != 0 )
  327. {
  328. if( verbose != 0 )
  329. mbedtls_printf( "failed\n" );
  330. return( 1 );
  331. }
  332. if( verbose != 0 )
  333. mbedtls_printf( "passed\n" );
  334. }
  335. if( verbose != 0 )
  336. mbedtls_printf( "\n" );
  337. return( 0 );
  338. }
  339. #endif /* MBEDTLS_SELF_TEST */
  340. #endif /* MBEDTLS_MD5_C */