sha512.c 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517
  1. /*
  2. * FIPS-180-2 compliant SHA-384/512 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-512 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_SHA512_C)
  34. #include "mbedtls/sha512.h"
  35. #if defined(_MSC_VER) || defined(__WATCOMC__)
  36. #define UL64(x) x##ui64
  37. #else
  38. #define UL64(x) x##ULL
  39. #endif
  40. #include <string.h>
  41. #if defined(MBEDTLS_SELF_TEST)
  42. #if defined(MBEDTLS_PLATFORM_C)
  43. #include "mbedtls/platform.h"
  44. #else
  45. #include <stdio.h>
  46. #include <stdlib.h>
  47. #define mbedtls_printf printf
  48. #define mbedtls_calloc calloc
  49. #define mbedtls_free free
  50. #endif /* MBEDTLS_PLATFORM_C */
  51. #endif /* MBEDTLS_SELF_TEST */
  52. #if !defined(MBEDTLS_SHA512_ALT)
  53. /* Implementation that should never be optimized out by the compiler */
  54. static void mbedtls_zeroize( void *v, size_t n ) {
  55. volatile unsigned char *p = v; while( n-- ) *p++ = 0;
  56. }
  57. /*
  58. * 64-bit integer manipulation macros (big endian)
  59. */
  60. #ifndef GET_UINT64_BE
  61. #define GET_UINT64_BE(n,b,i) \
  62. { \
  63. (n) = ( (uint64_t) (b)[(i) ] << 56 ) \
  64. | ( (uint64_t) (b)[(i) + 1] << 48 ) \
  65. | ( (uint64_t) (b)[(i) + 2] << 40 ) \
  66. | ( (uint64_t) (b)[(i) + 3] << 32 ) \
  67. | ( (uint64_t) (b)[(i) + 4] << 24 ) \
  68. | ( (uint64_t) (b)[(i) + 5] << 16 ) \
  69. | ( (uint64_t) (b)[(i) + 6] << 8 ) \
  70. | ( (uint64_t) (b)[(i) + 7] ); \
  71. }
  72. #endif /* GET_UINT64_BE */
  73. #ifndef PUT_UINT64_BE
  74. #define PUT_UINT64_BE(n,b,i) \
  75. { \
  76. (b)[(i) ] = (unsigned char) ( (n) >> 56 ); \
  77. (b)[(i) + 1] = (unsigned char) ( (n) >> 48 ); \
  78. (b)[(i) + 2] = (unsigned char) ( (n) >> 40 ); \
  79. (b)[(i) + 3] = (unsigned char) ( (n) >> 32 ); \
  80. (b)[(i) + 4] = (unsigned char) ( (n) >> 24 ); \
  81. (b)[(i) + 5] = (unsigned char) ( (n) >> 16 ); \
  82. (b)[(i) + 6] = (unsigned char) ( (n) >> 8 ); \
  83. (b)[(i) + 7] = (unsigned char) ( (n) ); \
  84. }
  85. #endif /* PUT_UINT64_BE */
  86. void mbedtls_sha512_init( mbedtls_sha512_context *ctx )
  87. {
  88. memset( ctx, 0, sizeof( mbedtls_sha512_context ) );
  89. }
  90. void mbedtls_sha512_free( mbedtls_sha512_context *ctx )
  91. {
  92. if( ctx == NULL )
  93. return;
  94. mbedtls_zeroize( ctx, sizeof( mbedtls_sha512_context ) );
  95. }
  96. void mbedtls_sha512_clone( mbedtls_sha512_context *dst,
  97. const mbedtls_sha512_context *src )
  98. {
  99. *dst = *src;
  100. }
  101. /*
  102. * SHA-512 context setup
  103. */
  104. void mbedtls_sha512_starts( mbedtls_sha512_context *ctx, int is384 )
  105. {
  106. ctx->total[0] = 0;
  107. ctx->total[1] = 0;
  108. if( is384 == 0 )
  109. {
  110. /* SHA-512 */
  111. ctx->state[0] = UL64(0x6A09E667F3BCC908);
  112. ctx->state[1] = UL64(0xBB67AE8584CAA73B);
  113. ctx->state[2] = UL64(0x3C6EF372FE94F82B);
  114. ctx->state[3] = UL64(0xA54FF53A5F1D36F1);
  115. ctx->state[4] = UL64(0x510E527FADE682D1);
  116. ctx->state[5] = UL64(0x9B05688C2B3E6C1F);
  117. ctx->state[6] = UL64(0x1F83D9ABFB41BD6B);
  118. ctx->state[7] = UL64(0x5BE0CD19137E2179);
  119. }
  120. else
  121. {
  122. /* SHA-384 */
  123. ctx->state[0] = UL64(0xCBBB9D5DC1059ED8);
  124. ctx->state[1] = UL64(0x629A292A367CD507);
  125. ctx->state[2] = UL64(0x9159015A3070DD17);
  126. ctx->state[3] = UL64(0x152FECD8F70E5939);
  127. ctx->state[4] = UL64(0x67332667FFC00B31);
  128. ctx->state[5] = UL64(0x8EB44A8768581511);
  129. ctx->state[6] = UL64(0xDB0C2E0D64F98FA7);
  130. ctx->state[7] = UL64(0x47B5481DBEFA4FA4);
  131. }
  132. ctx->is384 = is384;
  133. }
  134. #if !defined(MBEDTLS_SHA512_PROCESS_ALT)
  135. /*
  136. * Round constants
  137. */
  138. static const uint64_t K[80] =
  139. {
  140. UL64(0x428A2F98D728AE22), UL64(0x7137449123EF65CD),
  141. UL64(0xB5C0FBCFEC4D3B2F), UL64(0xE9B5DBA58189DBBC),
  142. UL64(0x3956C25BF348B538), UL64(0x59F111F1B605D019),
  143. UL64(0x923F82A4AF194F9B), UL64(0xAB1C5ED5DA6D8118),
  144. UL64(0xD807AA98A3030242), UL64(0x12835B0145706FBE),
  145. UL64(0x243185BE4EE4B28C), UL64(0x550C7DC3D5FFB4E2),
  146. UL64(0x72BE5D74F27B896F), UL64(0x80DEB1FE3B1696B1),
  147. UL64(0x9BDC06A725C71235), UL64(0xC19BF174CF692694),
  148. UL64(0xE49B69C19EF14AD2), UL64(0xEFBE4786384F25E3),
  149. UL64(0x0FC19DC68B8CD5B5), UL64(0x240CA1CC77AC9C65),
  150. UL64(0x2DE92C6F592B0275), UL64(0x4A7484AA6EA6E483),
  151. UL64(0x5CB0A9DCBD41FBD4), UL64(0x76F988DA831153B5),
  152. UL64(0x983E5152EE66DFAB), UL64(0xA831C66D2DB43210),
  153. UL64(0xB00327C898FB213F), UL64(0xBF597FC7BEEF0EE4),
  154. UL64(0xC6E00BF33DA88FC2), UL64(0xD5A79147930AA725),
  155. UL64(0x06CA6351E003826F), UL64(0x142929670A0E6E70),
  156. UL64(0x27B70A8546D22FFC), UL64(0x2E1B21385C26C926),
  157. UL64(0x4D2C6DFC5AC42AED), UL64(0x53380D139D95B3DF),
  158. UL64(0x650A73548BAF63DE), UL64(0x766A0ABB3C77B2A8),
  159. UL64(0x81C2C92E47EDAEE6), UL64(0x92722C851482353B),
  160. UL64(0xA2BFE8A14CF10364), UL64(0xA81A664BBC423001),
  161. UL64(0xC24B8B70D0F89791), UL64(0xC76C51A30654BE30),
  162. UL64(0xD192E819D6EF5218), UL64(0xD69906245565A910),
  163. UL64(0xF40E35855771202A), UL64(0x106AA07032BBD1B8),
  164. UL64(0x19A4C116B8D2D0C8), UL64(0x1E376C085141AB53),
  165. UL64(0x2748774CDF8EEB99), UL64(0x34B0BCB5E19B48A8),
  166. UL64(0x391C0CB3C5C95A63), UL64(0x4ED8AA4AE3418ACB),
  167. UL64(0x5B9CCA4F7763E373), UL64(0x682E6FF3D6B2B8A3),
  168. UL64(0x748F82EE5DEFB2FC), UL64(0x78A5636F43172F60),
  169. UL64(0x84C87814A1F0AB72), UL64(0x8CC702081A6439EC),
  170. UL64(0x90BEFFFA23631E28), UL64(0xA4506CEBDE82BDE9),
  171. UL64(0xBEF9A3F7B2C67915), UL64(0xC67178F2E372532B),
  172. UL64(0xCA273ECEEA26619C), UL64(0xD186B8C721C0C207),
  173. UL64(0xEADA7DD6CDE0EB1E), UL64(0xF57D4F7FEE6ED178),
  174. UL64(0x06F067AA72176FBA), UL64(0x0A637DC5A2C898A6),
  175. UL64(0x113F9804BEF90DAE), UL64(0x1B710B35131C471B),
  176. UL64(0x28DB77F523047D84), UL64(0x32CAAB7B40C72493),
  177. UL64(0x3C9EBE0A15C9BEBC), UL64(0x431D67C49C100D4C),
  178. UL64(0x4CC5D4BECB3E42B6), UL64(0x597F299CFC657E2A),
  179. UL64(0x5FCB6FAB3AD6FAEC), UL64(0x6C44198C4A475817)
  180. };
  181. void mbedtls_sha512_process( mbedtls_sha512_context *ctx, const unsigned char data[128] )
  182. {
  183. int i;
  184. uint64_t temp1, temp2, W[80];
  185. uint64_t A, B, C, D, E, F, G, H;
  186. #define SHR(x,n) (x >> n)
  187. #define ROTR(x,n) (SHR(x,n) | (x << (64 - n)))
  188. #define S0(x) (ROTR(x, 1) ^ ROTR(x, 8) ^ SHR(x, 7))
  189. #define S1(x) (ROTR(x,19) ^ ROTR(x,61) ^ SHR(x, 6))
  190. #define S2(x) (ROTR(x,28) ^ ROTR(x,34) ^ ROTR(x,39))
  191. #define S3(x) (ROTR(x,14) ^ ROTR(x,18) ^ ROTR(x,41))
  192. #define F0(x,y,z) ((x & y) | (z & (x | y)))
  193. #define F1(x,y,z) (z ^ (x & (y ^ z)))
  194. #define P(a,b,c,d,e,f,g,h,x,K) \
  195. { \
  196. temp1 = h + S3(e) + F1(e,f,g) + K + x; \
  197. temp2 = S2(a) + F0(a,b,c); \
  198. d += temp1; h = temp1 + temp2; \
  199. }
  200. for( i = 0; i < 16; i++ )
  201. {
  202. GET_UINT64_BE( W[i], data, i << 3 );
  203. }
  204. for( ; i < 80; i++ )
  205. {
  206. W[i] = S1(W[i - 2]) + W[i - 7] +
  207. S0(W[i - 15]) + W[i - 16];
  208. }
  209. A = ctx->state[0];
  210. B = ctx->state[1];
  211. C = ctx->state[2];
  212. D = ctx->state[3];
  213. E = ctx->state[4];
  214. F = ctx->state[5];
  215. G = ctx->state[6];
  216. H = ctx->state[7];
  217. i = 0;
  218. do
  219. {
  220. P( A, B, C, D, E, F, G, H, W[i], K[i] ); i++;
  221. P( H, A, B, C, D, E, F, G, W[i], K[i] ); i++;
  222. P( G, H, A, B, C, D, E, F, W[i], K[i] ); i++;
  223. P( F, G, H, A, B, C, D, E, W[i], K[i] ); i++;
  224. P( E, F, G, H, A, B, C, D, W[i], K[i] ); i++;
  225. P( D, E, F, G, H, A, B, C, W[i], K[i] ); i++;
  226. P( C, D, E, F, G, H, A, B, W[i], K[i] ); i++;
  227. P( B, C, D, E, F, G, H, A, W[i], K[i] ); i++;
  228. }
  229. while( i < 80 );
  230. ctx->state[0] += A;
  231. ctx->state[1] += B;
  232. ctx->state[2] += C;
  233. ctx->state[3] += D;
  234. ctx->state[4] += E;
  235. ctx->state[5] += F;
  236. ctx->state[6] += G;
  237. ctx->state[7] += H;
  238. }
  239. #endif /* !MBEDTLS_SHA512_PROCESS_ALT */
  240. /*
  241. * SHA-512 process buffer
  242. */
  243. void mbedtls_sha512_update( mbedtls_sha512_context *ctx, const unsigned char *input,
  244. size_t ilen )
  245. {
  246. size_t fill;
  247. unsigned int left;
  248. if( ilen == 0 )
  249. return;
  250. left = (unsigned int) (ctx->total[0] & 0x7F);
  251. fill = 128 - left;
  252. ctx->total[0] += (uint64_t) ilen;
  253. if( ctx->total[0] < (uint64_t) ilen )
  254. ctx->total[1]++;
  255. if( left && ilen >= fill )
  256. {
  257. memcpy( (void *) (ctx->buffer + left), input, fill );
  258. mbedtls_sha512_process( ctx, ctx->buffer );
  259. input += fill;
  260. ilen -= fill;
  261. left = 0;
  262. }
  263. while( ilen >= 128 )
  264. {
  265. mbedtls_sha512_process( ctx, input );
  266. input += 128;
  267. ilen -= 128;
  268. }
  269. if( ilen > 0 )
  270. memcpy( (void *) (ctx->buffer + left), input, ilen );
  271. }
  272. static const unsigned char sha512_padding[128] =
  273. {
  274. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  275. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  276. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  277. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  278. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  279. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  280. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  281. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  282. };
  283. /*
  284. * SHA-512 final digest
  285. */
  286. void mbedtls_sha512_finish( mbedtls_sha512_context *ctx, unsigned char output[64] )
  287. {
  288. size_t last, padn;
  289. uint64_t high, low;
  290. unsigned char msglen[16];
  291. high = ( ctx->total[0] >> 61 )
  292. | ( ctx->total[1] << 3 );
  293. low = ( ctx->total[0] << 3 );
  294. PUT_UINT64_BE( high, msglen, 0 );
  295. PUT_UINT64_BE( low, msglen, 8 );
  296. last = (size_t)( ctx->total[0] & 0x7F );
  297. padn = ( last < 112 ) ? ( 112 - last ) : ( 240 - last );
  298. mbedtls_sha512_update( ctx, sha512_padding, padn );
  299. mbedtls_sha512_update( ctx, msglen, 16 );
  300. PUT_UINT64_BE( ctx->state[0], output, 0 );
  301. PUT_UINT64_BE( ctx->state[1], output, 8 );
  302. PUT_UINT64_BE( ctx->state[2], output, 16 );
  303. PUT_UINT64_BE( ctx->state[3], output, 24 );
  304. PUT_UINT64_BE( ctx->state[4], output, 32 );
  305. PUT_UINT64_BE( ctx->state[5], output, 40 );
  306. if( ctx->is384 == 0 )
  307. {
  308. PUT_UINT64_BE( ctx->state[6], output, 48 );
  309. PUT_UINT64_BE( ctx->state[7], output, 56 );
  310. }
  311. }
  312. #endif /* !MBEDTLS_SHA512_ALT */
  313. /*
  314. * output = SHA-512( input buffer )
  315. */
  316. void mbedtls_sha512( const unsigned char *input, size_t ilen,
  317. unsigned char output[64], int is384 )
  318. {
  319. mbedtls_sha512_context ctx;
  320. mbedtls_sha512_init( &ctx );
  321. mbedtls_sha512_starts( &ctx, is384 );
  322. mbedtls_sha512_update( &ctx, input, ilen );
  323. mbedtls_sha512_finish( &ctx, output );
  324. mbedtls_sha512_free( &ctx );
  325. }
  326. #if defined(MBEDTLS_SELF_TEST)
  327. /*
  328. * FIPS-180-2 test vectors
  329. */
  330. static const unsigned char sha512_test_buf[3][113] =
  331. {
  332. { "abc" },
  333. { "abcdefghbcdefghicdefghijdefghijkefghijklfghijklmghijklmn"
  334. "hijklmnoijklmnopjklmnopqklmnopqrlmnopqrsmnopqrstnopqrstu" },
  335. { "" }
  336. };
  337. static const int sha512_test_buflen[3] =
  338. {
  339. 3, 112, 1000
  340. };
  341. static const unsigned char sha512_test_sum[6][64] =
  342. {
  343. /*
  344. * SHA-384 test vectors
  345. */
  346. { 0xCB, 0x00, 0x75, 0x3F, 0x45, 0xA3, 0x5E, 0x8B,
  347. 0xB5, 0xA0, 0x3D, 0x69, 0x9A, 0xC6, 0x50, 0x07,
  348. 0x27, 0x2C, 0x32, 0xAB, 0x0E, 0xDE, 0xD1, 0x63,
  349. 0x1A, 0x8B, 0x60, 0x5A, 0x43, 0xFF, 0x5B, 0xED,
  350. 0x80, 0x86, 0x07, 0x2B, 0xA1, 0xE7, 0xCC, 0x23,
  351. 0x58, 0xBA, 0xEC, 0xA1, 0x34, 0xC8, 0x25, 0xA7 },
  352. { 0x09, 0x33, 0x0C, 0x33, 0xF7, 0x11, 0x47, 0xE8,
  353. 0x3D, 0x19, 0x2F, 0xC7, 0x82, 0xCD, 0x1B, 0x47,
  354. 0x53, 0x11, 0x1B, 0x17, 0x3B, 0x3B, 0x05, 0xD2,
  355. 0x2F, 0xA0, 0x80, 0x86, 0xE3, 0xB0, 0xF7, 0x12,
  356. 0xFC, 0xC7, 0xC7, 0x1A, 0x55, 0x7E, 0x2D, 0xB9,
  357. 0x66, 0xC3, 0xE9, 0xFA, 0x91, 0x74, 0x60, 0x39 },
  358. { 0x9D, 0x0E, 0x18, 0x09, 0x71, 0x64, 0x74, 0xCB,
  359. 0x08, 0x6E, 0x83, 0x4E, 0x31, 0x0A, 0x4A, 0x1C,
  360. 0xED, 0x14, 0x9E, 0x9C, 0x00, 0xF2, 0x48, 0x52,
  361. 0x79, 0x72, 0xCE, 0xC5, 0x70, 0x4C, 0x2A, 0x5B,
  362. 0x07, 0xB8, 0xB3, 0xDC, 0x38, 0xEC, 0xC4, 0xEB,
  363. 0xAE, 0x97, 0xDD, 0xD8, 0x7F, 0x3D, 0x89, 0x85 },
  364. /*
  365. * SHA-512 test vectors
  366. */
  367. { 0xDD, 0xAF, 0x35, 0xA1, 0x93, 0x61, 0x7A, 0xBA,
  368. 0xCC, 0x41, 0x73, 0x49, 0xAE, 0x20, 0x41, 0x31,
  369. 0x12, 0xE6, 0xFA, 0x4E, 0x89, 0xA9, 0x7E, 0xA2,
  370. 0x0A, 0x9E, 0xEE, 0xE6, 0x4B, 0x55, 0xD3, 0x9A,
  371. 0x21, 0x92, 0x99, 0x2A, 0x27, 0x4F, 0xC1, 0xA8,
  372. 0x36, 0xBA, 0x3C, 0x23, 0xA3, 0xFE, 0xEB, 0xBD,
  373. 0x45, 0x4D, 0x44, 0x23, 0x64, 0x3C, 0xE8, 0x0E,
  374. 0x2A, 0x9A, 0xC9, 0x4F, 0xA5, 0x4C, 0xA4, 0x9F },
  375. { 0x8E, 0x95, 0x9B, 0x75, 0xDA, 0xE3, 0x13, 0xDA,
  376. 0x8C, 0xF4, 0xF7, 0x28, 0x14, 0xFC, 0x14, 0x3F,
  377. 0x8F, 0x77, 0x79, 0xC6, 0xEB, 0x9F, 0x7F, 0xA1,
  378. 0x72, 0x99, 0xAE, 0xAD, 0xB6, 0x88, 0x90, 0x18,
  379. 0x50, 0x1D, 0x28, 0x9E, 0x49, 0x00, 0xF7, 0xE4,
  380. 0x33, 0x1B, 0x99, 0xDE, 0xC4, 0xB5, 0x43, 0x3A,
  381. 0xC7, 0xD3, 0x29, 0xEE, 0xB6, 0xDD, 0x26, 0x54,
  382. 0x5E, 0x96, 0xE5, 0x5B, 0x87, 0x4B, 0xE9, 0x09 },
  383. { 0xE7, 0x18, 0x48, 0x3D, 0x0C, 0xE7, 0x69, 0x64,
  384. 0x4E, 0x2E, 0x42, 0xC7, 0xBC, 0x15, 0xB4, 0x63,
  385. 0x8E, 0x1F, 0x98, 0xB1, 0x3B, 0x20, 0x44, 0x28,
  386. 0x56, 0x32, 0xA8, 0x03, 0xAF, 0xA9, 0x73, 0xEB,
  387. 0xDE, 0x0F, 0xF2, 0x44, 0x87, 0x7E, 0xA6, 0x0A,
  388. 0x4C, 0xB0, 0x43, 0x2C, 0xE5, 0x77, 0xC3, 0x1B,
  389. 0xEB, 0x00, 0x9C, 0x5C, 0x2C, 0x49, 0xAA, 0x2E,
  390. 0x4E, 0xAD, 0xB2, 0x17, 0xAD, 0x8C, 0xC0, 0x9B }
  391. };
  392. /*
  393. * Checkup routine
  394. */
  395. int mbedtls_sha512_self_test( int verbose )
  396. {
  397. int i, j, k, buflen, ret = 0;
  398. unsigned char *buf;
  399. unsigned char sha512sum[64];
  400. mbedtls_sha512_context ctx;
  401. buf = mbedtls_calloc( 1024, sizeof(unsigned char) );
  402. if( NULL == buf )
  403. {
  404. if( verbose != 0 )
  405. mbedtls_printf( "Buffer allocation failed\n" );
  406. return( 1 );
  407. }
  408. mbedtls_sha512_init( &ctx );
  409. for( i = 0; i < 6; i++ )
  410. {
  411. j = i % 3;
  412. k = i < 3;
  413. if( verbose != 0 )
  414. mbedtls_printf( " SHA-%d test #%d: ", 512 - k * 128, j + 1 );
  415. mbedtls_sha512_starts( &ctx, k );
  416. if( j == 2 )
  417. {
  418. memset( buf, 'a', buflen = 1000 );
  419. for( j = 0; j < 1000; j++ )
  420. mbedtls_sha512_update( &ctx, buf, buflen );
  421. }
  422. else
  423. mbedtls_sha512_update( &ctx, sha512_test_buf[j],
  424. sha512_test_buflen[j] );
  425. mbedtls_sha512_finish( &ctx, sha512sum );
  426. if( memcmp( sha512sum, sha512_test_sum[i], 64 - k * 16 ) != 0 )
  427. {
  428. if( verbose != 0 )
  429. mbedtls_printf( "failed\n" );
  430. ret = 1;
  431. goto exit;
  432. }
  433. if( verbose != 0 )
  434. mbedtls_printf( "passed\n" );
  435. }
  436. if( verbose != 0 )
  437. mbedtls_printf( "\n" );
  438. exit:
  439. mbedtls_sha512_free( &ctx );
  440. mbedtls_free( buf );
  441. return( ret );
  442. }
  443. #endif /* MBEDTLS_SELF_TEST */
  444. #endif /* MBEDTLS_SHA512_C */