md4.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465
  1. /*
  2. * RFC 1186/1320 compliant MD4 implementation
  3. *
  4. * Copyright (C) 2006-2010, Brainspark B.V.
  5. *
  6. * This file is part of PolarSSL (http://www.polarssl.org)
  7. * Lead Maintainer: Paul Bakker <polarssl_maintainer at polarssl.org>
  8. *
  9. * All rights reserved.
  10. *
  11. * This program is free software; you can redistribute it and/or modify
  12. * it under the terms of the GNU General Public License as published by
  13. * the Free Software Foundation; either version 2 of the License, or
  14. * (at your option) any later version.
  15. *
  16. * This program is distributed in the hope that it will be useful,
  17. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  18. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  19. * GNU General Public License for more details.
  20. *
  21. * You should have received a copy of the GNU General Public License along
  22. * with this program; if not, write to the Free Software Foundation, Inc.,
  23. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  24. */
  25. /*
  26. * The MD4 algorithm was designed by Ron Rivest in 1990.
  27. *
  28. * http://www.ietf.org/rfc/rfc1186.txt
  29. * http://www.ietf.org/rfc/rfc1320.txt
  30. */
  31. #include "config.h"
  32. #if defined(POLARSSL_MD4_C)
  33. #include "polarssl/md4.h"
  34. #if defined(POLARSSL_FS_IO) || defined(POLARSSL_SELF_TEST)
  35. #ifdef PRINTF_STDLIB
  36. #include <stdio.h>
  37. #endif
  38. #ifdef PRINTF_CUSTOM
  39. #include "tinystdio.h"
  40. #endif
  41. #endif
  42. /*
  43. * 32-bit integer manipulation macros (little endian)
  44. */
  45. #ifndef GET_ULONG_LE
  46. #define GET_ULONG_LE(n,b,i) \
  47. { \
  48. (n) = ( (unsigned long) (b)[(i) ] ) \
  49. | ( (unsigned long) (b)[(i) + 1] << 8 ) \
  50. | ( (unsigned long) (b)[(i) + 2] << 16 ) \
  51. | ( (unsigned long) (b)[(i) + 3] << 24 ); \
  52. }
  53. #endif
  54. #ifndef PUT_ULONG_LE
  55. #define PUT_ULONG_LE(n,b,i) \
  56. { \
  57. (b)[(i) ] = (unsigned char) ( (n) ); \
  58. (b)[(i) + 1] = (unsigned char) ( (n) >> 8 ); \
  59. (b)[(i) + 2] = (unsigned char) ( (n) >> 16 ); \
  60. (b)[(i) + 3] = (unsigned char) ( (n) >> 24 ); \
  61. }
  62. #endif
  63. /*
  64. * MD4 context setup
  65. */
  66. void md4_starts( md4_context *ctx )
  67. {
  68. ctx->total[0] = 0;
  69. ctx->total[1] = 0;
  70. ctx->state[0] = 0x67452301;
  71. ctx->state[1] = 0xEFCDAB89;
  72. ctx->state[2] = 0x98BADCFE;
  73. ctx->state[3] = 0x10325476;
  74. }
  75. static void md4_process( md4_context *ctx, const unsigned char data[64] )
  76. {
  77. unsigned long X[16], A, B, C, D;
  78. GET_ULONG_LE( X[ 0], data, 0 );
  79. GET_ULONG_LE( X[ 1], data, 4 );
  80. GET_ULONG_LE( X[ 2], data, 8 );
  81. GET_ULONG_LE( X[ 3], data, 12 );
  82. GET_ULONG_LE( X[ 4], data, 16 );
  83. GET_ULONG_LE( X[ 5], data, 20 );
  84. GET_ULONG_LE( X[ 6], data, 24 );
  85. GET_ULONG_LE( X[ 7], data, 28 );
  86. GET_ULONG_LE( X[ 8], data, 32 );
  87. GET_ULONG_LE( X[ 9], data, 36 );
  88. GET_ULONG_LE( X[10], data, 40 );
  89. GET_ULONG_LE( X[11], data, 44 );
  90. GET_ULONG_LE( X[12], data, 48 );
  91. GET_ULONG_LE( X[13], data, 52 );
  92. GET_ULONG_LE( X[14], data, 56 );
  93. GET_ULONG_LE( X[15], data, 60 );
  94. #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  95. A = ctx->state[0];
  96. B = ctx->state[1];
  97. C = ctx->state[2];
  98. D = ctx->state[3];
  99. #define F(x, y, z) ((x & y) | ((~x) & z))
  100. #define P(a,b,c,d,x,s) { a += F(b,c,d) + x; a = S(a,s); }
  101. P( A, B, C, D, X[ 0], 3 );
  102. P( D, A, B, C, X[ 1], 7 );
  103. P( C, D, A, B, X[ 2], 11 );
  104. P( B, C, D, A, X[ 3], 19 );
  105. P( A, B, C, D, X[ 4], 3 );
  106. P( D, A, B, C, X[ 5], 7 );
  107. P( C, D, A, B, X[ 6], 11 );
  108. P( B, C, D, A, X[ 7], 19 );
  109. P( A, B, C, D, X[ 8], 3 );
  110. P( D, A, B, C, X[ 9], 7 );
  111. P( C, D, A, B, X[10], 11 );
  112. P( B, C, D, A, X[11], 19 );
  113. P( A, B, C, D, X[12], 3 );
  114. P( D, A, B, C, X[13], 7 );
  115. P( C, D, A, B, X[14], 11 );
  116. P( B, C, D, A, X[15], 19 );
  117. #undef P
  118. #undef F
  119. #define F(x,y,z) ((x & y) | (x & z) | (y & z))
  120. #define P(a,b,c,d,x,s) { a += F(b,c,d) + x + 0x5A827999; a = S(a,s); }
  121. P( A, B, C, D, X[ 0], 3 );
  122. P( D, A, B, C, X[ 4], 5 );
  123. P( C, D, A, B, X[ 8], 9 );
  124. P( B, C, D, A, X[12], 13 );
  125. P( A, B, C, D, X[ 1], 3 );
  126. P( D, A, B, C, X[ 5], 5 );
  127. P( C, D, A, B, X[ 9], 9 );
  128. P( B, C, D, A, X[13], 13 );
  129. P( A, B, C, D, X[ 2], 3 );
  130. P( D, A, B, C, X[ 6], 5 );
  131. P( C, D, A, B, X[10], 9 );
  132. P( B, C, D, A, X[14], 13 );
  133. P( A, B, C, D, X[ 3], 3 );
  134. P( D, A, B, C, X[ 7], 5 );
  135. P( C, D, A, B, X[11], 9 );
  136. P( B, C, D, A, X[15], 13 );
  137. #undef P
  138. #undef F
  139. #define F(x,y,z) (x ^ y ^ z)
  140. #define P(a,b,c,d,x,s) { a += F(b,c,d) + x + 0x6ED9EBA1; a = S(a,s); }
  141. P( A, B, C, D, X[ 0], 3 );
  142. P( D, A, B, C, X[ 8], 9 );
  143. P( C, D, A, B, X[ 4], 11 );
  144. P( B, C, D, A, X[12], 15 );
  145. P( A, B, C, D, X[ 2], 3 );
  146. P( D, A, B, C, X[10], 9 );
  147. P( C, D, A, B, X[ 6], 11 );
  148. P( B, C, D, A, X[14], 15 );
  149. P( A, B, C, D, X[ 1], 3 );
  150. P( D, A, B, C, X[ 9], 9 );
  151. P( C, D, A, B, X[ 5], 11 );
  152. P( B, C, D, A, X[13], 15 );
  153. P( A, B, C, D, X[ 3], 3 );
  154. P( D, A, B, C, X[11], 9 );
  155. P( C, D, A, B, X[ 7], 11 );
  156. P( B, C, D, A, X[15], 15 );
  157. #undef F
  158. #undef P
  159. ctx->state[0] += A;
  160. ctx->state[1] += B;
  161. ctx->state[2] += C;
  162. ctx->state[3] += D;
  163. }
  164. /*
  165. * MD4 process buffer
  166. */
  167. void md4_update( md4_context *ctx, const unsigned char *input, size_t ilen )
  168. {
  169. size_t fill;
  170. unsigned long left;
  171. if( ilen <= 0 )
  172. return;
  173. left = ctx->total[0] & 0x3F;
  174. fill = 64 - left;
  175. ctx->total[0] += (unsigned long) ilen;
  176. ctx->total[0] &= 0xFFFFFFFF;
  177. if( ctx->total[0] < (unsigned long) ilen )
  178. ctx->total[1]++;
  179. if( left && ilen >= fill )
  180. {
  181. memcpy( (void *) (ctx->buffer + left),
  182. (void *) input, fill );
  183. md4_process( ctx, ctx->buffer );
  184. input += fill;
  185. ilen -= fill;
  186. left = 0;
  187. }
  188. while( ilen >= 64 )
  189. {
  190. md4_process( ctx, input );
  191. input += 64;
  192. ilen -= 64;
  193. }
  194. if( ilen > 0 )
  195. {
  196. memcpy( (void *) (ctx->buffer + left),
  197. (void *) input, ilen );
  198. }
  199. }
  200. static const unsigned char md4_padding[64] =
  201. {
  202. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  203. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  204. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  205. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  206. };
  207. /*
  208. * MD4 final digest
  209. */
  210. void md4_finish( md4_context *ctx, unsigned char output[16] )
  211. {
  212. unsigned long last, padn;
  213. unsigned long high, low;
  214. unsigned char msglen[8];
  215. high = ( ctx->total[0] >> 29 )
  216. | ( ctx->total[1] << 3 );
  217. low = ( ctx->total[0] << 3 );
  218. PUT_ULONG_LE( low, msglen, 0 );
  219. PUT_ULONG_LE( high, msglen, 4 );
  220. last = ctx->total[0] & 0x3F;
  221. padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
  222. md4_update( ctx, (unsigned char *) md4_padding, padn );
  223. md4_update( ctx, msglen, 8 );
  224. PUT_ULONG_LE( ctx->state[0], output, 0 );
  225. PUT_ULONG_LE( ctx->state[1], output, 4 );
  226. PUT_ULONG_LE( ctx->state[2], output, 8 );
  227. PUT_ULONG_LE( ctx->state[3], output, 12 );
  228. }
  229. /*
  230. * output = MD4( input buffer )
  231. */
  232. void md4( const unsigned char *input, size_t ilen, unsigned char output[16] )
  233. {
  234. md4_context ctx;
  235. md4_starts( &ctx );
  236. md4_update( &ctx, input, ilen );
  237. md4_finish( &ctx, output );
  238. memset( &ctx, 0, sizeof( md4_context ) );
  239. }
  240. #if defined(POLARSSL_FS_IO)
  241. /*
  242. * output = MD4( file contents )
  243. */
  244. int md4_file( const char *path, unsigned char output[16] )
  245. {
  246. FILE *f;
  247. size_t n;
  248. md4_context ctx;
  249. unsigned char buf[1024];
  250. if( ( f = fopen( path, "rb" ) ) == NULL )
  251. return( 1 );
  252. md4_starts( &ctx );
  253. while( ( n = fread( buf, 1, sizeof( buf ), f ) ) > 0 )
  254. md4_update( &ctx, buf, n );
  255. md4_finish( &ctx, output );
  256. memset( &ctx, 0, sizeof( md4_context ) );
  257. if( ferror( f ) != 0 )
  258. {
  259. fclose( f );
  260. return( 2 );
  261. }
  262. fclose( f );
  263. return( 0 );
  264. }
  265. #endif /* POLARSSL_FS_IO */
  266. /*
  267. * MD4 HMAC context setup
  268. */
  269. void md4_hmac_starts( md4_context *ctx, const unsigned char *key, size_t keylen )
  270. {
  271. size_t i;
  272. unsigned char sum[16];
  273. if( keylen > 64 )
  274. {
  275. md4( key, keylen, sum );
  276. keylen = 16;
  277. key = sum;
  278. }
  279. memset( ctx->ipad, 0x36, 64 );
  280. memset( ctx->opad, 0x5C, 64 );
  281. for( i = 0; i < keylen; i++ )
  282. {
  283. ctx->ipad[i] = (unsigned char)( ctx->ipad[i] ^ key[i] );
  284. ctx->opad[i] = (unsigned char)( ctx->opad[i] ^ key[i] );
  285. }
  286. md4_starts( ctx );
  287. md4_update( ctx, ctx->ipad, 64 );
  288. memset( sum, 0, sizeof( sum ) );
  289. }
  290. /*
  291. * MD4 HMAC process buffer
  292. */
  293. void md4_hmac_update( md4_context *ctx, const unsigned char *input, size_t ilen )
  294. {
  295. md4_update( ctx, input, ilen );
  296. }
  297. /*
  298. * MD4 HMAC final digest
  299. */
  300. void md4_hmac_finish( md4_context *ctx, unsigned char output[16] )
  301. {
  302. unsigned char tmpbuf[16];
  303. md4_finish( ctx, tmpbuf );
  304. md4_starts( ctx );
  305. md4_update( ctx, ctx->opad, 64 );
  306. md4_update( ctx, tmpbuf, 16 );
  307. md4_finish( ctx, output );
  308. memset( tmpbuf, 0, sizeof( tmpbuf ) );
  309. }
  310. /*
  311. * MD4 HMAC context reset
  312. */
  313. void md4_hmac_reset( md4_context *ctx )
  314. {
  315. md4_starts( ctx );
  316. md4_update( ctx, ctx->ipad, 64 );
  317. }
  318. /*
  319. * output = HMAC-MD4( hmac key, input buffer )
  320. */
  321. void md4_hmac( const unsigned char *key, size_t keylen,
  322. const unsigned char *input, size_t ilen,
  323. unsigned char output[16] )
  324. {
  325. md4_context ctx;
  326. md4_hmac_starts( &ctx, key, keylen );
  327. md4_hmac_update( &ctx, input, ilen );
  328. md4_hmac_finish( &ctx, output );
  329. memset( &ctx, 0, sizeof( md4_context ) );
  330. }
  331. #if defined(POLARSSL_SELF_TEST)
  332. /*
  333. * RFC 1320 test vectors
  334. */
  335. static const char md4_test_str[7][81] =
  336. {
  337. { "" },
  338. { "a" },
  339. { "abc" },
  340. { "message digest" },
  341. { "abcdefghijklmnopqrstuvwxyz" },
  342. { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
  343. { "12345678901234567890123456789012345678901234567890123456789012" \
  344. "345678901234567890" }
  345. };
  346. static const unsigned char md4_test_sum[7][16] =
  347. {
  348. { 0x31, 0xD6, 0xCF, 0xE0, 0xD1, 0x6A, 0xE9, 0x31,
  349. 0xB7, 0x3C, 0x59, 0xD7, 0xE0, 0xC0, 0x89, 0xC0 },
  350. { 0xBD, 0xE5, 0x2C, 0xB3, 0x1D, 0xE3, 0x3E, 0x46,
  351. 0x24, 0x5E, 0x05, 0xFB, 0xDB, 0xD6, 0xFB, 0x24 },
  352. { 0xA4, 0x48, 0x01, 0x7A, 0xAF, 0x21, 0xD8, 0x52,
  353. 0x5F, 0xC1, 0x0A, 0xE8, 0x7A, 0xA6, 0x72, 0x9D },
  354. { 0xD9, 0x13, 0x0A, 0x81, 0x64, 0x54, 0x9F, 0xE8,
  355. 0x18, 0x87, 0x48, 0x06, 0xE1, 0xC7, 0x01, 0x4B },
  356. { 0xD7, 0x9E, 0x1C, 0x30, 0x8A, 0xA5, 0xBB, 0xCD,
  357. 0xEE, 0xA8, 0xED, 0x63, 0xDF, 0x41, 0x2D, 0xA9 },
  358. { 0x04, 0x3F, 0x85, 0x82, 0xF2, 0x41, 0xDB, 0x35,
  359. 0x1C, 0xE6, 0x27, 0xE1, 0x53, 0xE7, 0xF0, 0xE4 },
  360. { 0xE3, 0x3B, 0x4D, 0xDC, 0x9C, 0x38, 0xF2, 0x19,
  361. 0x9C, 0x3E, 0x7B, 0x16, 0x4F, 0xCC, 0x05, 0x36 }
  362. };
  363. /*
  364. * Checkup routine
  365. */
  366. int md4_self_test( int verbose )
  367. {
  368. int i;
  369. unsigned char md4sum[16];
  370. for( i = 0; i < 7; i++ )
  371. {
  372. if( verbose != 0 )
  373. printf( " MD4 test #%d: ", i + 1 );
  374. md4( (unsigned char *) md4_test_str[i],
  375. strlen( md4_test_str[i] ), md4sum );
  376. if( memcmp( md4sum, md4_test_sum[i], 16 ) != 0 )
  377. {
  378. if( verbose != 0 )
  379. printf( "failed\n" );
  380. return( 1 );
  381. }
  382. if( verbose != 0 )
  383. printf( "passed\n" );
  384. }
  385. if( verbose != 0 )
  386. printf( "\n" );
  387. return( 0 );
  388. }
  389. #endif
  390. #endif