md4.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463
  1. /*
  2. * RFC 1186/1320 compliant MD4 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 MD4 algorithm was designed by Ron Rivest in 1990.
  21. *
  22. * http://www.ietf.org/rfc/rfc1186.txt
  23. * http://www.ietf.org/rfc/rfc1320.txt
  24. */
  25. #include "common.h"
  26. #if defined(MBEDTLS_MD4_C)
  27. #include "mbedtls/md4.h"
  28. #include "mbedtls/platform_util.h"
  29. #include "mbedtls/error.h"
  30. #include <string.h>
  31. #include "mbedtls/platform.h"
  32. #if !defined(MBEDTLS_MD4_ALT)
  33. void mbedtls_md4_init(mbedtls_md4_context *ctx)
  34. {
  35. memset(ctx, 0, sizeof(mbedtls_md4_context));
  36. }
  37. void mbedtls_md4_free(mbedtls_md4_context *ctx)
  38. {
  39. if (ctx == NULL) {
  40. return;
  41. }
  42. mbedtls_platform_zeroize(ctx, sizeof(mbedtls_md4_context));
  43. }
  44. void mbedtls_md4_clone(mbedtls_md4_context *dst,
  45. const mbedtls_md4_context *src)
  46. {
  47. *dst = *src;
  48. }
  49. /*
  50. * MD4 context setup
  51. */
  52. int mbedtls_md4_starts_ret(mbedtls_md4_context *ctx)
  53. {
  54. ctx->total[0] = 0;
  55. ctx->total[1] = 0;
  56. ctx->state[0] = 0x67452301;
  57. ctx->state[1] = 0xEFCDAB89;
  58. ctx->state[2] = 0x98BADCFE;
  59. ctx->state[3] = 0x10325476;
  60. return 0;
  61. }
  62. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  63. void mbedtls_md4_starts(mbedtls_md4_context *ctx)
  64. {
  65. mbedtls_md4_starts_ret(ctx);
  66. }
  67. #endif
  68. #if !defined(MBEDTLS_MD4_PROCESS_ALT)
  69. int mbedtls_internal_md4_process(mbedtls_md4_context *ctx,
  70. const unsigned char data[64])
  71. {
  72. struct {
  73. uint32_t X[16], A, B, C, D;
  74. } local;
  75. local.X[0] = MBEDTLS_GET_UINT32_LE(data, 0);
  76. local.X[1] = MBEDTLS_GET_UINT32_LE(data, 4);
  77. local.X[2] = MBEDTLS_GET_UINT32_LE(data, 8);
  78. local.X[3] = MBEDTLS_GET_UINT32_LE(data, 12);
  79. local.X[4] = MBEDTLS_GET_UINT32_LE(data, 16);
  80. local.X[5] = MBEDTLS_GET_UINT32_LE(data, 20);
  81. local.X[6] = MBEDTLS_GET_UINT32_LE(data, 24);
  82. local.X[7] = MBEDTLS_GET_UINT32_LE(data, 28);
  83. local.X[8] = MBEDTLS_GET_UINT32_LE(data, 32);
  84. local.X[9] = MBEDTLS_GET_UINT32_LE(data, 36);
  85. local.X[10] = MBEDTLS_GET_UINT32_LE(data, 40);
  86. local.X[11] = MBEDTLS_GET_UINT32_LE(data, 44);
  87. local.X[12] = MBEDTLS_GET_UINT32_LE(data, 48);
  88. local.X[13] = MBEDTLS_GET_UINT32_LE(data, 52);
  89. local.X[14] = MBEDTLS_GET_UINT32_LE(data, 56);
  90. local.X[15] = MBEDTLS_GET_UINT32_LE(data, 60);
  91. #define S(x, n) (((x) << (n)) | (((x) & 0xFFFFFFFF) >> (32 - (n))))
  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) (((x) & (y)) | ((~(x)) & (z)))
  97. #define P(a, b, c, d, x, s) \
  98. do \
  99. { \
  100. (a) += F((b), (c), (d)) + (x); \
  101. (a) = S((a), (s)); \
  102. } while (0)
  103. P(local.A, local.B, local.C, local.D, local.X[0], 3);
  104. P(local.D, local.A, local.B, local.C, local.X[1], 7);
  105. P(local.C, local.D, local.A, local.B, local.X[2], 11);
  106. P(local.B, local.C, local.D, local.A, local.X[3], 19);
  107. P(local.A, local.B, local.C, local.D, local.X[4], 3);
  108. P(local.D, local.A, local.B, local.C, local.X[5], 7);
  109. P(local.C, local.D, local.A, local.B, local.X[6], 11);
  110. P(local.B, local.C, local.D, local.A, local.X[7], 19);
  111. P(local.A, local.B, local.C, local.D, local.X[8], 3);
  112. P(local.D, local.A, local.B, local.C, local.X[9], 7);
  113. P(local.C, local.D, local.A, local.B, local.X[10], 11);
  114. P(local.B, local.C, local.D, local.A, local.X[11], 19);
  115. P(local.A, local.B, local.C, local.D, local.X[12], 3);
  116. P(local.D, local.A, local.B, local.C, local.X[13], 7);
  117. P(local.C, local.D, local.A, local.B, local.X[14], 11);
  118. P(local.B, local.C, local.D, local.A, local.X[15], 19);
  119. #undef P
  120. #undef F
  121. #define F(x, y, z) (((x) & (y)) | ((x) & (z)) | ((y) & (z)))
  122. #define P(a, b, c, d, x, s) \
  123. do \
  124. { \
  125. (a) += F((b), (c), (d)) + (x) + 0x5A827999; \
  126. (a) = S((a), (s)); \
  127. } while (0)
  128. P(local.A, local.B, local.C, local.D, local.X[0], 3);
  129. P(local.D, local.A, local.B, local.C, local.X[4], 5);
  130. P(local.C, local.D, local.A, local.B, local.X[8], 9);
  131. P(local.B, local.C, local.D, local.A, local.X[12], 13);
  132. P(local.A, local.B, local.C, local.D, local.X[1], 3);
  133. P(local.D, local.A, local.B, local.C, local.X[5], 5);
  134. P(local.C, local.D, local.A, local.B, local.X[9], 9);
  135. P(local.B, local.C, local.D, local.A, local.X[13], 13);
  136. P(local.A, local.B, local.C, local.D, local.X[2], 3);
  137. P(local.D, local.A, local.B, local.C, local.X[6], 5);
  138. P(local.C, local.D, local.A, local.B, local.X[10], 9);
  139. P(local.B, local.C, local.D, local.A, local.X[14], 13);
  140. P(local.A, local.B, local.C, local.D, local.X[3], 3);
  141. P(local.D, local.A, local.B, local.C, local.X[7], 5);
  142. P(local.C, local.D, local.A, local.B, local.X[11], 9);
  143. P(local.B, local.C, local.D, local.A, local.X[15], 13);
  144. #undef P
  145. #undef F
  146. #define F(x, y, z) ((x) ^ (y) ^ (z))
  147. #define P(a, b, c, d, x, s) \
  148. do \
  149. { \
  150. (a) += F((b), (c), (d)) + (x) + 0x6ED9EBA1; \
  151. (a) = S((a), (s)); \
  152. } while (0)
  153. P(local.A, local.B, local.C, local.D, local.X[0], 3);
  154. P(local.D, local.A, local.B, local.C, local.X[8], 9);
  155. P(local.C, local.D, local.A, local.B, local.X[4], 11);
  156. P(local.B, local.C, local.D, local.A, local.X[12], 15);
  157. P(local.A, local.B, local.C, local.D, local.X[2], 3);
  158. P(local.D, local.A, local.B, local.C, local.X[10], 9);
  159. P(local.C, local.D, local.A, local.B, local.X[6], 11);
  160. P(local.B, local.C, local.D, local.A, local.X[14], 15);
  161. P(local.A, local.B, local.C, local.D, local.X[1], 3);
  162. P(local.D, local.A, local.B, local.C, local.X[9], 9);
  163. P(local.C, local.D, local.A, local.B, local.X[5], 11);
  164. P(local.B, local.C, local.D, local.A, local.X[13], 15);
  165. P(local.A, local.B, local.C, local.D, local.X[3], 3);
  166. P(local.D, local.A, local.B, local.C, local.X[11], 9);
  167. P(local.C, local.D, local.A, local.B, local.X[7], 11);
  168. P(local.B, local.C, local.D, local.A, local.X[15], 15);
  169. #undef F
  170. #undef P
  171. ctx->state[0] += local.A;
  172. ctx->state[1] += local.B;
  173. ctx->state[2] += local.C;
  174. ctx->state[3] += local.D;
  175. /* Zeroise variables to clear sensitive data from memory. */
  176. mbedtls_platform_zeroize(&local, sizeof(local));
  177. return 0;
  178. }
  179. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  180. void mbedtls_md4_process(mbedtls_md4_context *ctx,
  181. const unsigned char data[64])
  182. {
  183. mbedtls_internal_md4_process(ctx, data);
  184. }
  185. #endif
  186. #endif /* !MBEDTLS_MD4_PROCESS_ALT */
  187. /*
  188. * MD4 process buffer
  189. */
  190. int mbedtls_md4_update_ret(mbedtls_md4_context *ctx,
  191. const unsigned char *input,
  192. size_t ilen)
  193. {
  194. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  195. size_t fill;
  196. uint32_t left;
  197. if (ilen == 0) {
  198. return 0;
  199. }
  200. left = ctx->total[0] & 0x3F;
  201. fill = 64 - left;
  202. ctx->total[0] += (uint32_t) ilen;
  203. ctx->total[0] &= 0xFFFFFFFF;
  204. if (ctx->total[0] < (uint32_t) ilen) {
  205. ctx->total[1]++;
  206. }
  207. if (left && ilen >= fill) {
  208. memcpy((void *) (ctx->buffer + left),
  209. (void *) input, fill);
  210. if ((ret = mbedtls_internal_md4_process(ctx, ctx->buffer)) != 0) {
  211. return ret;
  212. }
  213. input += fill;
  214. ilen -= fill;
  215. left = 0;
  216. }
  217. while (ilen >= 64) {
  218. if ((ret = mbedtls_internal_md4_process(ctx, input)) != 0) {
  219. return ret;
  220. }
  221. input += 64;
  222. ilen -= 64;
  223. }
  224. if (ilen > 0) {
  225. memcpy((void *) (ctx->buffer + left),
  226. (void *) input, ilen);
  227. }
  228. return 0;
  229. }
  230. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  231. void mbedtls_md4_update(mbedtls_md4_context *ctx,
  232. const unsigned char *input,
  233. size_t ilen)
  234. {
  235. mbedtls_md4_update_ret(ctx, input, ilen);
  236. }
  237. #endif
  238. static const unsigned char md4_padding[64] =
  239. {
  240. 0x80, 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. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  243. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  244. };
  245. /*
  246. * MD4 final digest
  247. */
  248. int mbedtls_md4_finish_ret(mbedtls_md4_context *ctx,
  249. unsigned char output[16])
  250. {
  251. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  252. uint32_t last, padn;
  253. uint32_t high, low;
  254. unsigned char msglen[8];
  255. high = (ctx->total[0] >> 29)
  256. | (ctx->total[1] << 3);
  257. low = (ctx->total[0] << 3);
  258. MBEDTLS_PUT_UINT32_LE(low, msglen, 0);
  259. MBEDTLS_PUT_UINT32_LE(high, msglen, 4);
  260. last = ctx->total[0] & 0x3F;
  261. padn = (last < 56) ? (56 - last) : (120 - last);
  262. ret = mbedtls_md4_update_ret(ctx, (unsigned char *) md4_padding, padn);
  263. if (ret != 0) {
  264. return ret;
  265. }
  266. if ((ret = mbedtls_md4_update_ret(ctx, msglen, 8)) != 0) {
  267. return ret;
  268. }
  269. MBEDTLS_PUT_UINT32_LE(ctx->state[0], output, 0);
  270. MBEDTLS_PUT_UINT32_LE(ctx->state[1], output, 4);
  271. MBEDTLS_PUT_UINT32_LE(ctx->state[2], output, 8);
  272. MBEDTLS_PUT_UINT32_LE(ctx->state[3], output, 12);
  273. return 0;
  274. }
  275. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  276. void mbedtls_md4_finish(mbedtls_md4_context *ctx,
  277. unsigned char output[16])
  278. {
  279. mbedtls_md4_finish_ret(ctx, output);
  280. }
  281. #endif
  282. #endif /* !MBEDTLS_MD4_ALT */
  283. /*
  284. * output = MD4( input buffer )
  285. */
  286. int mbedtls_md4_ret(const unsigned char *input,
  287. size_t ilen,
  288. unsigned char output[16])
  289. {
  290. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  291. mbedtls_md4_context ctx;
  292. mbedtls_md4_init(&ctx);
  293. if ((ret = mbedtls_md4_starts_ret(&ctx)) != 0) {
  294. goto exit;
  295. }
  296. if ((ret = mbedtls_md4_update_ret(&ctx, input, ilen)) != 0) {
  297. goto exit;
  298. }
  299. if ((ret = mbedtls_md4_finish_ret(&ctx, output)) != 0) {
  300. goto exit;
  301. }
  302. exit:
  303. mbedtls_md4_free(&ctx);
  304. return ret;
  305. }
  306. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  307. void mbedtls_md4(const unsigned char *input,
  308. size_t ilen,
  309. unsigned char output[16])
  310. {
  311. mbedtls_md4_ret(input, ilen, output);
  312. }
  313. #endif
  314. #if defined(MBEDTLS_SELF_TEST)
  315. /*
  316. * RFC 1320 test vectors
  317. */
  318. static const unsigned char md4_test_str[7][81] =
  319. {
  320. { "" },
  321. { "a" },
  322. { "abc" },
  323. { "message digest" },
  324. { "abcdefghijklmnopqrstuvwxyz" },
  325. { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
  326. { "12345678901234567890123456789012345678901234567890123456789012345678901234567890" }
  327. };
  328. static const size_t md4_test_strlen[7] =
  329. {
  330. 0, 1, 3, 14, 26, 62, 80
  331. };
  332. static const unsigned char md4_test_sum[7][16] =
  333. {
  334. { 0x31, 0xD6, 0xCF, 0xE0, 0xD1, 0x6A, 0xE9, 0x31,
  335. 0xB7, 0x3C, 0x59, 0xD7, 0xE0, 0xC0, 0x89, 0xC0 },
  336. { 0xBD, 0xE5, 0x2C, 0xB3, 0x1D, 0xE3, 0x3E, 0x46,
  337. 0x24, 0x5E, 0x05, 0xFB, 0xDB, 0xD6, 0xFB, 0x24 },
  338. { 0xA4, 0x48, 0x01, 0x7A, 0xAF, 0x21, 0xD8, 0x52,
  339. 0x5F, 0xC1, 0x0A, 0xE8, 0x7A, 0xA6, 0x72, 0x9D },
  340. { 0xD9, 0x13, 0x0A, 0x81, 0x64, 0x54, 0x9F, 0xE8,
  341. 0x18, 0x87, 0x48, 0x06, 0xE1, 0xC7, 0x01, 0x4B },
  342. { 0xD7, 0x9E, 0x1C, 0x30, 0x8A, 0xA5, 0xBB, 0xCD,
  343. 0xEE, 0xA8, 0xED, 0x63, 0xDF, 0x41, 0x2D, 0xA9 },
  344. { 0x04, 0x3F, 0x85, 0x82, 0xF2, 0x41, 0xDB, 0x35,
  345. 0x1C, 0xE6, 0x27, 0xE1, 0x53, 0xE7, 0xF0, 0xE4 },
  346. { 0xE3, 0x3B, 0x4D, 0xDC, 0x9C, 0x38, 0xF2, 0x19,
  347. 0x9C, 0x3E, 0x7B, 0x16, 0x4F, 0xCC, 0x05, 0x36 }
  348. };
  349. /*
  350. * Checkup routine
  351. */
  352. int mbedtls_md4_self_test(int verbose)
  353. {
  354. int i, ret = 0;
  355. unsigned char md4sum[16];
  356. for (i = 0; i < 7; i++) {
  357. if (verbose != 0) {
  358. mbedtls_printf(" MD4 test #%d: ", i + 1);
  359. }
  360. ret = mbedtls_md4_ret(md4_test_str[i], md4_test_strlen[i], md4sum);
  361. if (ret != 0) {
  362. goto fail;
  363. }
  364. if (memcmp(md4sum, md4_test_sum[i], 16) != 0) {
  365. ret = 1;
  366. goto fail;
  367. }
  368. if (verbose != 0) {
  369. mbedtls_printf("passed\n");
  370. }
  371. }
  372. if (verbose != 0) {
  373. mbedtls_printf("\n");
  374. }
  375. return 0;
  376. fail:
  377. if (verbose != 0) {
  378. mbedtls_printf("failed\n");
  379. }
  380. return ret;
  381. }
  382. #endif /* MBEDTLS_SELF_TEST */
  383. #endif /* MBEDTLS_MD4_C */