md4.c 12 KB

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