mbed_sha256.c 17 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585
  1. /*
  2. * FIPS-180-2 compliant SHA-256 implementation
  3. *
  4. * Copyright The Mbed TLS Contributors
  5. * SPDX-License-Identifier: Apache-2.0
  6. *
  7. * Licensed under the Apache License, Version 2.0 (the "License"); you may
  8. * not use this file except in compliance with the License.
  9. * You may obtain a copy of the License at
  10. *
  11. * http://www.apache.org/licenses/LICENSE-2.0
  12. *
  13. * Unless required by applicable law or agreed to in writing, software
  14. * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT
  15. * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  16. * See the License for the specific language governing permissions and
  17. * limitations under the License.
  18. */
  19. /*
  20. * The SHA-256 Secure Hash Standard was published by NIST in 2002.
  21. *
  22. * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf
  23. */
  24. #include "common.h"
  25. #if defined(MBEDTLS_SHA256_C)
  26. #include "mbedtls/sha256.h"
  27. #include "mbedtls/platform_util.h"
  28. #include "mbedtls/error.h"
  29. #include <string.h>
  30. #if defined(MBEDTLS_SELF_TEST)
  31. #if defined(MBEDTLS_PLATFORM_C)
  32. #include "mbedtls/platform.h"
  33. #else
  34. #include <stdio.h>
  35. #include <stdlib.h>
  36. #define mbedtls_printf printf
  37. #define mbedtls_calloc calloc
  38. #define mbedtls_free free
  39. #endif /* MBEDTLS_PLATFORM_C */
  40. #endif /* MBEDTLS_SELF_TEST */
  41. #define SHA256_VALIDATE_RET(cond) \
  42. MBEDTLS_INTERNAL_VALIDATE_RET( cond, MBEDTLS_ERR_SHA256_BAD_INPUT_DATA )
  43. #define SHA256_VALIDATE(cond) MBEDTLS_INTERNAL_VALIDATE( cond )
  44. #if !defined(MBEDTLS_SHA256_ALT)
  45. void mbedtls_sha256_init( mbedtls_sha256_context *ctx )
  46. {
  47. SHA256_VALIDATE( ctx != NULL );
  48. memset( ctx, 0, sizeof( mbedtls_sha256_context ) );
  49. }
  50. void mbedtls_sha256_free( mbedtls_sha256_context *ctx )
  51. {
  52. if( ctx == NULL )
  53. return;
  54. mbedtls_platform_zeroize( ctx, sizeof( mbedtls_sha256_context ) );
  55. }
  56. void mbedtls_sha256_clone( mbedtls_sha256_context *dst,
  57. const mbedtls_sha256_context *src )
  58. {
  59. SHA256_VALIDATE( dst != NULL );
  60. SHA256_VALIDATE( src != NULL );
  61. *dst = *src;
  62. }
  63. /*
  64. * SHA-256 context setup
  65. */
  66. int mbedtls_sha256_starts_ret( mbedtls_sha256_context *ctx, int is224 )
  67. {
  68. SHA256_VALIDATE_RET( ctx != NULL );
  69. SHA256_VALIDATE_RET( is224 == 0 || is224 == 1 );
  70. ctx->total[0] = 0;
  71. ctx->total[1] = 0;
  72. if( is224 == 0 )
  73. {
  74. /* SHA-256 */
  75. ctx->state[0] = 0x6A09E667;
  76. ctx->state[1] = 0xBB67AE85;
  77. ctx->state[2] = 0x3C6EF372;
  78. ctx->state[3] = 0xA54FF53A;
  79. ctx->state[4] = 0x510E527F;
  80. ctx->state[5] = 0x9B05688C;
  81. ctx->state[6] = 0x1F83D9AB;
  82. ctx->state[7] = 0x5BE0CD19;
  83. }
  84. else
  85. {
  86. /* SHA-224 */
  87. ctx->state[0] = 0xC1059ED8;
  88. ctx->state[1] = 0x367CD507;
  89. ctx->state[2] = 0x3070DD17;
  90. ctx->state[3] = 0xF70E5939;
  91. ctx->state[4] = 0xFFC00B31;
  92. ctx->state[5] = 0x68581511;
  93. ctx->state[6] = 0x64F98FA7;
  94. ctx->state[7] = 0xBEFA4FA4;
  95. }
  96. ctx->is224 = is224;
  97. return( 0 );
  98. }
  99. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  100. void mbedtls_sha256_starts( mbedtls_sha256_context *ctx,
  101. int is224 )
  102. {
  103. mbedtls_sha256_starts_ret( ctx, is224 );
  104. }
  105. #endif
  106. #if !defined(MBEDTLS_SHA256_PROCESS_ALT)
  107. static const uint32_t K[] =
  108. {
  109. 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5,
  110. 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5,
  111. 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3,
  112. 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174,
  113. 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC,
  114. 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA,
  115. 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7,
  116. 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967,
  117. 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13,
  118. 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85,
  119. 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3,
  120. 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070,
  121. 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5,
  122. 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3,
  123. 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208,
  124. 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2,
  125. };
  126. #define SHR(x,n) (((x) & 0xFFFFFFFF) >> (n))
  127. #define ROTR(x,n) (SHR(x,n) | ((x) << (32 - (n))))
  128. #define S0(x) (ROTR(x, 7) ^ ROTR(x,18) ^ SHR(x, 3))
  129. #define S1(x) (ROTR(x,17) ^ ROTR(x,19) ^ SHR(x,10))
  130. #define S2(x) (ROTR(x, 2) ^ ROTR(x,13) ^ ROTR(x,22))
  131. #define S3(x) (ROTR(x, 6) ^ ROTR(x,11) ^ ROTR(x,25))
  132. #define F0(x,y,z) (((x) & (y)) | ((z) & ((x) | (y))))
  133. #define F1(x,y,z) ((z) ^ ((x) & ((y) ^ (z))))
  134. #define R(t) \
  135. ( \
  136. local.W[t] = S1(local.W[(t) - 2]) + local.W[(t) - 7] + \
  137. S0(local.W[(t) - 15]) + local.W[(t) - 16] \
  138. )
  139. #define P(a,b,c,d,e,f,g,h,x,K) \
  140. do \
  141. { \
  142. local.temp1 = (h) + S3(e) + F1((e),(f),(g)) + (K) + (x); \
  143. local.temp2 = S2(a) + F0((a),(b),(c)); \
  144. (d) += local.temp1; (h) = local.temp1 + local.temp2; \
  145. } while( 0 )
  146. int mbedtls_internal_sha256_process( mbedtls_sha256_context *ctx,
  147. const unsigned char data[64] )
  148. {
  149. struct
  150. {
  151. uint32_t temp1, temp2, W[64];
  152. uint32_t A[8];
  153. } local;
  154. unsigned int i;
  155. SHA256_VALIDATE_RET( ctx != NULL );
  156. SHA256_VALIDATE_RET( (const unsigned char *)data != NULL );
  157. for( i = 0; i < 8; i++ )
  158. local.A[i] = ctx->state[i];
  159. #if defined(MBEDTLS_SHA256_SMALLER)
  160. for( i = 0; i < 64; i++ )
  161. {
  162. if( i < 16 )
  163. local.W[i] = MBEDTLS_GET_UINT32_BE( data, 4 * i );
  164. else
  165. R( i );
  166. P( local.A[0], local.A[1], local.A[2], local.A[3], local.A[4],
  167. local.A[5], local.A[6], local.A[7], local.W[i], K[i] );
  168. local.temp1 = local.A[7]; local.A[7] = local.A[6];
  169. local.A[6] = local.A[5]; local.A[5] = local.A[4];
  170. local.A[4] = local.A[3]; local.A[3] = local.A[2];
  171. local.A[2] = local.A[1]; local.A[1] = local.A[0];
  172. local.A[0] = local.temp1;
  173. }
  174. #else /* MBEDTLS_SHA256_SMALLER */
  175. for( i = 0; i < 16; i++ )
  176. local.W[i] = MBEDTLS_GET_UINT32_BE( data, 4 * i );
  177. for( i = 0; i < 16; i += 8 )
  178. {
  179. P( local.A[0], local.A[1], local.A[2], local.A[3], local.A[4],
  180. local.A[5], local.A[6], local.A[7], local.W[i+0], K[i+0] );
  181. P( local.A[7], local.A[0], local.A[1], local.A[2], local.A[3],
  182. local.A[4], local.A[5], local.A[6], local.W[i+1], K[i+1] );
  183. P( local.A[6], local.A[7], local.A[0], local.A[1], local.A[2],
  184. local.A[3], local.A[4], local.A[5], local.W[i+2], K[i+2] );
  185. P( local.A[5], local.A[6], local.A[7], local.A[0], local.A[1],
  186. local.A[2], local.A[3], local.A[4], local.W[i+3], K[i+3] );
  187. P( local.A[4], local.A[5], local.A[6], local.A[7], local.A[0],
  188. local.A[1], local.A[2], local.A[3], local.W[i+4], K[i+4] );
  189. P( local.A[3], local.A[4], local.A[5], local.A[6], local.A[7],
  190. local.A[0], local.A[1], local.A[2], local.W[i+5], K[i+5] );
  191. P( local.A[2], local.A[3], local.A[4], local.A[5], local.A[6],
  192. local.A[7], local.A[0], local.A[1], local.W[i+6], K[i+6] );
  193. P( local.A[1], local.A[2], local.A[3], local.A[4], local.A[5],
  194. local.A[6], local.A[7], local.A[0], local.W[i+7], K[i+7] );
  195. }
  196. for( i = 16; i < 64; i += 8 )
  197. {
  198. P( local.A[0], local.A[1], local.A[2], local.A[3], local.A[4],
  199. local.A[5], local.A[6], local.A[7], R(i+0), K[i+0] );
  200. P( local.A[7], local.A[0], local.A[1], local.A[2], local.A[3],
  201. local.A[4], local.A[5], local.A[6], R(i+1), K[i+1] );
  202. P( local.A[6], local.A[7], local.A[0], local.A[1], local.A[2],
  203. local.A[3], local.A[4], local.A[5], R(i+2), K[i+2] );
  204. P( local.A[5], local.A[6], local.A[7], local.A[0], local.A[1],
  205. local.A[2], local.A[3], local.A[4], R(i+3), K[i+3] );
  206. P( local.A[4], local.A[5], local.A[6], local.A[7], local.A[0],
  207. local.A[1], local.A[2], local.A[3], R(i+4), K[i+4] );
  208. P( local.A[3], local.A[4], local.A[5], local.A[6], local.A[7],
  209. local.A[0], local.A[1], local.A[2], R(i+5), K[i+5] );
  210. P( local.A[2], local.A[3], local.A[4], local.A[5], local.A[6],
  211. local.A[7], local.A[0], local.A[1], R(i+6), K[i+6] );
  212. P( local.A[1], local.A[2], local.A[3], local.A[4], local.A[5],
  213. local.A[6], local.A[7], local.A[0], R(i+7), K[i+7] );
  214. }
  215. #endif /* MBEDTLS_SHA256_SMALLER */
  216. for( i = 0; i < 8; i++ )
  217. ctx->state[i] += local.A[i];
  218. /* Zeroise buffers and variables to clear sensitive data from memory. */
  219. mbedtls_platform_zeroize( &local, sizeof( local ) );
  220. return( 0 );
  221. }
  222. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  223. void mbedtls_sha256_process( mbedtls_sha256_context *ctx,
  224. const unsigned char data[64] )
  225. {
  226. mbedtls_internal_sha256_process( ctx, data );
  227. }
  228. #endif
  229. #endif /* !MBEDTLS_SHA256_PROCESS_ALT */
  230. /*
  231. * SHA-256 process buffer
  232. */
  233. int mbedtls_sha256_update_ret( mbedtls_sha256_context *ctx,
  234. const unsigned char *input,
  235. size_t ilen )
  236. {
  237. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  238. size_t fill;
  239. uint32_t left;
  240. SHA256_VALIDATE_RET( ctx != NULL );
  241. SHA256_VALIDATE_RET( ilen == 0 || input != NULL );
  242. if( ilen == 0 )
  243. return( 0 );
  244. left = ctx->total[0] & 0x3F;
  245. fill = 64 - left;
  246. ctx->total[0] += (uint32_t) ilen;
  247. ctx->total[0] &= 0xFFFFFFFF;
  248. if( ctx->total[0] < (uint32_t) ilen )
  249. ctx->total[1]++;
  250. if( left && ilen >= fill )
  251. {
  252. memcpy( (void *) (ctx->buffer + left), input, fill );
  253. if( ( ret = mbedtls_internal_sha256_process( ctx, ctx->buffer ) ) != 0 )
  254. return( ret );
  255. input += fill;
  256. ilen -= fill;
  257. left = 0;
  258. }
  259. while( ilen >= 64 )
  260. {
  261. if( ( ret = mbedtls_internal_sha256_process( ctx, input ) ) != 0 )
  262. return( ret );
  263. input += 64;
  264. ilen -= 64;
  265. }
  266. if( ilen > 0 )
  267. memcpy( (void *) (ctx->buffer + left), input, ilen );
  268. return( 0 );
  269. }
  270. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  271. void mbedtls_sha256_update( mbedtls_sha256_context *ctx,
  272. const unsigned char *input,
  273. size_t ilen )
  274. {
  275. mbedtls_sha256_update_ret( ctx, input, ilen );
  276. }
  277. #endif
  278. /*
  279. * SHA-256 final digest
  280. */
  281. int mbedtls_sha256_finish_ret( mbedtls_sha256_context *ctx,
  282. unsigned char output[32] )
  283. {
  284. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  285. uint32_t used;
  286. uint32_t high, low;
  287. SHA256_VALIDATE_RET( ctx != NULL );
  288. SHA256_VALIDATE_RET( (unsigned char *)output != NULL );
  289. /*
  290. * Add padding: 0x80 then 0x00 until 8 bytes remain for the length
  291. */
  292. used = ctx->total[0] & 0x3F;
  293. ctx->buffer[used++] = 0x80;
  294. if( used <= 56 )
  295. {
  296. /* Enough room for padding + length in current block */
  297. memset( ctx->buffer + used, 0, 56 - used );
  298. }
  299. else
  300. {
  301. /* We'll need an extra block */
  302. memset( ctx->buffer + used, 0, 64 - used );
  303. if( ( ret = mbedtls_internal_sha256_process( ctx, ctx->buffer ) ) != 0 )
  304. return( ret );
  305. memset( ctx->buffer, 0, 56 );
  306. }
  307. /*
  308. * Add message length
  309. */
  310. high = ( ctx->total[0] >> 29 )
  311. | ( ctx->total[1] << 3 );
  312. low = ( ctx->total[0] << 3 );
  313. MBEDTLS_PUT_UINT32_BE( high, ctx->buffer, 56 );
  314. MBEDTLS_PUT_UINT32_BE( low, ctx->buffer, 60 );
  315. if( ( ret = mbedtls_internal_sha256_process( ctx, ctx->buffer ) ) != 0 )
  316. return( ret );
  317. /*
  318. * Output final state
  319. */
  320. MBEDTLS_PUT_UINT32_BE( ctx->state[0], output, 0 );
  321. MBEDTLS_PUT_UINT32_BE( ctx->state[1], output, 4 );
  322. MBEDTLS_PUT_UINT32_BE( ctx->state[2], output, 8 );
  323. MBEDTLS_PUT_UINT32_BE( ctx->state[3], output, 12 );
  324. MBEDTLS_PUT_UINT32_BE( ctx->state[4], output, 16 );
  325. MBEDTLS_PUT_UINT32_BE( ctx->state[5], output, 20 );
  326. MBEDTLS_PUT_UINT32_BE( ctx->state[6], output, 24 );
  327. if( ctx->is224 == 0 )
  328. MBEDTLS_PUT_UINT32_BE( ctx->state[7], output, 28 );
  329. return( 0 );
  330. }
  331. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  332. void mbedtls_sha256_finish( mbedtls_sha256_context *ctx,
  333. unsigned char output[32] )
  334. {
  335. mbedtls_sha256_finish_ret( ctx, output );
  336. }
  337. #endif
  338. #endif /* !MBEDTLS_SHA256_ALT */
  339. /*
  340. * output = SHA-256( input buffer )
  341. */
  342. int mbedtls_sha256_ret( const unsigned char *input,
  343. size_t ilen,
  344. unsigned char output[32],
  345. int is224 )
  346. {
  347. int ret = MBEDTLS_ERR_ERROR_CORRUPTION_DETECTED;
  348. mbedtls_sha256_context ctx;
  349. SHA256_VALIDATE_RET( is224 == 0 || is224 == 1 );
  350. SHA256_VALIDATE_RET( ilen == 0 || input != NULL );
  351. SHA256_VALIDATE_RET( (unsigned char *)output != NULL );
  352. mbedtls_sha256_init( &ctx );
  353. if( ( ret = mbedtls_sha256_starts_ret( &ctx, is224 ) ) != 0 )
  354. goto exit;
  355. if( ( ret = mbedtls_sha256_update_ret( &ctx, input, ilen ) ) != 0 )
  356. goto exit;
  357. if( ( ret = mbedtls_sha256_finish_ret( &ctx, output ) ) != 0 )
  358. goto exit;
  359. exit:
  360. mbedtls_sha256_free( &ctx );
  361. return( ret );
  362. }
  363. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  364. void mbedtls_sha256( const unsigned char *input,
  365. size_t ilen,
  366. unsigned char output[32],
  367. int is224 )
  368. {
  369. mbedtls_sha256_ret( input, ilen, output, is224 );
  370. }
  371. #endif
  372. #if defined(MBEDTLS_SELF_TEST)
  373. /*
  374. * FIPS-180-2 test vectors
  375. */
  376. static const unsigned char sha256_test_buf[3][57] =
  377. {
  378. { "abc" },
  379. { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
  380. { "" }
  381. };
  382. static const size_t sha256_test_buflen[3] =
  383. {
  384. 3, 56, 1000
  385. };
  386. static const unsigned char sha256_test_sum[6][32] =
  387. {
  388. /*
  389. * SHA-224 test vectors
  390. */
  391. { 0x23, 0x09, 0x7D, 0x22, 0x34, 0x05, 0xD8, 0x22,
  392. 0x86, 0x42, 0xA4, 0x77, 0xBD, 0xA2, 0x55, 0xB3,
  393. 0x2A, 0xAD, 0xBC, 0xE4, 0xBD, 0xA0, 0xB3, 0xF7,
  394. 0xE3, 0x6C, 0x9D, 0xA7 },
  395. { 0x75, 0x38, 0x8B, 0x16, 0x51, 0x27, 0x76, 0xCC,
  396. 0x5D, 0xBA, 0x5D, 0xA1, 0xFD, 0x89, 0x01, 0x50,
  397. 0xB0, 0xC6, 0x45, 0x5C, 0xB4, 0xF5, 0x8B, 0x19,
  398. 0x52, 0x52, 0x25, 0x25 },
  399. { 0x20, 0x79, 0x46, 0x55, 0x98, 0x0C, 0x91, 0xD8,
  400. 0xBB, 0xB4, 0xC1, 0xEA, 0x97, 0x61, 0x8A, 0x4B,
  401. 0xF0, 0x3F, 0x42, 0x58, 0x19, 0x48, 0xB2, 0xEE,
  402. 0x4E, 0xE7, 0xAD, 0x67 },
  403. /*
  404. * SHA-256 test vectors
  405. */
  406. { 0xBA, 0x78, 0x16, 0xBF, 0x8F, 0x01, 0xCF, 0xEA,
  407. 0x41, 0x41, 0x40, 0xDE, 0x5D, 0xAE, 0x22, 0x23,
  408. 0xB0, 0x03, 0x61, 0xA3, 0x96, 0x17, 0x7A, 0x9C,
  409. 0xB4, 0x10, 0xFF, 0x61, 0xF2, 0x00, 0x15, 0xAD },
  410. { 0x24, 0x8D, 0x6A, 0x61, 0xD2, 0x06, 0x38, 0xB8,
  411. 0xE5, 0xC0, 0x26, 0x93, 0x0C, 0x3E, 0x60, 0x39,
  412. 0xA3, 0x3C, 0xE4, 0x59, 0x64, 0xFF, 0x21, 0x67,
  413. 0xF6, 0xEC, 0xED, 0xD4, 0x19, 0xDB, 0x06, 0xC1 },
  414. { 0xCD, 0xC7, 0x6E, 0x5C, 0x99, 0x14, 0xFB, 0x92,
  415. 0x81, 0xA1, 0xC7, 0xE2, 0x84, 0xD7, 0x3E, 0x67,
  416. 0xF1, 0x80, 0x9A, 0x48, 0xA4, 0x97, 0x20, 0x0E,
  417. 0x04, 0x6D, 0x39, 0xCC, 0xC7, 0x11, 0x2C, 0xD0 }
  418. };
  419. /*
  420. * Checkup routine
  421. */
  422. int mbedtls_sha256_self_test( int verbose )
  423. {
  424. int i, j, k, buflen, ret = 0;
  425. unsigned char *buf;
  426. unsigned char sha256sum[32];
  427. mbedtls_sha256_context ctx;
  428. buf = mbedtls_calloc( 1024, sizeof(unsigned char) );
  429. if( NULL == buf )
  430. {
  431. if( verbose != 0 )
  432. mbedtls_printf( "Buffer allocation failed\n" );
  433. return( 1 );
  434. }
  435. mbedtls_sha256_init( &ctx );
  436. for( i = 0; i < 6; i++ )
  437. {
  438. j = i % 3;
  439. k = i < 3;
  440. if( verbose != 0 )
  441. mbedtls_printf( " SHA-%d test #%d: ", 256 - k * 32, j + 1 );
  442. if( ( ret = mbedtls_sha256_starts_ret( &ctx, k ) ) != 0 )
  443. goto fail;
  444. if( j == 2 )
  445. {
  446. memset( buf, 'a', buflen = 1000 );
  447. for( j = 0; j < 1000; j++ )
  448. {
  449. ret = mbedtls_sha256_update_ret( &ctx, buf, buflen );
  450. if( ret != 0 )
  451. goto fail;
  452. }
  453. }
  454. else
  455. {
  456. ret = mbedtls_sha256_update_ret( &ctx, sha256_test_buf[j],
  457. sha256_test_buflen[j] );
  458. if( ret != 0 )
  459. goto fail;
  460. }
  461. if( ( ret = mbedtls_sha256_finish_ret( &ctx, sha256sum ) ) != 0 )
  462. goto fail;
  463. if( memcmp( sha256sum, sha256_test_sum[i], 32 - k * 4 ) != 0 )
  464. {
  465. ret = 1;
  466. goto fail;
  467. }
  468. if( verbose != 0 )
  469. mbedtls_printf( "passed\n" );
  470. }
  471. if( verbose != 0 )
  472. mbedtls_printf( "\n" );
  473. goto exit;
  474. fail:
  475. if( verbose != 0 )
  476. mbedtls_printf( "failed\n" );
  477. exit:
  478. mbedtls_sha256_free( &ctx );
  479. mbedtls_free( buf );
  480. return( ret );
  481. }
  482. #endif /* MBEDTLS_SELF_TEST */
  483. #endif /* MBEDTLS_SHA256_C */