sha2.c 22 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710
  1. /*
  2. * FIPS-180-2 compliant SHA-256 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 SHA-256 Secure Hash Standard was published by NIST in 2002.
  27. *
  28. * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
  29. */
  30. #include "config.h"
  31. #if defined(POLARSSL_SHA2_C)
  32. #include "polarssl/sha2.h"
  33. #if defined(POLARSSL_FS_IO) || defined(POLARSSL_SELF_TEST)
  34. #ifdef PRINTF_STDLIB
  35. #include <stdio.h>
  36. #endif
  37. #ifdef PRINTF_CUSTOM
  38. #include "tinystdio.h"
  39. #endif
  40. #endif
  41. /*
  42. * 32-bit integer manipulation macros (big endian)
  43. */
  44. #ifndef GET_ULONG_BE
  45. #define GET_ULONG_BE(n,b,i) \
  46. { \
  47. (n) = ( (unsigned long) (b)[(i) ] << 24 ) \
  48. | ( (unsigned long) (b)[(i) + 1] << 16 ) \
  49. | ( (unsigned long) (b)[(i) + 2] << 8 ) \
  50. | ( (unsigned long) (b)[(i) + 3] ); \
  51. }
  52. #endif
  53. #ifndef PUT_ULONG_BE
  54. #define PUT_ULONG_BE(n,b,i) \
  55. { \
  56. (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
  57. (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
  58. (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
  59. (b)[(i) + 3] = (unsigned char) ( (n) ); \
  60. }
  61. #endif
  62. /*
  63. * SHA-256 context setup
  64. */
  65. void sha2_starts( sha2_context *ctx, int is224 )
  66. {
  67. ctx->total[0] = 0;
  68. ctx->total[1] = 0;
  69. if( is224 == 0 )
  70. {
  71. /* SHA-256 */
  72. ctx->state[0] = 0x6A09E667;
  73. ctx->state[1] = 0xBB67AE85;
  74. ctx->state[2] = 0x3C6EF372;
  75. ctx->state[3] = 0xA54FF53A;
  76. ctx->state[4] = 0x510E527F;
  77. ctx->state[5] = 0x9B05688C;
  78. ctx->state[6] = 0x1F83D9AB;
  79. ctx->state[7] = 0x5BE0CD19;
  80. }
  81. else
  82. {
  83. /* SHA-224 */
  84. ctx->state[0] = 0xC1059ED8;
  85. ctx->state[1] = 0x367CD507;
  86. ctx->state[2] = 0x3070DD17;
  87. ctx->state[3] = 0xF70E5939;
  88. ctx->state[4] = 0xFFC00B31;
  89. ctx->state[5] = 0x68581511;
  90. ctx->state[6] = 0x64F98FA7;
  91. ctx->state[7] = 0xBEFA4FA4;
  92. }
  93. ctx->is224 = is224;
  94. }
  95. static void sha2_process( sha2_context *ctx, const unsigned char data[64] )
  96. {
  97. unsigned long temp1, temp2, W[64];
  98. unsigned long A, B, C, D, E, F, G, H;
  99. GET_ULONG_BE( W[ 0], data, 0 );
  100. GET_ULONG_BE( W[ 1], data, 4 );
  101. GET_ULONG_BE( W[ 2], data, 8 );
  102. GET_ULONG_BE( W[ 3], data, 12 );
  103. GET_ULONG_BE( W[ 4], data, 16 );
  104. GET_ULONG_BE( W[ 5], data, 20 );
  105. GET_ULONG_BE( W[ 6], data, 24 );
  106. GET_ULONG_BE( W[ 7], data, 28 );
  107. GET_ULONG_BE( W[ 8], data, 32 );
  108. GET_ULONG_BE( W[ 9], data, 36 );
  109. GET_ULONG_BE( W[10], data, 40 );
  110. GET_ULONG_BE( W[11], data, 44 );
  111. GET_ULONG_BE( W[12], data, 48 );
  112. GET_ULONG_BE( W[13], data, 52 );
  113. GET_ULONG_BE( W[14], data, 56 );
  114. GET_ULONG_BE( W[15], data, 60 );
  115. #define SHR(x,n) ((x & 0xFFFFFFFF) >> n)
  116. #define ROTR(x,n) (SHR(x,n) | (x << (32 - n)))
  117. #define S0(x) (ROTR(x, 7) ^ ROTR(x,18) ^ SHR(x, 3))
  118. #define S1(x) (ROTR(x,17) ^ ROTR(x,19) ^ SHR(x,10))
  119. #define S2(x) (ROTR(x, 2) ^ ROTR(x,13) ^ ROTR(x,22))
  120. #define S3(x) (ROTR(x, 6) ^ ROTR(x,11) ^ ROTR(x,25))
  121. #define F0(x,y,z) ((x & y) | (z & (x | y)))
  122. #define F1(x,y,z) (z ^ (x & (y ^ z)))
  123. #define R(t) \
  124. ( \
  125. W[t] = S1(W[t - 2]) + W[t - 7] + \
  126. S0(W[t - 15]) + W[t - 16] \
  127. )
  128. #define P(a,b,c,d,e,f,g,h,x,K) \
  129. { \
  130. temp1 = h + S3(e) + F1(e,f,g) + K + x; \
  131. temp2 = S2(a) + F0(a,b,c); \
  132. d += temp1; h = temp1 + temp2; \
  133. }
  134. A = ctx->state[0];
  135. B = ctx->state[1];
  136. C = ctx->state[2];
  137. D = ctx->state[3];
  138. E = ctx->state[4];
  139. F = ctx->state[5];
  140. G = ctx->state[6];
  141. H = ctx->state[7];
  142. P( A, B, C, D, E, F, G, H, W[ 0], 0x428A2F98 );
  143. P( H, A, B, C, D, E, F, G, W[ 1], 0x71374491 );
  144. P( G, H, A, B, C, D, E, F, W[ 2], 0xB5C0FBCF );
  145. P( F, G, H, A, B, C, D, E, W[ 3], 0xE9B5DBA5 );
  146. P( E, F, G, H, A, B, C, D, W[ 4], 0x3956C25B );
  147. P( D, E, F, G, H, A, B, C, W[ 5], 0x59F111F1 );
  148. P( C, D, E, F, G, H, A, B, W[ 6], 0x923F82A4 );
  149. P( B, C, D, E, F, G, H, A, W[ 7], 0xAB1C5ED5 );
  150. P( A, B, C, D, E, F, G, H, W[ 8], 0xD807AA98 );
  151. P( H, A, B, C, D, E, F, G, W[ 9], 0x12835B01 );
  152. P( G, H, A, B, C, D, E, F, W[10], 0x243185BE );
  153. P( F, G, H, A, B, C, D, E, W[11], 0x550C7DC3 );
  154. P( E, F, G, H, A, B, C, D, W[12], 0x72BE5D74 );
  155. P( D, E, F, G, H, A, B, C, W[13], 0x80DEB1FE );
  156. P( C, D, E, F, G, H, A, B, W[14], 0x9BDC06A7 );
  157. P( B, C, D, E, F, G, H, A, W[15], 0xC19BF174 );
  158. P( A, B, C, D, E, F, G, H, R(16), 0xE49B69C1 );
  159. P( H, A, B, C, D, E, F, G, R(17), 0xEFBE4786 );
  160. P( G, H, A, B, C, D, E, F, R(18), 0x0FC19DC6 );
  161. P( F, G, H, A, B, C, D, E, R(19), 0x240CA1CC );
  162. P( E, F, G, H, A, B, C, D, R(20), 0x2DE92C6F );
  163. P( D, E, F, G, H, A, B, C, R(21), 0x4A7484AA );
  164. P( C, D, E, F, G, H, A, B, R(22), 0x5CB0A9DC );
  165. P( B, C, D, E, F, G, H, A, R(23), 0x76F988DA );
  166. P( A, B, C, D, E, F, G, H, R(24), 0x983E5152 );
  167. P( H, A, B, C, D, E, F, G, R(25), 0xA831C66D );
  168. P( G, H, A, B, C, D, E, F, R(26), 0xB00327C8 );
  169. P( F, G, H, A, B, C, D, E, R(27), 0xBF597FC7 );
  170. P( E, F, G, H, A, B, C, D, R(28), 0xC6E00BF3 );
  171. P( D, E, F, G, H, A, B, C, R(29), 0xD5A79147 );
  172. P( C, D, E, F, G, H, A, B, R(30), 0x06CA6351 );
  173. P( B, C, D, E, F, G, H, A, R(31), 0x14292967 );
  174. P( A, B, C, D, E, F, G, H, R(32), 0x27B70A85 );
  175. P( H, A, B, C, D, E, F, G, R(33), 0x2E1B2138 );
  176. P( G, H, A, B, C, D, E, F, R(34), 0x4D2C6DFC );
  177. P( F, G, H, A, B, C, D, E, R(35), 0x53380D13 );
  178. P( E, F, G, H, A, B, C, D, R(36), 0x650A7354 );
  179. P( D, E, F, G, H, A, B, C, R(37), 0x766A0ABB );
  180. P( C, D, E, F, G, H, A, B, R(38), 0x81C2C92E );
  181. P( B, C, D, E, F, G, H, A, R(39), 0x92722C85 );
  182. P( A, B, C, D, E, F, G, H, R(40), 0xA2BFE8A1 );
  183. P( H, A, B, C, D, E, F, G, R(41), 0xA81A664B );
  184. P( G, H, A, B, C, D, E, F, R(42), 0xC24B8B70 );
  185. P( F, G, H, A, B, C, D, E, R(43), 0xC76C51A3 );
  186. P( E, F, G, H, A, B, C, D, R(44), 0xD192E819 );
  187. P( D, E, F, G, H, A, B, C, R(45), 0xD6990624 );
  188. P( C, D, E, F, G, H, A, B, R(46), 0xF40E3585 );
  189. P( B, C, D, E, F, G, H, A, R(47), 0x106AA070 );
  190. P( A, B, C, D, E, F, G, H, R(48), 0x19A4C116 );
  191. P( H, A, B, C, D, E, F, G, R(49), 0x1E376C08 );
  192. P( G, H, A, B, C, D, E, F, R(50), 0x2748774C );
  193. P( F, G, H, A, B, C, D, E, R(51), 0x34B0BCB5 );
  194. P( E, F, G, H, A, B, C, D, R(52), 0x391C0CB3 );
  195. P( D, E, F, G, H, A, B, C, R(53), 0x4ED8AA4A );
  196. P( C, D, E, F, G, H, A, B, R(54), 0x5B9CCA4F );
  197. P( B, C, D, E, F, G, H, A, R(55), 0x682E6FF3 );
  198. P( A, B, C, D, E, F, G, H, R(56), 0x748F82EE );
  199. P( H, A, B, C, D, E, F, G, R(57), 0x78A5636F );
  200. P( G, H, A, B, C, D, E, F, R(58), 0x84C87814 );
  201. P( F, G, H, A, B, C, D, E, R(59), 0x8CC70208 );
  202. P( E, F, G, H, A, B, C, D, R(60), 0x90BEFFFA );
  203. P( D, E, F, G, H, A, B, C, R(61), 0xA4506CEB );
  204. P( C, D, E, F, G, H, A, B, R(62), 0xBEF9A3F7 );
  205. P( B, C, D, E, F, G, H, A, R(63), 0xC67178F2 );
  206. ctx->state[0] += A;
  207. ctx->state[1] += B;
  208. ctx->state[2] += C;
  209. ctx->state[3] += D;
  210. ctx->state[4] += E;
  211. ctx->state[5] += F;
  212. ctx->state[6] += G;
  213. ctx->state[7] += H;
  214. }
  215. /*
  216. * SHA-256 process buffer
  217. */
  218. void sha2_update( sha2_context *ctx, const unsigned char *input, size_t ilen )
  219. {
  220. size_t fill;
  221. unsigned long left;
  222. if( ilen <= 0 )
  223. return;
  224. left = ctx->total[0] & 0x3F;
  225. fill = 64 - left;
  226. ctx->total[0] += (unsigned long) ilen;
  227. ctx->total[0] &= 0xFFFFFFFF;
  228. if( ctx->total[0] < (unsigned long) ilen )
  229. ctx->total[1]++;
  230. if( left && ilen >= fill )
  231. {
  232. memcpy( (void *) (ctx->buffer + left),
  233. (void *) input, fill );
  234. sha2_process( ctx, ctx->buffer );
  235. input += fill;
  236. ilen -= fill;
  237. left = 0;
  238. }
  239. while( ilen >= 64 )
  240. {
  241. sha2_process( ctx, input );
  242. input += 64;
  243. ilen -= 64;
  244. }
  245. if( ilen > 0 )
  246. {
  247. memcpy( (void *) (ctx->buffer + left),
  248. (void *) input, ilen );
  249. }
  250. }
  251. static const unsigned char sha2_padding[64] =
  252. {
  253. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  254. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  255. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  256. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  257. };
  258. /*
  259. * SHA-256 final digest
  260. */
  261. void sha2_finish( sha2_context *ctx, unsigned char output[32] )
  262. {
  263. unsigned long last, padn;
  264. unsigned long high, low;
  265. unsigned char msglen[8];
  266. high = ( ctx->total[0] >> 29 )
  267. | ( ctx->total[1] << 3 );
  268. low = ( ctx->total[0] << 3 );
  269. PUT_ULONG_BE( high, msglen, 0 );
  270. PUT_ULONG_BE( low, msglen, 4 );
  271. last = ctx->total[0] & 0x3F;
  272. padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
  273. sha2_update( ctx, (unsigned char *) sha2_padding, padn );
  274. sha2_update( ctx, msglen, 8 );
  275. PUT_ULONG_BE( ctx->state[0], output, 0 );
  276. PUT_ULONG_BE( ctx->state[1], output, 4 );
  277. PUT_ULONG_BE( ctx->state[2], output, 8 );
  278. PUT_ULONG_BE( ctx->state[3], output, 12 );
  279. PUT_ULONG_BE( ctx->state[4], output, 16 );
  280. PUT_ULONG_BE( ctx->state[5], output, 20 );
  281. PUT_ULONG_BE( ctx->state[6], output, 24 );
  282. if( ctx->is224 == 0 )
  283. PUT_ULONG_BE( ctx->state[7], output, 28 );
  284. }
  285. /*
  286. * output = SHA-256( input buffer )
  287. */
  288. void sha2( const unsigned char *input, size_t ilen,
  289. unsigned char output[32], int is224 )
  290. {
  291. sha2_context ctx;
  292. sha2_starts( &ctx, is224 );
  293. sha2_update( &ctx, input, ilen );
  294. sha2_finish( &ctx, output );
  295. memset( &ctx, 0, sizeof( sha2_context ) );
  296. }
  297. #if defined(POLARSSL_FS_IO)
  298. /*
  299. * output = SHA-256( file contents )
  300. */
  301. int sha2_file( const char *path, unsigned char output[32], int is224 )
  302. {
  303. FILE *f;
  304. size_t n;
  305. sha2_context ctx;
  306. unsigned char buf[1024];
  307. if( ( f = fopen( path, "rb" ) ) == NULL )
  308. return( 1 );
  309. sha2_starts( &ctx, is224 );
  310. while( ( n = fread( buf, 1, sizeof( buf ), f ) ) > 0 )
  311. sha2_update( &ctx, buf, n );
  312. sha2_finish( &ctx, output );
  313. memset( &ctx, 0, sizeof( sha2_context ) );
  314. if( ferror( f ) != 0 )
  315. {
  316. fclose( f );
  317. return( 2 );
  318. }
  319. fclose( f );
  320. return( 0 );
  321. }
  322. #endif /* POLARSSL_FS_IO */
  323. /*
  324. * SHA-256 HMAC context setup
  325. */
  326. void sha2_hmac_starts( sha2_context *ctx, const unsigned char *key, size_t keylen,
  327. int is224 )
  328. {
  329. size_t i;
  330. unsigned char sum[32];
  331. if( keylen > 64 )
  332. {
  333. sha2( key, keylen, sum, is224 );
  334. keylen = ( is224 ) ? 28 : 32;
  335. key = sum;
  336. }
  337. memset( ctx->ipad, 0x36, 64 );
  338. memset( ctx->opad, 0x5C, 64 );
  339. for( i = 0; i < keylen; i++ )
  340. {
  341. ctx->ipad[i] = (unsigned char)( ctx->ipad[i] ^ key[i] );
  342. ctx->opad[i] = (unsigned char)( ctx->opad[i] ^ key[i] );
  343. }
  344. sha2_starts( ctx, is224 );
  345. sha2_update( ctx, ctx->ipad, 64 );
  346. memset( sum, 0, sizeof( sum ) );
  347. }
  348. /*
  349. * SHA-256 HMAC process buffer
  350. */
  351. void sha2_hmac_update( sha2_context *ctx, const unsigned char *input, size_t ilen )
  352. {
  353. sha2_update( ctx, input, ilen );
  354. }
  355. /*
  356. * SHA-256 HMAC final digest
  357. */
  358. void sha2_hmac_finish( sha2_context *ctx, unsigned char output[32] )
  359. {
  360. int is224, hlen;
  361. unsigned char tmpbuf[32];
  362. is224 = ctx->is224;
  363. hlen = ( is224 == 0 ) ? 32 : 28;
  364. sha2_finish( ctx, tmpbuf );
  365. sha2_starts( ctx, is224 );
  366. sha2_update( ctx, ctx->opad, 64 );
  367. sha2_update( ctx, tmpbuf, hlen );
  368. sha2_finish( ctx, output );
  369. memset( tmpbuf, 0, sizeof( tmpbuf ) );
  370. }
  371. /*
  372. * SHA-256 HMAC context reset
  373. */
  374. void sha2_hmac_reset( sha2_context *ctx )
  375. {
  376. sha2_starts( ctx, ctx->is224 );
  377. sha2_update( ctx, ctx->ipad, 64 );
  378. }
  379. /*
  380. * output = HMAC-SHA-256( hmac key, input buffer )
  381. */
  382. void sha2_hmac( const unsigned char *key, size_t keylen,
  383. const unsigned char *input, size_t ilen,
  384. unsigned char output[32], int is224 )
  385. {
  386. sha2_context ctx;
  387. sha2_hmac_starts( &ctx, key, keylen, is224 );
  388. sha2_hmac_update( &ctx, input, ilen );
  389. sha2_hmac_finish( &ctx, output );
  390. memset( &ctx, 0, sizeof( sha2_context ) );
  391. }
  392. #if defined(POLARSSL_SELF_TEST)
  393. /*
  394. * FIPS-180-2 test vectors
  395. */
  396. static unsigned char sha2_test_buf[3][57] =
  397. {
  398. { "abc" },
  399. { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
  400. { "" }
  401. };
  402. static const int sha2_test_buflen[3] =
  403. {
  404. 3, 56, 1000
  405. };
  406. static const unsigned char sha2_test_sum[6][32] =
  407. {
  408. /*
  409. * SHA-224 test vectors
  410. */
  411. { 0x23, 0x09, 0x7D, 0x22, 0x34, 0x05, 0xD8, 0x22,
  412. 0x86, 0x42, 0xA4, 0x77, 0xBD, 0xA2, 0x55, 0xB3,
  413. 0x2A, 0xAD, 0xBC, 0xE4, 0xBD, 0xA0, 0xB3, 0xF7,
  414. 0xE3, 0x6C, 0x9D, 0xA7 },
  415. { 0x75, 0x38, 0x8B, 0x16, 0x51, 0x27, 0x76, 0xCC,
  416. 0x5D, 0xBA, 0x5D, 0xA1, 0xFD, 0x89, 0x01, 0x50,
  417. 0xB0, 0xC6, 0x45, 0x5C, 0xB4, 0xF5, 0x8B, 0x19,
  418. 0x52, 0x52, 0x25, 0x25 },
  419. { 0x20, 0x79, 0x46, 0x55, 0x98, 0x0C, 0x91, 0xD8,
  420. 0xBB, 0xB4, 0xC1, 0xEA, 0x97, 0x61, 0x8A, 0x4B,
  421. 0xF0, 0x3F, 0x42, 0x58, 0x19, 0x48, 0xB2, 0xEE,
  422. 0x4E, 0xE7, 0xAD, 0x67 },
  423. /*
  424. * SHA-256 test vectors
  425. */
  426. { 0xBA, 0x78, 0x16, 0xBF, 0x8F, 0x01, 0xCF, 0xEA,
  427. 0x41, 0x41, 0x40, 0xDE, 0x5D, 0xAE, 0x22, 0x23,
  428. 0xB0, 0x03, 0x61, 0xA3, 0x96, 0x17, 0x7A, 0x9C,
  429. 0xB4, 0x10, 0xFF, 0x61, 0xF2, 0x00, 0x15, 0xAD },
  430. { 0x24, 0x8D, 0x6A, 0x61, 0xD2, 0x06, 0x38, 0xB8,
  431. 0xE5, 0xC0, 0x26, 0x93, 0x0C, 0x3E, 0x60, 0x39,
  432. 0xA3, 0x3C, 0xE4, 0x59, 0x64, 0xFF, 0x21, 0x67,
  433. 0xF6, 0xEC, 0xED, 0xD4, 0x19, 0xDB, 0x06, 0xC1 },
  434. { 0xCD, 0xC7, 0x6E, 0x5C, 0x99, 0x14, 0xFB, 0x92,
  435. 0x81, 0xA1, 0xC7, 0xE2, 0x84, 0xD7, 0x3E, 0x67,
  436. 0xF1, 0x80, 0x9A, 0x48, 0xA4, 0x97, 0x20, 0x0E,
  437. 0x04, 0x6D, 0x39, 0xCC, 0xC7, 0x11, 0x2C, 0xD0 }
  438. };
  439. /*
  440. * RFC 4231 test vectors
  441. */
  442. static unsigned char sha2_hmac_test_key[7][26] =
  443. {
  444. { "\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B\x0B"
  445. "\x0B\x0B\x0B\x0B" },
  446. { "Jefe" },
  447. { "\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA\xAA"
  448. "\xAA\xAA\xAA\xAA" },
  449. { "\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0A\x0B\x0C\x0D\x0E\x0F\x10"
  450. "\x11\x12\x13\x14\x15\x16\x17\x18\x19" },
  451. { "\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C\x0C"
  452. "\x0C\x0C\x0C\x0C" },
  453. { "" }, /* 0xAA 131 times */
  454. { "" }
  455. };
  456. static const int sha2_hmac_test_keylen[7] =
  457. {
  458. 20, 4, 20, 25, 20, 131, 131
  459. };
  460. static unsigned char sha2_hmac_test_buf[7][153] =
  461. {
  462. { "Hi There" },
  463. { "what do ya want for nothing?" },
  464. { "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  465. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  466. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  467. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD"
  468. "\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD\xDD" },
  469. { "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  470. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  471. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  472. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD"
  473. "\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD\xCD" },
  474. { "Test With Truncation" },
  475. { "Test Using Larger Than Block-Size Key - Hash Key First" },
  476. { "This is a test using a larger than block-size key "
  477. "and a larger than block-size data. The key needs to "
  478. "be hashed before being used by the HMAC algorithm." }
  479. };
  480. static const int sha2_hmac_test_buflen[7] =
  481. {
  482. 8, 28, 50, 50, 20, 54, 152
  483. };
  484. static const unsigned char sha2_hmac_test_sum[14][32] =
  485. {
  486. /*
  487. * HMAC-SHA-224 test vectors
  488. */
  489. { 0x89, 0x6F, 0xB1, 0x12, 0x8A, 0xBB, 0xDF, 0x19,
  490. 0x68, 0x32, 0x10, 0x7C, 0xD4, 0x9D, 0xF3, 0x3F,
  491. 0x47, 0xB4, 0xB1, 0x16, 0x99, 0x12, 0xBA, 0x4F,
  492. 0x53, 0x68, 0x4B, 0x22 },
  493. { 0xA3, 0x0E, 0x01, 0x09, 0x8B, 0xC6, 0xDB, 0xBF,
  494. 0x45, 0x69, 0x0F, 0x3A, 0x7E, 0x9E, 0x6D, 0x0F,
  495. 0x8B, 0xBE, 0xA2, 0xA3, 0x9E, 0x61, 0x48, 0x00,
  496. 0x8F, 0xD0, 0x5E, 0x44 },
  497. { 0x7F, 0xB3, 0xCB, 0x35, 0x88, 0xC6, 0xC1, 0xF6,
  498. 0xFF, 0xA9, 0x69, 0x4D, 0x7D, 0x6A, 0xD2, 0x64,
  499. 0x93, 0x65, 0xB0, 0xC1, 0xF6, 0x5D, 0x69, 0xD1,
  500. 0xEC, 0x83, 0x33, 0xEA },
  501. { 0x6C, 0x11, 0x50, 0x68, 0x74, 0x01, 0x3C, 0xAC,
  502. 0x6A, 0x2A, 0xBC, 0x1B, 0xB3, 0x82, 0x62, 0x7C,
  503. 0xEC, 0x6A, 0x90, 0xD8, 0x6E, 0xFC, 0x01, 0x2D,
  504. 0xE7, 0xAF, 0xEC, 0x5A },
  505. { 0x0E, 0x2A, 0xEA, 0x68, 0xA9, 0x0C, 0x8D, 0x37,
  506. 0xC9, 0x88, 0xBC, 0xDB, 0x9F, 0xCA, 0x6F, 0xA8 },
  507. { 0x95, 0xE9, 0xA0, 0xDB, 0x96, 0x20, 0x95, 0xAD,
  508. 0xAE, 0xBE, 0x9B, 0x2D, 0x6F, 0x0D, 0xBC, 0xE2,
  509. 0xD4, 0x99, 0xF1, 0x12, 0xF2, 0xD2, 0xB7, 0x27,
  510. 0x3F, 0xA6, 0x87, 0x0E },
  511. { 0x3A, 0x85, 0x41, 0x66, 0xAC, 0x5D, 0x9F, 0x02,
  512. 0x3F, 0x54, 0xD5, 0x17, 0xD0, 0xB3, 0x9D, 0xBD,
  513. 0x94, 0x67, 0x70, 0xDB, 0x9C, 0x2B, 0x95, 0xC9,
  514. 0xF6, 0xF5, 0x65, 0xD1 },
  515. /*
  516. * HMAC-SHA-256 test vectors
  517. */
  518. { 0xB0, 0x34, 0x4C, 0x61, 0xD8, 0xDB, 0x38, 0x53,
  519. 0x5C, 0xA8, 0xAF, 0xCE, 0xAF, 0x0B, 0xF1, 0x2B,
  520. 0x88, 0x1D, 0xC2, 0x00, 0xC9, 0x83, 0x3D, 0xA7,
  521. 0x26, 0xE9, 0x37, 0x6C, 0x2E, 0x32, 0xCF, 0xF7 },
  522. { 0x5B, 0xDC, 0xC1, 0x46, 0xBF, 0x60, 0x75, 0x4E,
  523. 0x6A, 0x04, 0x24, 0x26, 0x08, 0x95, 0x75, 0xC7,
  524. 0x5A, 0x00, 0x3F, 0x08, 0x9D, 0x27, 0x39, 0x83,
  525. 0x9D, 0xEC, 0x58, 0xB9, 0x64, 0xEC, 0x38, 0x43 },
  526. { 0x77, 0x3E, 0xA9, 0x1E, 0x36, 0x80, 0x0E, 0x46,
  527. 0x85, 0x4D, 0xB8, 0xEB, 0xD0, 0x91, 0x81, 0xA7,
  528. 0x29, 0x59, 0x09, 0x8B, 0x3E, 0xF8, 0xC1, 0x22,
  529. 0xD9, 0x63, 0x55, 0x14, 0xCE, 0xD5, 0x65, 0xFE },
  530. { 0x82, 0x55, 0x8A, 0x38, 0x9A, 0x44, 0x3C, 0x0E,
  531. 0xA4, 0xCC, 0x81, 0x98, 0x99, 0xF2, 0x08, 0x3A,
  532. 0x85, 0xF0, 0xFA, 0xA3, 0xE5, 0x78, 0xF8, 0x07,
  533. 0x7A, 0x2E, 0x3F, 0xF4, 0x67, 0x29, 0x66, 0x5B },
  534. { 0xA3, 0xB6, 0x16, 0x74, 0x73, 0x10, 0x0E, 0xE0,
  535. 0x6E, 0x0C, 0x79, 0x6C, 0x29, 0x55, 0x55, 0x2B },
  536. { 0x60, 0xE4, 0x31, 0x59, 0x1E, 0xE0, 0xB6, 0x7F,
  537. 0x0D, 0x8A, 0x26, 0xAA, 0xCB, 0xF5, 0xB7, 0x7F,
  538. 0x8E, 0x0B, 0xC6, 0x21, 0x37, 0x28, 0xC5, 0x14,
  539. 0x05, 0x46, 0x04, 0x0F, 0x0E, 0xE3, 0x7F, 0x54 },
  540. { 0x9B, 0x09, 0xFF, 0xA7, 0x1B, 0x94, 0x2F, 0xCB,
  541. 0x27, 0x63, 0x5F, 0xBC, 0xD5, 0xB0, 0xE9, 0x44,
  542. 0xBF, 0xDC, 0x63, 0x64, 0x4F, 0x07, 0x13, 0x93,
  543. 0x8A, 0x7F, 0x51, 0x53, 0x5C, 0x3A, 0x35, 0xE2 }
  544. };
  545. /*
  546. * Checkup routine
  547. */
  548. int sha2_self_test( int verbose )
  549. {
  550. int i, j, k, buflen;
  551. unsigned char buf[1024];
  552. unsigned char sha2sum[32];
  553. sha2_context ctx;
  554. for( i = 0; i < 6; i++ )
  555. {
  556. j = i % 3;
  557. k = i < 3;
  558. if( verbose != 0 )
  559. printf( " SHA-%d test #%d: ", 256 - k * 32, j + 1 );
  560. sha2_starts( &ctx, k );
  561. if( j == 2 )
  562. {
  563. memset( buf, 'a', buflen = 1000 );
  564. for( j = 0; j < 1000; j++ )
  565. sha2_update( &ctx, buf, buflen );
  566. }
  567. else
  568. sha2_update( &ctx, sha2_test_buf[j],
  569. sha2_test_buflen[j] );
  570. sha2_finish( &ctx, sha2sum );
  571. if( memcmp( sha2sum, sha2_test_sum[i], 32 - k * 4 ) != 0 )
  572. {
  573. if( verbose != 0 )
  574. printf( "failed\n" );
  575. return( 1 );
  576. }
  577. if( verbose != 0 )
  578. printf( "passed\n" );
  579. }
  580. if( verbose != 0 )
  581. printf( "\n" );
  582. for( i = 0; i < 14; i++ )
  583. {
  584. j = i % 7;
  585. k = i < 7;
  586. if( verbose != 0 )
  587. printf( " HMAC-SHA-%d test #%d: ", 256 - k * 32, j + 1 );
  588. if( j == 5 || j == 6 )
  589. {
  590. memset( buf, '\xAA', buflen = 131 );
  591. sha2_hmac_starts( &ctx, buf, buflen, k );
  592. }
  593. else
  594. sha2_hmac_starts( &ctx, sha2_hmac_test_key[j],
  595. sha2_hmac_test_keylen[j], k );
  596. sha2_hmac_update( &ctx, sha2_hmac_test_buf[j],
  597. sha2_hmac_test_buflen[j] );
  598. sha2_hmac_finish( &ctx, sha2sum );
  599. buflen = ( j == 4 ) ? 16 : 32 - k * 4;
  600. if( memcmp( sha2sum, sha2_hmac_test_sum[i], buflen ) != 0 )
  601. {
  602. if( verbose != 0 )
  603. printf( "failed\n" );
  604. return( 1 );
  605. }
  606. if( verbose != 0 )
  607. printf( "passed\n" );
  608. }
  609. if( verbose != 0 )
  610. printf( "\n" );
  611. return( 0 );
  612. }
  613. #endif
  614. #endif