md4.c 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387
  1. /*
  2. * RFC 1186/1320 compliant MD4 implementation
  3. *
  4. * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
  5. * SPDX-License-Identifier: GPL-2.0
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License along
  18. * with this program; if not, write to the Free Software Foundation, Inc.,
  19. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  20. *
  21. * This file is part of mbed TLS (https://tls.mbed.org)
  22. */
  23. /*
  24. * The MD4 algorithm was designed by Ron Rivest in 1990.
  25. *
  26. * http://www.ietf.org/rfc/rfc1186.txt
  27. * http://www.ietf.org/rfc/rfc1320.txt
  28. */
  29. #if !defined(MBEDTLS_CONFIG_FILE)
  30. #include "mbedtls/config.h"
  31. #else
  32. #include MBEDTLS_CONFIG_FILE
  33. #endif
  34. #if defined(MBEDTLS_MD4_C)
  35. #include "mbedtls/md4.h"
  36. #include <string.h>
  37. #if defined(MBEDTLS_SELF_TEST)
  38. #if defined(MBEDTLS_PLATFORM_C)
  39. #include "mbedtls/platform.h"
  40. #else
  41. #include <stdio.h>
  42. #define mbedtls_printf printf
  43. #endif /* MBEDTLS_PLATFORM_C */
  44. #endif /* MBEDTLS_SELF_TEST */
  45. #if !defined(MBEDTLS_MD4_ALT)
  46. /* Implementation that should never be optimized out by the compiler */
  47. static void mbedtls_zeroize( void *v, size_t n ) {
  48. volatile unsigned char *p = v; while( n-- ) *p++ = 0;
  49. }
  50. /*
  51. * 32-bit integer manipulation macros (little endian)
  52. */
  53. #ifndef GET_UINT32_LE
  54. #define GET_UINT32_LE(n,b,i) \
  55. { \
  56. (n) = ( (uint32_t) (b)[(i) ] ) \
  57. | ( (uint32_t) (b)[(i) + 1] << 8 ) \
  58. | ( (uint32_t) (b)[(i) + 2] << 16 ) \
  59. | ( (uint32_t) (b)[(i) + 3] << 24 ); \
  60. }
  61. #endif
  62. #ifndef PUT_UINT32_LE
  63. #define PUT_UINT32_LE(n,b,i) \
  64. { \
  65. (b)[(i) ] = (unsigned char) ( ( (n) ) & 0xFF ); \
  66. (b)[(i) + 1] = (unsigned char) ( ( (n) >> 8 ) & 0xFF ); \
  67. (b)[(i) + 2] = (unsigned char) ( ( (n) >> 16 ) & 0xFF ); \
  68. (b)[(i) + 3] = (unsigned char) ( ( (n) >> 24 ) & 0xFF ); \
  69. }
  70. #endif
  71. void mbedtls_md4_init( mbedtls_md4_context *ctx )
  72. {
  73. memset( ctx, 0, sizeof( mbedtls_md4_context ) );
  74. }
  75. void mbedtls_md4_free( mbedtls_md4_context *ctx )
  76. {
  77. if( ctx == NULL )
  78. return;
  79. mbedtls_zeroize( ctx, sizeof( mbedtls_md4_context ) );
  80. }
  81. void mbedtls_md4_clone( mbedtls_md4_context *dst,
  82. const mbedtls_md4_context *src )
  83. {
  84. *dst = *src;
  85. }
  86. /*
  87. * MD4 context setup
  88. */
  89. void mbedtls_md4_starts( mbedtls_md4_context *ctx )
  90. {
  91. ctx->total[0] = 0;
  92. ctx->total[1] = 0;
  93. ctx->state[0] = 0x67452301;
  94. ctx->state[1] = 0xEFCDAB89;
  95. ctx->state[2] = 0x98BADCFE;
  96. ctx->state[3] = 0x10325476;
  97. }
  98. #if !defined(MBEDTLS_MD4_PROCESS_ALT)
  99. void mbedtls_md4_process( mbedtls_md4_context *ctx, const unsigned char data[64] )
  100. {
  101. uint32_t X[16], A, B, C, D;
  102. GET_UINT32_LE( X[ 0], data, 0 );
  103. GET_UINT32_LE( X[ 1], data, 4 );
  104. GET_UINT32_LE( X[ 2], data, 8 );
  105. GET_UINT32_LE( X[ 3], data, 12 );
  106. GET_UINT32_LE( X[ 4], data, 16 );
  107. GET_UINT32_LE( X[ 5], data, 20 );
  108. GET_UINT32_LE( X[ 6], data, 24 );
  109. GET_UINT32_LE( X[ 7], data, 28 );
  110. GET_UINT32_LE( X[ 8], data, 32 );
  111. GET_UINT32_LE( X[ 9], data, 36 );
  112. GET_UINT32_LE( X[10], data, 40 );
  113. GET_UINT32_LE( X[11], data, 44 );
  114. GET_UINT32_LE( X[12], data, 48 );
  115. GET_UINT32_LE( X[13], data, 52 );
  116. GET_UINT32_LE( X[14], data, 56 );
  117. GET_UINT32_LE( X[15], data, 60 );
  118. #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  119. A = ctx->state[0];
  120. B = ctx->state[1];
  121. C = ctx->state[2];
  122. D = ctx->state[3];
  123. #define F(x, y, z) ((x & y) | ((~x) & z))
  124. #define P(a,b,c,d,x,s) { a += F(b,c,d) + x; a = S(a,s); }
  125. P( A, B, C, D, X[ 0], 3 );
  126. P( D, A, B, C, X[ 1], 7 );
  127. P( C, D, A, B, X[ 2], 11 );
  128. P( B, C, D, A, X[ 3], 19 );
  129. P( A, B, C, D, X[ 4], 3 );
  130. P( D, A, B, C, X[ 5], 7 );
  131. P( C, D, A, B, X[ 6], 11 );
  132. P( B, C, D, A, X[ 7], 19 );
  133. P( A, B, C, D, X[ 8], 3 );
  134. P( D, A, B, C, X[ 9], 7 );
  135. P( C, D, A, B, X[10], 11 );
  136. P( B, C, D, A, X[11], 19 );
  137. P( A, B, C, D, X[12], 3 );
  138. P( D, A, B, C, X[13], 7 );
  139. P( C, D, A, B, X[14], 11 );
  140. P( B, C, D, A, X[15], 19 );
  141. #undef P
  142. #undef F
  143. #define F(x,y,z) ((x & y) | (x & z) | (y & z))
  144. #define P(a,b,c,d,x,s) { a += F(b,c,d) + x + 0x5A827999; a = S(a,s); }
  145. P( A, B, C, D, X[ 0], 3 );
  146. P( D, A, B, C, X[ 4], 5 );
  147. P( C, D, A, B, X[ 8], 9 );
  148. P( B, C, D, A, X[12], 13 );
  149. P( A, B, C, D, X[ 1], 3 );
  150. P( D, A, B, C, X[ 5], 5 );
  151. P( C, D, A, B, X[ 9], 9 );
  152. P( B, C, D, A, X[13], 13 );
  153. P( A, B, C, D, X[ 2], 3 );
  154. P( D, A, B, C, X[ 6], 5 );
  155. P( C, D, A, B, X[10], 9 );
  156. P( B, C, D, A, X[14], 13 );
  157. P( A, B, C, D, X[ 3], 3 );
  158. P( D, A, B, C, X[ 7], 5 );
  159. P( C, D, A, B, X[11], 9 );
  160. P( B, C, D, A, X[15], 13 );
  161. #undef P
  162. #undef F
  163. #define F(x,y,z) (x ^ y ^ z)
  164. #define P(a,b,c,d,x,s) { a += F(b,c,d) + x + 0x6ED9EBA1; a = S(a,s); }
  165. P( A, B, C, D, X[ 0], 3 );
  166. P( D, A, B, C, X[ 8], 9 );
  167. P( C, D, A, B, X[ 4], 11 );
  168. P( B, C, D, A, X[12], 15 );
  169. P( A, B, C, D, X[ 2], 3 );
  170. P( D, A, B, C, X[10], 9 );
  171. P( C, D, A, B, X[ 6], 11 );
  172. P( B, C, D, A, X[14], 15 );
  173. P( A, B, C, D, X[ 1], 3 );
  174. P( D, A, B, C, X[ 9], 9 );
  175. P( C, D, A, B, X[ 5], 11 );
  176. P( B, C, D, A, X[13], 15 );
  177. P( A, B, C, D, X[ 3], 3 );
  178. P( D, A, B, C, X[11], 9 );
  179. P( C, D, A, B, X[ 7], 11 );
  180. P( B, C, D, A, X[15], 15 );
  181. #undef F
  182. #undef P
  183. ctx->state[0] += A;
  184. ctx->state[1] += B;
  185. ctx->state[2] += C;
  186. ctx->state[3] += D;
  187. }
  188. #endif /* !MBEDTLS_MD4_PROCESS_ALT */
  189. /*
  190. * MD4 process buffer
  191. */
  192. void mbedtls_md4_update( mbedtls_md4_context *ctx, const unsigned char *input, size_t ilen )
  193. {
  194. size_t fill;
  195. uint32_t left;
  196. if( ilen == 0 )
  197. return;
  198. left = ctx->total[0] & 0x3F;
  199. fill = 64 - left;
  200. ctx->total[0] += (uint32_t) ilen;
  201. ctx->total[0] &= 0xFFFFFFFF;
  202. if( ctx->total[0] < (uint32_t) ilen )
  203. ctx->total[1]++;
  204. if( left && ilen >= fill )
  205. {
  206. memcpy( (void *) (ctx->buffer + left),
  207. (void *) input, fill );
  208. mbedtls_md4_process( ctx, ctx->buffer );
  209. input += fill;
  210. ilen -= fill;
  211. left = 0;
  212. }
  213. while( ilen >= 64 )
  214. {
  215. mbedtls_md4_process( ctx, input );
  216. input += 64;
  217. ilen -= 64;
  218. }
  219. if( ilen > 0 )
  220. {
  221. memcpy( (void *) (ctx->buffer + left),
  222. (void *) input, ilen );
  223. }
  224. }
  225. static const unsigned char md4_padding[64] =
  226. {
  227. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  228. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  229. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  230. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  231. };
  232. /*
  233. * MD4 final digest
  234. */
  235. void mbedtls_md4_finish( mbedtls_md4_context *ctx, unsigned char output[16] )
  236. {
  237. uint32_t last, padn;
  238. uint32_t high, low;
  239. unsigned char msglen[8];
  240. high = ( ctx->total[0] >> 29 )
  241. | ( ctx->total[1] << 3 );
  242. low = ( ctx->total[0] << 3 );
  243. PUT_UINT32_LE( low, msglen, 0 );
  244. PUT_UINT32_LE( high, msglen, 4 );
  245. last = ctx->total[0] & 0x3F;
  246. padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
  247. mbedtls_md4_update( ctx, (unsigned char *) md4_padding, padn );
  248. mbedtls_md4_update( ctx, msglen, 8 );
  249. PUT_UINT32_LE( ctx->state[0], output, 0 );
  250. PUT_UINT32_LE( ctx->state[1], output, 4 );
  251. PUT_UINT32_LE( ctx->state[2], output, 8 );
  252. PUT_UINT32_LE( ctx->state[3], output, 12 );
  253. }
  254. #endif /* !MBEDTLS_MD4_ALT */
  255. /*
  256. * output = MD4( input buffer )
  257. */
  258. void mbedtls_md4( const unsigned char *input, size_t ilen, unsigned char output[16] )
  259. {
  260. mbedtls_md4_context ctx;
  261. mbedtls_md4_init( &ctx );
  262. mbedtls_md4_starts( &ctx );
  263. mbedtls_md4_update( &ctx, input, ilen );
  264. mbedtls_md4_finish( &ctx, output );
  265. mbedtls_md4_free( &ctx );
  266. }
  267. #if defined(MBEDTLS_SELF_TEST)
  268. /*
  269. * RFC 1320 test vectors
  270. */
  271. static const char md4_test_str[7][81] =
  272. {
  273. { "" },
  274. { "a" },
  275. { "abc" },
  276. { "message digest" },
  277. { "abcdefghijklmnopqrstuvwxyz" },
  278. { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
  279. { "12345678901234567890123456789012345678901234567890123456789012" \
  280. "345678901234567890" }
  281. };
  282. static const unsigned char md4_test_sum[7][16] =
  283. {
  284. { 0x31, 0xD6, 0xCF, 0xE0, 0xD1, 0x6A, 0xE9, 0x31,
  285. 0xB7, 0x3C, 0x59, 0xD7, 0xE0, 0xC0, 0x89, 0xC0 },
  286. { 0xBD, 0xE5, 0x2C, 0xB3, 0x1D, 0xE3, 0x3E, 0x46,
  287. 0x24, 0x5E, 0x05, 0xFB, 0xDB, 0xD6, 0xFB, 0x24 },
  288. { 0xA4, 0x48, 0x01, 0x7A, 0xAF, 0x21, 0xD8, 0x52,
  289. 0x5F, 0xC1, 0x0A, 0xE8, 0x7A, 0xA6, 0x72, 0x9D },
  290. { 0xD9, 0x13, 0x0A, 0x81, 0x64, 0x54, 0x9F, 0xE8,
  291. 0x18, 0x87, 0x48, 0x06, 0xE1, 0xC7, 0x01, 0x4B },
  292. { 0xD7, 0x9E, 0x1C, 0x30, 0x8A, 0xA5, 0xBB, 0xCD,
  293. 0xEE, 0xA8, 0xED, 0x63, 0xDF, 0x41, 0x2D, 0xA9 },
  294. { 0x04, 0x3F, 0x85, 0x82, 0xF2, 0x41, 0xDB, 0x35,
  295. 0x1C, 0xE6, 0x27, 0xE1, 0x53, 0xE7, 0xF0, 0xE4 },
  296. { 0xE3, 0x3B, 0x4D, 0xDC, 0x9C, 0x38, 0xF2, 0x19,
  297. 0x9C, 0x3E, 0x7B, 0x16, 0x4F, 0xCC, 0x05, 0x36 }
  298. };
  299. /*
  300. * Checkup routine
  301. */
  302. int mbedtls_md4_self_test( int verbose )
  303. {
  304. int i;
  305. unsigned char md4sum[16];
  306. for( i = 0; i < 7; i++ )
  307. {
  308. if( verbose != 0 )
  309. mbedtls_printf( " MD4 test #%d: ", i + 1 );
  310. mbedtls_md4( (unsigned char *) md4_test_str[i],
  311. strlen( md4_test_str[i] ), md4sum );
  312. if( memcmp( md4sum, md4_test_sum[i], 16 ) != 0 )
  313. {
  314. if( verbose != 0 )
  315. mbedtls_printf( "failed\n" );
  316. return( 1 );
  317. }
  318. if( verbose != 0 )
  319. mbedtls_printf( "passed\n" );
  320. }
  321. if( verbose != 0 )
  322. mbedtls_printf( "\n" );
  323. return( 0 );
  324. }
  325. #endif /* MBEDTLS_SELF_TEST */
  326. #endif /* MBEDTLS_MD4_C */