md5.c 13 KB

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