md5.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616
  1. /*
  2. * RFC 1321 compliant MD5 implementation
  3. *
  4. * Copyright (C) 2006-2014, 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 MD5 algorithm was designed by Ron Rivest in 1991.
  27. *
  28. * http://www.ietf.org/rfc/rfc1321.txt
  29. */
  30. #if !defined(POLARSSL_CONFIG_FILE)
  31. #include "polarssl/config.h"
  32. #else
  33. #include POLARSSL_CONFIG_FILE
  34. #endif
  35. #if defined(POLARSSL_MD5_C)
  36. #include "polarssl/md5.h"
  37. #if defined(POLARSSL_FS_IO) || defined(POLARSSL_SELF_TEST)
  38. #include <stdio.h>
  39. #endif
  40. #if defined(POLARSSL_PLATFORM_C)
  41. #include "polarssl/platform.h"
  42. #else
  43. #define polarssl_printf printf
  44. #endif
  45. /* Implementation that should never be optimized out by the compiler */
  46. static void polarssl_zeroize( void *v, size_t n ) {
  47. volatile unsigned char *p = v; while( n-- ) *p++ = 0;
  48. }
  49. #if !defined(POLARSSL_MD5_ALT)
  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) ); \
  66. (b)[(i) + 1] = (unsigned char) ( (n) >> 8 ); \
  67. (b)[(i) + 2] = (unsigned char) ( (n) >> 16 ); \
  68. (b)[(i) + 3] = (unsigned char) ( (n) >> 24 ); \
  69. }
  70. #endif
  71. void md5_init( md5_context *ctx )
  72. {
  73. memset( ctx, 0, sizeof( md5_context ) );
  74. }
  75. void md5_free( md5_context *ctx )
  76. {
  77. if( ctx == NULL )
  78. return;
  79. polarssl_zeroize( ctx, sizeof( md5_context ) );
  80. }
  81. /*
  82. * MD5 context setup
  83. */
  84. void md5_starts( md5_context *ctx )
  85. {
  86. ctx->total[0] = 0;
  87. ctx->total[1] = 0;
  88. ctx->state[0] = 0x67452301;
  89. ctx->state[1] = 0xEFCDAB89;
  90. ctx->state[2] = 0x98BADCFE;
  91. ctx->state[3] = 0x10325476;
  92. }
  93. void md5_process( md5_context *ctx, const unsigned char data[64] )
  94. {
  95. uint32_t X[16], A, B, C, D;
  96. GET_UINT32_LE( X[ 0], data, 0 );
  97. GET_UINT32_LE( X[ 1], data, 4 );
  98. GET_UINT32_LE( X[ 2], data, 8 );
  99. GET_UINT32_LE( X[ 3], data, 12 );
  100. GET_UINT32_LE( X[ 4], data, 16 );
  101. GET_UINT32_LE( X[ 5], data, 20 );
  102. GET_UINT32_LE( X[ 6], data, 24 );
  103. GET_UINT32_LE( X[ 7], data, 28 );
  104. GET_UINT32_LE( X[ 8], data, 32 );
  105. GET_UINT32_LE( X[ 9], data, 36 );
  106. GET_UINT32_LE( X[10], data, 40 );
  107. GET_UINT32_LE( X[11], data, 44 );
  108. GET_UINT32_LE( X[12], data, 48 );
  109. GET_UINT32_LE( X[13], data, 52 );
  110. GET_UINT32_LE( X[14], data, 56 );
  111. GET_UINT32_LE( X[15], data, 60 );
  112. #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  113. #define P(a,b,c,d,k,s,t) \
  114. { \
  115. a += F(b,c,d) + X[k] + t; a = S(a,s) + b; \
  116. }
  117. A = ctx->state[0];
  118. B = ctx->state[1];
  119. C = ctx->state[2];
  120. D = ctx->state[3];
  121. #define F(x,y,z) (z ^ (x & (y ^ z)))
  122. P( A, B, C, D, 0, 7, 0xD76AA478 );
  123. P( D, A, B, C, 1, 12, 0xE8C7B756 );
  124. P( C, D, A, B, 2, 17, 0x242070DB );
  125. P( B, C, D, A, 3, 22, 0xC1BDCEEE );
  126. P( A, B, C, D, 4, 7, 0xF57C0FAF );
  127. P( D, A, B, C, 5, 12, 0x4787C62A );
  128. P( C, D, A, B, 6, 17, 0xA8304613 );
  129. P( B, C, D, A, 7, 22, 0xFD469501 );
  130. P( A, B, C, D, 8, 7, 0x698098D8 );
  131. P( D, A, B, C, 9, 12, 0x8B44F7AF );
  132. P( C, D, A, B, 10, 17, 0xFFFF5BB1 );
  133. P( B, C, D, A, 11, 22, 0x895CD7BE );
  134. P( A, B, C, D, 12, 7, 0x6B901122 );
  135. P( D, A, B, C, 13, 12, 0xFD987193 );
  136. P( C, D, A, B, 14, 17, 0xA679438E );
  137. P( B, C, D, A, 15, 22, 0x49B40821 );
  138. #undef F
  139. #define F(x,y,z) (y ^ (z & (x ^ y)))
  140. P( A, B, C, D, 1, 5, 0xF61E2562 );
  141. P( D, A, B, C, 6, 9, 0xC040B340 );
  142. P( C, D, A, B, 11, 14, 0x265E5A51 );
  143. P( B, C, D, A, 0, 20, 0xE9B6C7AA );
  144. P( A, B, C, D, 5, 5, 0xD62F105D );
  145. P( D, A, B, C, 10, 9, 0x02441453 );
  146. P( C, D, A, B, 15, 14, 0xD8A1E681 );
  147. P( B, C, D, A, 4, 20, 0xE7D3FBC8 );
  148. P( A, B, C, D, 9, 5, 0x21E1CDE6 );
  149. P( D, A, B, C, 14, 9, 0xC33707D6 );
  150. P( C, D, A, B, 3, 14, 0xF4D50D87 );
  151. P( B, C, D, A, 8, 20, 0x455A14ED );
  152. P( A, B, C, D, 13, 5, 0xA9E3E905 );
  153. P( D, A, B, C, 2, 9, 0xFCEFA3F8 );
  154. P( C, D, A, B, 7, 14, 0x676F02D9 );
  155. P( B, C, D, A, 12, 20, 0x8D2A4C8A );
  156. #undef F
  157. #define F(x,y,z) (x ^ y ^ z)
  158. P( A, B, C, D, 5, 4, 0xFFFA3942 );
  159. P( D, A, B, C, 8, 11, 0x8771F681 );
  160. P( C, D, A, B, 11, 16, 0x6D9D6122 );
  161. P( B, C, D, A, 14, 23, 0xFDE5380C );
  162. P( A, B, C, D, 1, 4, 0xA4BEEA44 );
  163. P( D, A, B, C, 4, 11, 0x4BDECFA9 );
  164. P( C, D, A, B, 7, 16, 0xF6BB4B60 );
  165. P( B, C, D, A, 10, 23, 0xBEBFBC70 );
  166. P( A, B, C, D, 13, 4, 0x289B7EC6 );
  167. P( D, A, B, C, 0, 11, 0xEAA127FA );
  168. P( C, D, A, B, 3, 16, 0xD4EF3085 );
  169. P( B, C, D, A, 6, 23, 0x04881D05 );
  170. P( A, B, C, D, 9, 4, 0xD9D4D039 );
  171. P( D, A, B, C, 12, 11, 0xE6DB99E5 );
  172. P( C, D, A, B, 15, 16, 0x1FA27CF8 );
  173. P( B, C, D, A, 2, 23, 0xC4AC5665 );
  174. #undef F
  175. #define F(x,y,z) (y ^ (x | ~z))
  176. P( A, B, C, D, 0, 6, 0xF4292244 );
  177. P( D, A, B, C, 7, 10, 0x432AFF97 );
  178. P( C, D, A, B, 14, 15, 0xAB9423A7 );
  179. P( B, C, D, A, 5, 21, 0xFC93A039 );
  180. P( A, B, C, D, 12, 6, 0x655B59C3 );
  181. P( D, A, B, C, 3, 10, 0x8F0CCC92 );
  182. P( C, D, A, B, 10, 15, 0xFFEFF47D );
  183. P( B, C, D, A, 1, 21, 0x85845DD1 );
  184. P( A, B, C, D, 8, 6, 0x6FA87E4F );
  185. P( D, A, B, C, 15, 10, 0xFE2CE6E0 );
  186. P( C, D, A, B, 6, 15, 0xA3014314 );
  187. P( B, C, D, A, 13, 21, 0x4E0811A1 );
  188. P( A, B, C, D, 4, 6, 0xF7537E82 );
  189. P( D, A, B, C, 11, 10, 0xBD3AF235 );
  190. P( C, D, A, B, 2, 15, 0x2AD7D2BB );
  191. P( B, C, D, A, 9, 21, 0xEB86D391 );
  192. #undef F
  193. ctx->state[0] += A;
  194. ctx->state[1] += B;
  195. ctx->state[2] += C;
  196. ctx->state[3] += D;
  197. }
  198. /*
  199. * MD5 process buffer
  200. */
  201. void md5_update( md5_context *ctx, const unsigned char *input, size_t ilen )
  202. {
  203. size_t fill;
  204. uint32_t left;
  205. if( ilen == 0 )
  206. return;
  207. left = ctx->total[0] & 0x3F;
  208. fill = 64 - left;
  209. ctx->total[0] += (uint32_t) ilen;
  210. ctx->total[0] &= 0xFFFFFFFF;
  211. if( ctx->total[0] < (uint32_t) ilen )
  212. ctx->total[1]++;
  213. if( left && ilen >= fill )
  214. {
  215. memcpy( (void *) (ctx->buffer + left), input, fill );
  216. md5_process( ctx, ctx->buffer );
  217. input += fill;
  218. ilen -= fill;
  219. left = 0;
  220. }
  221. while( ilen >= 64 )
  222. {
  223. md5_process( ctx, input );
  224. input += 64;
  225. ilen -= 64;
  226. }
  227. if( ilen > 0 )
  228. {
  229. memcpy( (void *) (ctx->buffer + left), input, ilen );
  230. }
  231. }
  232. static const unsigned char md5_padding[64] =
  233. {
  234. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  235. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  236. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  237. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  238. };
  239. /*
  240. * MD5 final digest
  241. */
  242. void md5_finish( md5_context *ctx, unsigned char output[16] )
  243. {
  244. uint32_t last, padn;
  245. uint32_t high, low;
  246. unsigned char msglen[8];
  247. high = ( ctx->total[0] >> 29 )
  248. | ( ctx->total[1] << 3 );
  249. low = ( ctx->total[0] << 3 );
  250. PUT_UINT32_LE( low, msglen, 0 );
  251. PUT_UINT32_LE( high, msglen, 4 );
  252. last = ctx->total[0] & 0x3F;
  253. padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
  254. md5_update( ctx, md5_padding, padn );
  255. md5_update( ctx, msglen, 8 );
  256. PUT_UINT32_LE( ctx->state[0], output, 0 );
  257. PUT_UINT32_LE( ctx->state[1], output, 4 );
  258. PUT_UINT32_LE( ctx->state[2], output, 8 );
  259. PUT_UINT32_LE( ctx->state[3], output, 12 );
  260. }
  261. #endif /* !POLARSSL_MD5_ALT */
  262. /*
  263. * output = MD5( input buffer )
  264. */
  265. void md5( const unsigned char *input, size_t ilen, unsigned char output[16] )
  266. {
  267. md5_context ctx;
  268. md5_init( &ctx );
  269. md5_starts( &ctx );
  270. md5_update( &ctx, input, ilen );
  271. md5_finish( &ctx, output );
  272. md5_free( &ctx );
  273. }
  274. #if defined(POLARSSL_FS_IO)
  275. /*
  276. * output = MD5( file contents )
  277. */
  278. int md5_file( const char *path, unsigned char output[16] )
  279. {
  280. FILE *f;
  281. size_t n;
  282. md5_context ctx;
  283. unsigned char buf[1024];
  284. if( ( f = fopen( path, "rb" ) ) == NULL )
  285. return( POLARSSL_ERR_MD5_FILE_IO_ERROR );
  286. md5_init( &ctx );
  287. md5_starts( &ctx );
  288. while( ( n = fread( buf, 1, sizeof( buf ), f ) ) > 0 )
  289. md5_update( &ctx, buf, n );
  290. md5_finish( &ctx, output );
  291. md5_free( &ctx );
  292. if( ferror( f ) != 0 )
  293. {
  294. fclose( f );
  295. return( POLARSSL_ERR_MD5_FILE_IO_ERROR );
  296. }
  297. fclose( f );
  298. return( 0 );
  299. }
  300. #endif /* POLARSSL_FS_IO */
  301. /*
  302. * MD5 HMAC context setup
  303. */
  304. void md5_hmac_starts( md5_context *ctx, const unsigned char *key,
  305. size_t keylen )
  306. {
  307. size_t i;
  308. unsigned char sum[16];
  309. if( keylen > 64 )
  310. {
  311. md5( key, keylen, sum );
  312. keylen = 16;
  313. key = sum;
  314. }
  315. memset( ctx->ipad, 0x36, 64 );
  316. memset( ctx->opad, 0x5C, 64 );
  317. for( i = 0; i < keylen; i++ )
  318. {
  319. ctx->ipad[i] = (unsigned char)( ctx->ipad[i] ^ key[i] );
  320. ctx->opad[i] = (unsigned char)( ctx->opad[i] ^ key[i] );
  321. }
  322. md5_starts( ctx );
  323. md5_update( ctx, ctx->ipad, 64 );
  324. polarssl_zeroize( sum, sizeof( sum ) );
  325. }
  326. /*
  327. * MD5 HMAC process buffer
  328. */
  329. void md5_hmac_update( md5_context *ctx, const unsigned char *input,
  330. size_t ilen )
  331. {
  332. md5_update( ctx, input, ilen );
  333. }
  334. /*
  335. * MD5 HMAC final digest
  336. */
  337. void md5_hmac_finish( md5_context *ctx, unsigned char output[16] )
  338. {
  339. unsigned char tmpbuf[16];
  340. md5_finish( ctx, tmpbuf );
  341. md5_starts( ctx );
  342. md5_update( ctx, ctx->opad, 64 );
  343. md5_update( ctx, tmpbuf, 16 );
  344. md5_finish( ctx, output );
  345. polarssl_zeroize( tmpbuf, sizeof( tmpbuf ) );
  346. }
  347. /*
  348. * MD5 HMAC context reset
  349. */
  350. void md5_hmac_reset( md5_context *ctx )
  351. {
  352. md5_starts( ctx );
  353. md5_update( ctx, ctx->ipad, 64 );
  354. }
  355. /*
  356. * output = HMAC-MD5( hmac key, input buffer )
  357. */
  358. void md5_hmac( const unsigned char *key, size_t keylen,
  359. const unsigned char *input, size_t ilen,
  360. unsigned char output[16] )
  361. {
  362. md5_context ctx;
  363. md5_init( &ctx );
  364. md5_hmac_starts( &ctx, key, keylen );
  365. md5_hmac_update( &ctx, input, ilen );
  366. md5_hmac_finish( &ctx, output );
  367. md5_free( &ctx );
  368. }
  369. #if defined(POLARSSL_SELF_TEST)
  370. /*
  371. * RFC 1321 test vectors
  372. */
  373. static unsigned char md5_test_buf[7][81] =
  374. {
  375. { "" },
  376. { "a" },
  377. { "abc" },
  378. { "message digest" },
  379. { "abcdefghijklmnopqrstuvwxyz" },
  380. { "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789" },
  381. { "12345678901234567890123456789012345678901234567890123456789012" \
  382. "345678901234567890" }
  383. };
  384. static const int md5_test_buflen[7] =
  385. {
  386. 0, 1, 3, 14, 26, 62, 80
  387. };
  388. static const unsigned char md5_test_sum[7][16] =
  389. {
  390. { 0xD4, 0x1D, 0x8C, 0xD9, 0x8F, 0x00, 0xB2, 0x04,
  391. 0xE9, 0x80, 0x09, 0x98, 0xEC, 0xF8, 0x42, 0x7E },
  392. { 0x0C, 0xC1, 0x75, 0xB9, 0xC0, 0xF1, 0xB6, 0xA8,
  393. 0x31, 0xC3, 0x99, 0xE2, 0x69, 0x77, 0x26, 0x61 },
  394. { 0x90, 0x01, 0x50, 0x98, 0x3C, 0xD2, 0x4F, 0xB0,
  395. 0xD6, 0x96, 0x3F, 0x7D, 0x28, 0xE1, 0x7F, 0x72 },
  396. { 0xF9, 0x6B, 0x69, 0x7D, 0x7C, 0xB7, 0x93, 0x8D,
  397. 0x52, 0x5A, 0x2F, 0x31, 0xAA, 0xF1, 0x61, 0xD0 },
  398. { 0xC3, 0xFC, 0xD3, 0xD7, 0x61, 0x92, 0xE4, 0x00,
  399. 0x7D, 0xFB, 0x49, 0x6C, 0xCA, 0x67, 0xE1, 0x3B },
  400. { 0xD1, 0x74, 0xAB, 0x98, 0xD2, 0x77, 0xD9, 0xF5,
  401. 0xA5, 0x61, 0x1C, 0x2C, 0x9F, 0x41, 0x9D, 0x9F },
  402. { 0x57, 0xED, 0xF4, 0xA2, 0x2B, 0xE3, 0xC9, 0x55,
  403. 0xAC, 0x49, 0xDA, 0x2E, 0x21, 0x07, 0xB6, 0x7A }
  404. };
  405. /*
  406. * RFC 2202 test vectors
  407. */
  408. static unsigned char md5_hmac_test_key[7][26] =
  409. {
  410. { "\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B" },
  411. { "Jefe" },
  412. { "\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA" },
  413. { "\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0A\x0B\x0C\x0D\x0E\x0F\x10"
  414. "\x11\x12\x13\x14\x15\x16\x17\x18\x19" },
  415. { "\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C" },
  416. { "" }, /* 0xAA 80 times */
  417. { "" }
  418. };
  419. static const int md5_hmac_test_keylen[7] =
  420. {
  421. 16, 4, 16, 25, 16, 80, 80
  422. };
  423. static unsigned char md5_hmac_test_buf[7][74] =
  424. {
  425. { "Hi There" },
  426. { "what do ya want for nothing?" },
  427. { "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  428. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  429. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  430. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  431. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD" },
  432. { "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  433. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  434. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  435. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  436. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD" },
  437. { "Test With Truncation" },
  438. { "Test Using Larger Than Block-Size Key - Hash Key First" },
  439. { "Test Using Larger Than Block-Size Key and Larger"
  440. " Than One Block-Size Data" }
  441. };
  442. static const int md5_hmac_test_buflen[7] =
  443. {
  444. 8, 28, 50, 50, 20, 54, 73
  445. };
  446. static const unsigned char md5_hmac_test_sum[7][16] =
  447. {
  448. { 0x92, 0x94, 0x72, 0x7A, 0x36, 0x38, 0xBB, 0x1C,
  449. 0x13, 0xF4, 0x8E, 0xF8, 0x15, 0x8B, 0xFC, 0x9D },
  450. { 0x75, 0x0C, 0x78, 0x3E, 0x6A, 0xB0, 0xB5, 0x03,
  451. 0xEA, 0xA8, 0x6E, 0x31, 0x0A, 0x5D, 0xB7, 0x38 },
  452. { 0x56, 0xBE, 0x34, 0x52, 0x1D, 0x14, 0x4C, 0x88,
  453. 0xDB, 0xB8, 0xC7, 0x33, 0xF0, 0xE8, 0xB3, 0xF6 },
  454. { 0x69, 0x7E, 0xAF, 0x0A, 0xCA, 0x3A, 0x3A, 0xEA,
  455. 0x3A, 0x75, 0x16, 0x47, 0x46, 0xFF, 0xAA, 0x79 },
  456. { 0x56, 0x46, 0x1E, 0xF2, 0x34, 0x2E, 0xDC, 0x00,
  457. 0xF9, 0xBA, 0xB9, 0x95 },
  458. { 0x6B, 0x1A, 0xB7, 0xFE, 0x4B, 0xD7, 0xBF, 0x8F,
  459. 0x0B, 0x62, 0xE6, 0xCE, 0x61, 0xB9, 0xD0, 0xCD },
  460. { 0x6F, 0x63, 0x0F, 0xAD, 0x67, 0xCD, 0xA0, 0xEE,
  461. 0x1F, 0xB1, 0xF5, 0x62, 0xDB, 0x3A, 0xA5, 0x3E }
  462. };
  463. /*
  464. * Checkup routine
  465. */
  466. int md5_self_test( int verbose )
  467. {
  468. int i, buflen;
  469. unsigned char buf[1024];
  470. unsigned char md5sum[16];
  471. md5_context ctx;
  472. for( i = 0; i < 7; i++ )
  473. {
  474. if( verbose != 0 )
  475. polarssl_printf( " MD5 test #%d: ", i + 1 );
  476. md5( md5_test_buf[i], md5_test_buflen[i], md5sum );
  477. if( memcmp( md5sum, md5_test_sum[i], 16 ) != 0 )
  478. {
  479. if( verbose != 0 )
  480. polarssl_printf( "failed\n" );
  481. return( 1 );
  482. }
  483. if( verbose != 0 )
  484. polarssl_printf( "passed\n" );
  485. }
  486. if( verbose != 0 )
  487. polarssl_printf( "\n" );
  488. for( i = 0; i < 7; i++ )
  489. {
  490. if( verbose != 0 )
  491. polarssl_printf( " HMAC-MD5 test #%d: ", i + 1 );
  492. if( i == 5 || i == 6 )
  493. {
  494. memset( buf, '\xAA', buflen = 80 );
  495. md5_hmac_starts( &ctx, buf, buflen );
  496. }
  497. else
  498. md5_hmac_starts( &ctx, md5_hmac_test_key[i],
  499. md5_hmac_test_keylen[i] );
  500. md5_hmac_update( &ctx, md5_hmac_test_buf[i],
  501. md5_hmac_test_buflen[i] );
  502. md5_hmac_finish( &ctx, md5sum );
  503. buflen = ( i == 4 ) ? 12 : 16;
  504. if( memcmp( md5sum, md5_hmac_test_sum[i], buflen ) != 0 )
  505. {
  506. if( verbose != 0 )
  507. polarssl_printf( "failed\n" );
  508. return( 1 );
  509. }
  510. if( verbose != 0 )
  511. polarssl_printf( "passed\n" );
  512. }
  513. if( verbose != 0 )
  514. polarssl_printf( "\n" );
  515. return( 0 );
  516. }
  517. #endif /* POLARSSL_SELF_TEST */
  518. #endif /* POLARSSL_MD5_C */