md5.c 13 KB

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