md5.c 14 KB

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