md5.c 19 KB

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