sha256.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461
  1. /*
  2. * FIPS-180-2 compliant SHA-256 implementation
  3. *
  4. * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
  5. * SPDX-License-Identifier: GPL-2.0
  6. *
  7. * This program is free software; you can redistribute it and/or modify
  8. * it under the terms of the GNU General Public License as published by
  9. * the Free Software Foundation; either version 2 of the License, or
  10. * (at your option) any later version.
  11. *
  12. * This program is distributed in the hope that it will be useful,
  13. * but WITHOUT ANY WARRANTY; without even the implied warranty of
  14. * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
  15. * GNU General Public License for more details.
  16. *
  17. * You should have received a copy of the GNU General Public License along
  18. * with this program; if not, write to the Free Software Foundation, Inc.,
  19. * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA.
  20. *
  21. * This file is part of mbed TLS (https://tls.mbed.org)
  22. */
  23. /*
  24. * The SHA-256 Secure Hash Standard was published by NIST in 2002.
  25. *
  26. * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
  27. */
  28. #if !defined(MBEDTLS_CONFIG_FILE)
  29. #include "mbedtls/config.h"
  30. #else
  31. #include MBEDTLS_CONFIG_FILE
  32. #endif
  33. #if defined(MBEDTLS_SHA256_C)
  34. #include "mbedtls/sha256.h"
  35. #include <string.h>
  36. #if defined(MBEDTLS_SELF_TEST)
  37. #if defined(MBEDTLS_PLATFORM_C)
  38. #include "mbedtls/platform.h"
  39. #else
  40. #include <stdio.h>
  41. #include <stdlib.h>
  42. #define mbedtls_printf printf
  43. #define mbedtls_calloc calloc
  44. #define mbedtls_free free
  45. #endif /* MBEDTLS_PLATFORM_C */
  46. #endif /* MBEDTLS_SELF_TEST */
  47. #if !defined(MBEDTLS_SHA256_ALT)
  48. /* Implementation that should never be optimized out by the compiler */
  49. static void mbedtls_zeroize( void *v, size_t n ) {
  50. volatile unsigned char *p = v; while( n-- ) *p++ = 0;
  51. }
  52. /*
  53. * 32-bit integer manipulation macros (big endian)
  54. */
  55. #ifndef GET_UINT32_BE
  56. #define GET_UINT32_BE(n,b,i) \
  57. do { \
  58. (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
  59. | ( (uint32_t) (b)[(i) + 1] << 16 ) \
  60. | ( (uint32_t) (b)[(i) + 2] << 8 ) \
  61. | ( (uint32_t) (b)[(i) + 3] ); \
  62. } while( 0 )
  63. #endif
  64. #ifndef PUT_UINT32_BE
  65. #define PUT_UINT32_BE(n,b,i) \
  66. do { \
  67. (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
  68. (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
  69. (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
  70. (b)[(i) + 3] = (unsigned char) ( (n) ); \
  71. } while( 0 )
  72. #endif
  73. void mbedtls_sha256_init( mbedtls_sha256_context *ctx )
  74. {
  75. memset( ctx, 0, sizeof( mbedtls_sha256_context ) );
  76. }
  77. void mbedtls_sha256_free( mbedtls_sha256_context *ctx )
  78. {
  79. if( ctx == NULL )
  80. return;
  81. mbedtls_zeroize( ctx, sizeof( mbedtls_sha256_context ) );
  82. }
  83. void mbedtls_sha256_clone( mbedtls_sha256_context *dst,
  84. const mbedtls_sha256_context *src )
  85. {
  86. *dst = *src;
  87. }
  88. /*
  89. * SHA-256 context setup
  90. */
  91. void mbedtls_sha256_starts( mbedtls_sha256_context *ctx, int is224 )
  92. {
  93. ctx->total[0] = 0;
  94. ctx->total[1] = 0;
  95. if( is224 == 0 )
  96. {
  97. /* SHA-256 */
  98. ctx->state[0] = 0x6A09E667;
  99. ctx->state[1] = 0xBB67AE85;
  100. ctx->state[2] = 0x3C6EF372;
  101. ctx->state[3] = 0xA54FF53A;
  102. ctx->state[4] = 0x510E527F;
  103. ctx->state[5] = 0x9B05688C;
  104. ctx->state[6] = 0x1F83D9AB;
  105. ctx->state[7] = 0x5BE0CD19;
  106. }
  107. else
  108. {
  109. /* SHA-224 */
  110. ctx->state[0] = 0xC1059ED8;
  111. ctx->state[1] = 0x367CD507;
  112. ctx->state[2] = 0x3070DD17;
  113. ctx->state[3] = 0xF70E5939;
  114. ctx->state[4] = 0xFFC00B31;
  115. ctx->state[5] = 0x68581511;
  116. ctx->state[6] = 0x64F98FA7;
  117. ctx->state[7] = 0xBEFA4FA4;
  118. }
  119. ctx->is224 = is224;
  120. }
  121. #if !defined(MBEDTLS_SHA256_PROCESS_ALT)
  122. static const uint32_t K[] =
  123. {
  124. 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
  125. 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
  126. 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
  127. 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
  128. 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
  129. 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
  130. 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
  131. 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
  132. 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
  133. 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
  134. 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
  135. 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
  136. 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
  137. 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
  138. 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
  139. 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2,
  140. };
  141. #define SHR(x,n) ((x & 0xFFFFFFFF) >> n)
  142. #define ROTR(x,n) (SHR(x,n) | (x << (32 - n)))
  143. #define S0(x) (ROTR(x, 7) ^ ROTR(x,18) ^ SHR(x, 3))
  144. #define S1(x) (ROTR(x,17) ^ ROTR(x,19) ^ SHR(x,10))
  145. #define S2(x) (ROTR(x, 2) ^ ROTR(x,13) ^ ROTR(x,22))
  146. #define S3(x) (ROTR(x, 6) ^ ROTR(x,11) ^ ROTR(x,25))
  147. #define F0(x,y,z) ((x & y) | (z & (x | y)))
  148. #define F1(x,y,z) (z ^ (x & (y ^ z)))
  149. #define R(t) \
  150. ( \
  151. W[t] = S1(W[t - 2]) + W[t - 7] + \
  152. S0(W[t - 15]) + W[t - 16] \
  153. )
  154. #define P(a,b,c,d,e,f,g,h,x,K) \
  155. { \
  156. temp1 = h + S3(e) + F1(e,f,g) + K + x; \
  157. temp2 = S2(a) + F0(a,b,c); \
  158. d += temp1; h = temp1 + temp2; \
  159. }
  160. void mbedtls_sha256_process( mbedtls_sha256_context *ctx, const unsigned char data[64] )
  161. {
  162. uint32_t temp1, temp2, W[64];
  163. uint32_t A[8];
  164. unsigned int i;
  165. for( i = 0; i < 8; i++ )
  166. A[i] = ctx->state[i];
  167. #if defined(MBEDTLS_SHA256_SMALLER)
  168. for( i = 0; i < 64; i++ )
  169. {
  170. if( i < 16 )
  171. GET_UINT32_BE( W[i], data, 4 * i );
  172. else
  173. R( i );
  174. P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], W[i], K[i] );
  175. temp1 = A[7]; A[7] = A[6]; A[6] = A[5]; A[5] = A[4]; A[4] = A[3];
  176. A[3] = A[2]; A[2] = A[1]; A[1] = A[0]; A[0] = temp1;
  177. }
  178. #else /* MBEDTLS_SHA256_SMALLER */
  179. for( i = 0; i < 16; i++ )
  180. GET_UINT32_BE( W[i], data, 4 * i );
  181. for( i = 0; i < 16; i += 8 )
  182. {
  183. P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], W[i+0], K[i+0] );
  184. P( A[7], A[0], A[1], A[2], A[3], A[4], A[5], A[6], W[i+1], K[i+1] );
  185. P( A[6], A[7], A[0], A[1], A[2], A[3], A[4], A[5], W[i+2], K[i+2] );
  186. P( A[5], A[6], A[7], A[0], A[1], A[2], A[3], A[4], W[i+3], K[i+3] );
  187. P( A[4], A[5], A[6], A[7], A[0], A[1], A[2], A[3], W[i+4], K[i+4] );
  188. P( A[3], A[4], A[5], A[6], A[7], A[0], A[1], A[2], W[i+5], K[i+5] );
  189. P( A[2], A[3], A[4], A[5], A[6], A[7], A[0], A[1], W[i+6], K[i+6] );
  190. P( A[1], A[2], A[3], A[4], A[5], A[6], A[7], A[0], W[i+7], K[i+7] );
  191. }
  192. for( i = 16; i < 64; i += 8 )
  193. {
  194. P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], R(i+0), K[i+0] );
  195. P( A[7], A[0], A[1], A[2], A[3], A[4], A[5], A[6], R(i+1), K[i+1] );
  196. P( A[6], A[7], A[0], A[1], A[2], A[3], A[4], A[5], R(i+2), K[i+2] );
  197. P( A[5], A[6], A[7], A[0], A[1], A[2], A[3], A[4], R(i+3), K[i+3] );
  198. P( A[4], A[5], A[6], A[7], A[0], A[1], A[2], A[3], R(i+4), K[i+4] );
  199. P( A[3], A[4], A[5], A[6], A[7], A[0], A[1], A[2], R(i+5), K[i+5] );
  200. P( A[2], A[3], A[4], A[5], A[6], A[7], A[0], A[1], R(i+6), K[i+6] );
  201. P( A[1], A[2], A[3], A[4], A[5], A[6], A[7], A[0], R(i+7), K[i+7] );
  202. }
  203. #endif /* MBEDTLS_SHA256_SMALLER */
  204. for( i = 0; i < 8; i++ )
  205. ctx->state[i] += A[i];
  206. }
  207. #endif /* !MBEDTLS_SHA256_PROCESS_ALT */
  208. /*
  209. * SHA-256 process buffer
  210. */
  211. void mbedtls_sha256_update( mbedtls_sha256_context *ctx, const unsigned char *input,
  212. size_t ilen )
  213. {
  214. size_t fill;
  215. uint32_t left;
  216. if( ilen == 0 )
  217. return;
  218. left = ctx->total[0] & 0x3F;
  219. fill = 64 - left;
  220. ctx->total[0] += (uint32_t) ilen;
  221. ctx->total[0] &= 0xFFFFFFFF;
  222. if( ctx->total[0] < (uint32_t) ilen )
  223. ctx->total[1]++;
  224. if( left && ilen >= fill )
  225. {
  226. memcpy( (void *) (ctx->buffer + left), input, fill );
  227. mbedtls_sha256_process( ctx, ctx->buffer );
  228. input += fill;
  229. ilen -= fill;
  230. left = 0;
  231. }
  232. while( ilen >= 64 )
  233. {
  234. mbedtls_sha256_process( ctx, input );
  235. input += 64;
  236. ilen -= 64;
  237. }
  238. if( ilen > 0 )
  239. memcpy( (void *) (ctx->buffer + left), input, ilen );
  240. }
  241. static const unsigned char sha256_padding[64] =
  242. {
  243. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  244. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  245. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  246. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  247. };
  248. /*
  249. * SHA-256 final digest
  250. */
  251. void mbedtls_sha256_finish( mbedtls_sha256_context *ctx, unsigned char output[32] )
  252. {
  253. uint32_t last, padn;
  254. uint32_t high, low;
  255. unsigned char msglen[8];
  256. high = ( ctx->total[0] >> 29 )
  257. | ( ctx->total[1] << 3 );
  258. low = ( ctx->total[0] << 3 );
  259. PUT_UINT32_BE( high, msglen, 0 );
  260. PUT_UINT32_BE( low, msglen, 4 );
  261. last = ctx->total[0] & 0x3F;
  262. padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last );
  263. mbedtls_sha256_update( ctx, sha256_padding, padn );
  264. mbedtls_sha256_update( ctx, msglen, 8 );
  265. PUT_UINT32_BE( ctx->state[0], output, 0 );
  266. PUT_UINT32_BE( ctx->state[1], output, 4 );
  267. PUT_UINT32_BE( ctx->state[2], output, 8 );
  268. PUT_UINT32_BE( ctx->state[3], output, 12 );
  269. PUT_UINT32_BE( ctx->state[4], output, 16 );
  270. PUT_UINT32_BE( ctx->state[5], output, 20 );
  271. PUT_UINT32_BE( ctx->state[6], output, 24 );
  272. if( ctx->is224 == 0 )
  273. PUT_UINT32_BE( ctx->state[7], output, 28 );
  274. }
  275. #endif /* !MBEDTLS_SHA256_ALT */
  276. /*
  277. * output = SHA-256( input buffer )
  278. */
  279. void mbedtls_sha256( const unsigned char *input, size_t ilen,
  280. unsigned char output[32], int is224 )
  281. {
  282. mbedtls_sha256_context ctx;
  283. mbedtls_sha256_init( &ctx );
  284. mbedtls_sha256_starts( &ctx, is224 );
  285. mbedtls_sha256_update( &ctx, input, ilen );
  286. mbedtls_sha256_finish( &ctx, output );
  287. mbedtls_sha256_free( &ctx );
  288. }
  289. #if defined(MBEDTLS_SELF_TEST)
  290. /*
  291. * FIPS-180-2 test vectors
  292. */
  293. static const unsigned char sha256_test_buf[3][57] =
  294. {
  295. { "abc" },
  296. { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
  297. { "" }
  298. };
  299. static const int sha256_test_buflen[3] =
  300. {
  301. 3, 56, 1000
  302. };
  303. static const unsigned char sha256_test_sum[6][32] =
  304. {
  305. /*
  306. * SHA-224 test vectors
  307. */
  308. { 0x23, 0x09, 0x7D, 0x22, 0x34, 0x05, 0xD8, 0x22,
  309. 0x86, 0x42, 0xA4, 0x77, 0xBD, 0xA2, 0x55, 0xB3,
  310. 0x2A, 0xAD, 0xBC, 0xE4, 0xBD, 0xA0, 0xB3, 0xF7,
  311. 0xE3, 0x6C, 0x9D, 0xA7 },
  312. { 0x75, 0x38, 0x8B, 0x16, 0x51, 0x27, 0x76, 0xCC,
  313. 0x5D, 0xBA, 0x5D, 0xA1, 0xFD, 0x89, 0x01, 0x50,
  314. 0xB0, 0xC6, 0x45, 0x5C, 0xB4, 0xF5, 0x8B, 0x19,
  315. 0x52, 0x52, 0x25, 0x25 },
  316. { 0x20, 0x79, 0x46, 0x55, 0x98, 0x0C, 0x91, 0xD8,
  317. 0xBB, 0xB4, 0xC1, 0xEA, 0x97, 0x61, 0x8A, 0x4B,
  318. 0xF0, 0x3F, 0x42, 0x58, 0x19, 0x48, 0xB2, 0xEE,
  319. 0x4E, 0xE7, 0xAD, 0x67 },
  320. /*
  321. * SHA-256 test vectors
  322. */
  323. { 0xBA, 0x78, 0x16, 0xBF, 0x8F, 0x01, 0xCF, 0xEA,
  324. 0x41, 0x41, 0x40, 0xDE, 0x5D, 0xAE, 0x22, 0x23,
  325. 0xB0, 0x03, 0x61, 0xA3, 0x96, 0x17, 0x7A, 0x9C,
  326. 0xB4, 0x10, 0xFF, 0x61, 0xF2, 0x00, 0x15, 0xAD },
  327. { 0x24, 0x8D, 0x6A, 0x61, 0xD2, 0x06, 0x38, 0xB8,
  328. 0xE5, 0xC0, 0x26, 0x93, 0x0C, 0x3E, 0x60, 0x39,
  329. 0xA3, 0x3C, 0xE4, 0x59, 0x64, 0xFF, 0x21, 0x67,
  330. 0xF6, 0xEC, 0xED, 0xD4, 0x19, 0xDB, 0x06, 0xC1 },
  331. { 0xCD, 0xC7, 0x6E, 0x5C, 0x99, 0x14, 0xFB, 0x92,
  332. 0x81, 0xA1, 0xC7, 0xE2, 0x84, 0xD7, 0x3E, 0x67,
  333. 0xF1, 0x80, 0x9A, 0x48, 0xA4, 0x97, 0x20, 0x0E,
  334. 0x04, 0x6D, 0x39, 0xCC, 0xC7, 0x11, 0x2C, 0xD0 }
  335. };
  336. /*
  337. * Checkup routine
  338. */
  339. int mbedtls_sha256_self_test( int verbose )
  340. {
  341. int i, j, k, buflen, ret = 0;
  342. unsigned char *buf;
  343. unsigned char sha256sum[32];
  344. mbedtls_sha256_context ctx;
  345. buf = mbedtls_calloc( 1024, sizeof(unsigned char) );
  346. if( NULL == buf )
  347. {
  348. if( verbose != 0 )
  349. mbedtls_printf( "Buffer allocation failed\n" );
  350. return( 1 );
  351. }
  352. mbedtls_sha256_init( &ctx );
  353. for( i = 0; i < 6; i++ )
  354. {
  355. j = i % 3;
  356. k = i < 3;
  357. if( verbose != 0 )
  358. mbedtls_printf( " SHA-%d test #%d: ", 256 - k * 32, j + 1 );
  359. mbedtls_sha256_starts( &ctx, k );
  360. if( j == 2 )
  361. {
  362. memset( buf, 'a', buflen = 1000 );
  363. for( j = 0; j < 1000; j++ )
  364. mbedtls_sha256_update( &ctx, buf, buflen );
  365. }
  366. else
  367. mbedtls_sha256_update( &ctx, sha256_test_buf[j],
  368. sha256_test_buflen[j] );
  369. mbedtls_sha256_finish( &ctx, sha256sum );
  370. if( memcmp( sha256sum, sha256_test_sum[i], 32 - k * 4 ) != 0 )
  371. {
  372. if( verbose != 0 )
  373. mbedtls_printf( "failed\n" );
  374. ret = 1;
  375. goto exit;
  376. }
  377. if( verbose != 0 )
  378. mbedtls_printf( "passed\n" );
  379. }
  380. if( verbose != 0 )
  381. mbedtls_printf( "\n" );
  382. exit:
  383. mbedtls_sha256_free( &ctx );
  384. mbedtls_free( buf );
  385. return( ret );
  386. }
  387. #endif /* MBEDTLS_SELF_TEST */
  388. #endif /* MBEDTLS_SHA256_C */