sha1.c 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551
  1. /*
  2. * FIPS-180-1 compliant SHA-1 implementation
  3. *
  4. * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved
  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. * This file is part of mbed TLS (https://tls.mbed.org)
  20. */
  21. /*
  22. * The SHA-1 standard was published by NIST in 1993.
  23. *
  24. * http://www.itl.nist.gov/fipspubs/fip180-1.htm
  25. */
  26. #if !defined(MBEDTLS_CONFIG_FILE)
  27. #include "mbedtls/config.h"
  28. #else
  29. #include MBEDTLS_CONFIG_FILE
  30. #endif
  31. #if defined(MBEDTLS_SHA1_C)
  32. #include "mbedtls/sha1.h"
  33. #include <string.h>
  34. #if defined(MBEDTLS_SELF_TEST)
  35. #if defined(MBEDTLS_PLATFORM_C)
  36. #include "mbedtls/platform.h"
  37. #else
  38. #include <stdio.h>
  39. #define mbedtls_printf printf
  40. #endif /* MBEDTLS_PLATFORM_C */
  41. #endif /* MBEDTLS_SELF_TEST */
  42. #if !defined(MBEDTLS_SHA1_ALT)
  43. /* Implementation that should never be optimized out by the compiler */
  44. static void mbedtls_zeroize( void *v, size_t n ) {
  45. volatile unsigned char *p = (unsigned char*)v; while( n-- ) *p++ = 0;
  46. }
  47. /*
  48. * 32-bit integer manipulation macros (big endian)
  49. */
  50. #ifndef GET_UINT32_BE
  51. #define GET_UINT32_BE(n,b,i) \
  52. { \
  53. (n) = ( (uint32_t) (b)[(i) ] << 24 ) \
  54. | ( (uint32_t) (b)[(i) + 1] << 16 ) \
  55. | ( (uint32_t) (b)[(i) + 2] << 8 ) \
  56. | ( (uint32_t) (b)[(i) + 3] ); \
  57. }
  58. #endif
  59. #ifndef PUT_UINT32_BE
  60. #define PUT_UINT32_BE(n,b,i) \
  61. { \
  62. (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \
  63. (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \
  64. (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \
  65. (b)[(i) + 3] = (unsigned char) ( (n) ); \
  66. }
  67. #endif
  68. void mbedtls_sha1_init( mbedtls_sha1_context *ctx )
  69. {
  70. memset( ctx, 0, sizeof( mbedtls_sha1_context ) );
  71. }
  72. void mbedtls_sha1_free( mbedtls_sha1_context *ctx )
  73. {
  74. if( ctx == NULL )
  75. return;
  76. mbedtls_zeroize( ctx, sizeof( mbedtls_sha1_context ) );
  77. }
  78. void mbedtls_sha1_clone( mbedtls_sha1_context *dst,
  79. const mbedtls_sha1_context *src )
  80. {
  81. *dst = *src;
  82. }
  83. /*
  84. * SHA-1 context setup
  85. */
  86. int mbedtls_sha1_starts_ret( mbedtls_sha1_context *ctx )
  87. {
  88. ctx->total[0] = 0;
  89. ctx->total[1] = 0;
  90. ctx->state[0] = 0x67452301;
  91. ctx->state[1] = 0xEFCDAB89;
  92. ctx->state[2] = 0x98BADCFE;
  93. ctx->state[3] = 0x10325476;
  94. ctx->state[4] = 0xC3D2E1F0;
  95. return( 0 );
  96. }
  97. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  98. void mbedtls_sha1_starts( mbedtls_sha1_context *ctx )
  99. {
  100. mbedtls_sha1_starts_ret( ctx );
  101. }
  102. #endif
  103. #if !defined(MBEDTLS_SHA1_PROCESS_ALT)
  104. int mbedtls_internal_sha1_process( mbedtls_sha1_context *ctx,
  105. const unsigned char data[64] )
  106. {
  107. uint32_t temp, W[16], A, B, C, D, E;
  108. GET_UINT32_BE( W[ 0], data, 0 );
  109. GET_UINT32_BE( W[ 1], data, 4 );
  110. GET_UINT32_BE( W[ 2], data, 8 );
  111. GET_UINT32_BE( W[ 3], data, 12 );
  112. GET_UINT32_BE( W[ 4], data, 16 );
  113. GET_UINT32_BE( W[ 5], data, 20 );
  114. GET_UINT32_BE( W[ 6], data, 24 );
  115. GET_UINT32_BE( W[ 7], data, 28 );
  116. GET_UINT32_BE( W[ 8], data, 32 );
  117. GET_UINT32_BE( W[ 9], data, 36 );
  118. GET_UINT32_BE( W[10], data, 40 );
  119. GET_UINT32_BE( W[11], data, 44 );
  120. GET_UINT32_BE( W[12], data, 48 );
  121. GET_UINT32_BE( W[13], data, 52 );
  122. GET_UINT32_BE( W[14], data, 56 );
  123. GET_UINT32_BE( W[15], data, 60 );
  124. #define S(x,n) ((x << n) | ((x & 0xFFFFFFFF) >> (32 - n)))
  125. #define R(t) \
  126. ( \
  127. temp = W[( t - 3 ) & 0x0F] ^ W[( t - 8 ) & 0x0F] ^ \
  128. W[( t - 14 ) & 0x0F] ^ W[ t & 0x0F], \
  129. ( W[t & 0x0F] = S(temp,1) ) \
  130. )
  131. #define P(a,b,c,d,e,x) \
  132. { \
  133. e += S(a,5) + F(b,c,d) + K + x; b = S(b,30); \
  134. }
  135. A = ctx->state[0];
  136. B = ctx->state[1];
  137. C = ctx->state[2];
  138. D = ctx->state[3];
  139. E = ctx->state[4];
  140. #define F(x,y,z) (z ^ (x & (y ^ z)))
  141. #define K 0x5A827999
  142. P( A, B, C, D, E, W[0] );
  143. P( E, A, B, C, D, W[1] );
  144. P( D, E, A, B, C, W[2] );
  145. P( C, D, E, A, B, W[3] );
  146. P( B, C, D, E, A, W[4] );
  147. P( A, B, C, D, E, W[5] );
  148. P( E, A, B, C, D, W[6] );
  149. P( D, E, A, B, C, W[7] );
  150. P( C, D, E, A, B, W[8] );
  151. P( B, C, D, E, A, W[9] );
  152. P( A, B, C, D, E, W[10] );
  153. P( E, A, B, C, D, W[11] );
  154. P( D, E, A, B, C, W[12] );
  155. P( C, D, E, A, B, W[13] );
  156. P( B, C, D, E, A, W[14] );
  157. P( A, B, C, D, E, W[15] );
  158. P( E, A, B, C, D, R(16) );
  159. P( D, E, A, B, C, R(17) );
  160. P( C, D, E, A, B, R(18) );
  161. P( B, C, D, E, A, R(19) );
  162. #undef K
  163. #undef F
  164. #define F(x,y,z) (x ^ y ^ z)
  165. #define K 0x6ED9EBA1
  166. P( A, B, C, D, E, R(20) );
  167. P( E, A, B, C, D, R(21) );
  168. P( D, E, A, B, C, R(22) );
  169. P( C, D, E, A, B, R(23) );
  170. P( B, C, D, E, A, R(24) );
  171. P( A, B, C, D, E, R(25) );
  172. P( E, A, B, C, D, R(26) );
  173. P( D, E, A, B, C, R(27) );
  174. P( C, D, E, A, B, R(28) );
  175. P( B, C, D, E, A, R(29) );
  176. P( A, B, C, D, E, R(30) );
  177. P( E, A, B, C, D, R(31) );
  178. P( D, E, A, B, C, R(32) );
  179. P( C, D, E, A, B, R(33) );
  180. P( B, C, D, E, A, R(34) );
  181. P( A, B, C, D, E, R(35) );
  182. P( E, A, B, C, D, R(36) );
  183. P( D, E, A, B, C, R(37) );
  184. P( C, D, E, A, B, R(38) );
  185. P( B, C, D, E, A, R(39) );
  186. #undef K
  187. #undef F
  188. #define F(x,y,z) ((x & y) | (z & (x | y)))
  189. #define K 0x8F1BBCDC
  190. P( A, B, C, D, E, R(40) );
  191. P( E, A, B, C, D, R(41) );
  192. P( D, E, A, B, C, R(42) );
  193. P( C, D, E, A, B, R(43) );
  194. P( B, C, D, E, A, R(44) );
  195. P( A, B, C, D, E, R(45) );
  196. P( E, A, B, C, D, R(46) );
  197. P( D, E, A, B, C, R(47) );
  198. P( C, D, E, A, B, R(48) );
  199. P( B, C, D, E, A, R(49) );
  200. P( A, B, C, D, E, R(50) );
  201. P( E, A, B, C, D, R(51) );
  202. P( D, E, A, B, C, R(52) );
  203. P( C, D, E, A, B, R(53) );
  204. P( B, C, D, E, A, R(54) );
  205. P( A, B, C, D, E, R(55) );
  206. P( E, A, B, C, D, R(56) );
  207. P( D, E, A, B, C, R(57) );
  208. P( C, D, E, A, B, R(58) );
  209. P( B, C, D, E, A, R(59) );
  210. #undef K
  211. #undef F
  212. #define F(x,y,z) (x ^ y ^ z)
  213. #define K 0xCA62C1D6
  214. P( A, B, C, D, E, R(60) );
  215. P( E, A, B, C, D, R(61) );
  216. P( D, E, A, B, C, R(62) );
  217. P( C, D, E, A, B, R(63) );
  218. P( B, C, D, E, A, R(64) );
  219. P( A, B, C, D, E, R(65) );
  220. P( E, A, B, C, D, R(66) );
  221. P( D, E, A, B, C, R(67) );
  222. P( C, D, E, A, B, R(68) );
  223. P( B, C, D, E, A, R(69) );
  224. P( A, B, C, D, E, R(70) );
  225. P( E, A, B, C, D, R(71) );
  226. P( D, E, A, B, C, R(72) );
  227. P( C, D, E, A, B, R(73) );
  228. P( B, C, D, E, A, R(74) );
  229. P( A, B, C, D, E, R(75) );
  230. P( E, A, B, C, D, R(76) );
  231. P( D, E, A, B, C, R(77) );
  232. P( C, D, E, A, B, R(78) );
  233. P( B, C, D, E, A, R(79) );
  234. #undef K
  235. #undef F
  236. ctx->state[0] += A;
  237. ctx->state[1] += B;
  238. ctx->state[2] += C;
  239. ctx->state[3] += D;
  240. ctx->state[4] += E;
  241. return( 0 );
  242. }
  243. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  244. void mbedtls_sha1_process( mbedtls_sha1_context *ctx,
  245. const unsigned char data[64] )
  246. {
  247. mbedtls_internal_sha1_process( ctx, data );
  248. }
  249. #endif
  250. #endif /* !MBEDTLS_SHA1_PROCESS_ALT */
  251. /*
  252. * SHA-1 process buffer
  253. */
  254. int mbedtls_sha1_update_ret( mbedtls_sha1_context *ctx,
  255. const unsigned char *input,
  256. size_t ilen )
  257. {
  258. int ret;
  259. size_t fill;
  260. uint32_t left;
  261. if( ilen == 0 )
  262. return( 0 );
  263. left = ctx->total[0] & 0x3F;
  264. fill = 64 - left;
  265. ctx->total[0] += (uint32_t) ilen;
  266. ctx->total[0] &= 0xFFFFFFFF;
  267. if( ctx->total[0] < (uint32_t) ilen )
  268. ctx->total[1]++;
  269. if( left && ilen >= fill )
  270. {
  271. memcpy( (void *) (ctx->buffer + left), input, fill );
  272. if( ( ret = mbedtls_internal_sha1_process( ctx, ctx->buffer ) ) != 0 )
  273. return( ret );
  274. input += fill;
  275. ilen -= fill;
  276. left = 0;
  277. }
  278. while( ilen >= 64 )
  279. {
  280. if( ( ret = mbedtls_internal_sha1_process( ctx, input ) ) != 0 )
  281. return( ret );
  282. input += 64;
  283. ilen -= 64;
  284. }
  285. if( ilen > 0 )
  286. memcpy( (void *) (ctx->buffer + left), input, ilen );
  287. return( 0 );
  288. }
  289. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  290. void mbedtls_sha1_update( mbedtls_sha1_context *ctx,
  291. const unsigned char *input,
  292. size_t ilen )
  293. {
  294. mbedtls_sha1_update_ret( ctx, input, ilen );
  295. }
  296. #endif
  297. /*
  298. * SHA-1 final digest
  299. */
  300. int mbedtls_sha1_finish_ret( mbedtls_sha1_context *ctx,
  301. unsigned char output[20] )
  302. {
  303. int ret;
  304. uint32_t used;
  305. uint32_t high, low;
  306. /*
  307. * Add padding: 0x80 then 0x00 until 8 bytes remain for the length
  308. */
  309. used = ctx->total[0] & 0x3F;
  310. ctx->buffer[used++] = 0x80;
  311. if( used <= 56 )
  312. {
  313. /* Enough room for padding + length in current block */
  314. memset( ctx->buffer + used, 0, 56 - used );
  315. }
  316. else
  317. {
  318. /* We'll need an extra block */
  319. memset( ctx->buffer + used, 0, 64 - used );
  320. if( ( ret = mbedtls_internal_sha1_process( ctx, ctx->buffer ) ) != 0 )
  321. return( ret );
  322. memset( ctx->buffer, 0, 56 );
  323. }
  324. /*
  325. * Add message length
  326. */
  327. high = ( ctx->total[0] >> 29 )
  328. | ( ctx->total[1] << 3 );
  329. low = ( ctx->total[0] << 3 );
  330. PUT_UINT32_BE( high, ctx->buffer, 56 );
  331. PUT_UINT32_BE( low, ctx->buffer, 60 );
  332. if( ( ret = mbedtls_internal_sha1_process( ctx, ctx->buffer ) ) != 0 )
  333. return( ret );
  334. /*
  335. * Output final state
  336. */
  337. PUT_UINT32_BE( ctx->state[0], output, 0 );
  338. PUT_UINT32_BE( ctx->state[1], output, 4 );
  339. PUT_UINT32_BE( ctx->state[2], output, 8 );
  340. PUT_UINT32_BE( ctx->state[3], output, 12 );
  341. PUT_UINT32_BE( ctx->state[4], output, 16 );
  342. return( 0 );
  343. }
  344. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  345. void mbedtls_sha1_finish( mbedtls_sha1_context *ctx,
  346. unsigned char output[20] )
  347. {
  348. mbedtls_sha1_finish_ret( ctx, output );
  349. }
  350. #endif
  351. #endif /* !MBEDTLS_SHA1_ALT */
  352. /*
  353. * output = SHA-1( input buffer )
  354. */
  355. int mbedtls_sha1_ret( const unsigned char *input,
  356. size_t ilen,
  357. unsigned char output[20] )
  358. {
  359. int ret;
  360. mbedtls_sha1_context ctx;
  361. mbedtls_sha1_init( &ctx );
  362. if( ( ret = mbedtls_sha1_starts_ret( &ctx ) ) != 0 )
  363. goto exit;
  364. if( ( ret = mbedtls_sha1_update_ret( &ctx, input, ilen ) ) != 0 )
  365. goto exit;
  366. if( ( ret = mbedtls_sha1_finish_ret( &ctx, output ) ) != 0 )
  367. goto exit;
  368. exit:
  369. mbedtls_sha1_free( &ctx );
  370. return( ret );
  371. }
  372. #if !defined(MBEDTLS_DEPRECATED_REMOVED)
  373. void mbedtls_sha1( const unsigned char *input,
  374. size_t ilen,
  375. unsigned char output[20] )
  376. {
  377. mbedtls_sha1_ret( input, ilen, output );
  378. }
  379. #endif
  380. #if defined(MBEDTLS_SELF_TEST)
  381. /*
  382. * FIPS-180-1 test vectors
  383. */
  384. static const unsigned char sha1_test_buf[3][57] =
  385. {
  386. { "abc" },
  387. { "abcdbcdecdefdefgefghfghighijhijkijkljklmklmnlmnomnopnopq" },
  388. { "" }
  389. };
  390. static const size_t sha1_test_buflen[3] =
  391. {
  392. 3, 56, 1000
  393. };
  394. static const unsigned char sha1_test_sum[3][20] =
  395. {
  396. { 0xA9, 0x99, 0x3E, 0x36, 0x47, 0x06, 0x81, 0x6A, 0xBA, 0x3E,
  397. 0x25, 0x71, 0x78, 0x50, 0xC2, 0x6C, 0x9C, 0xD0, 0xD8, 0x9D },
  398. { 0x84, 0x98, 0x3E, 0x44, 0x1C, 0x3B, 0xD2, 0x6E, 0xBA, 0xAE,
  399. 0x4A, 0xA1, 0xF9, 0x51, 0x29, 0xE5, 0xE5, 0x46, 0x70, 0xF1 },
  400. { 0x34, 0xAA, 0x97, 0x3C, 0xD4, 0xC4, 0xDA, 0xA4, 0xF6, 0x1E,
  401. 0xEB, 0x2B, 0xDB, 0xAD, 0x27, 0x31, 0x65, 0x34, 0x01, 0x6F }
  402. };
  403. /*
  404. * Checkup routine
  405. */
  406. int mbedtls_sha1_self_test( int verbose )
  407. {
  408. int i, j, buflen, ret = 0;
  409. unsigned char buf[1024];
  410. unsigned char sha1sum[20];
  411. mbedtls_sha1_context ctx;
  412. mbedtls_sha1_init( &ctx );
  413. /*
  414. * SHA-1
  415. */
  416. for( i = 0; i < 3; i++ )
  417. {
  418. if( verbose != 0 )
  419. mbedtls_printf( " SHA-1 test #%d: ", i + 1 );
  420. if( ( ret = mbedtls_sha1_starts_ret( &ctx ) ) != 0 )
  421. goto fail;
  422. if( i == 2 )
  423. {
  424. memset( buf, 'a', buflen = 1000 );
  425. for( j = 0; j < 1000; j++ )
  426. {
  427. ret = mbedtls_sha1_update_ret( &ctx, buf, buflen );
  428. if( ret != 0 )
  429. goto fail;
  430. }
  431. }
  432. else
  433. {
  434. ret = mbedtls_sha1_update_ret( &ctx, sha1_test_buf[i],
  435. sha1_test_buflen[i] );
  436. if( ret != 0 )
  437. goto fail;
  438. }
  439. if( ( ret = mbedtls_sha1_finish_ret( &ctx, sha1sum ) ) != 0 )
  440. goto fail;
  441. if( memcmp( sha1sum, sha1_test_sum[i], 20 ) != 0 )
  442. {
  443. ret = 1;
  444. goto fail;
  445. }
  446. if( verbose != 0 )
  447. mbedtls_printf( "passed\n" );
  448. }
  449. if( verbose != 0 )
  450. mbedtls_printf( "\n" );
  451. goto exit;
  452. fail:
  453. if( verbose != 0 )
  454. mbedtls_printf( "failed\n" );
  455. exit:
  456. mbedtls_sha1_free( &ctx );
  457. return( ret );
  458. }
  459. #endif /* MBEDTLS_SELF_TEST */
  460. #endif /* MBEDTLS_SHA1_C */