关键词搜索

源码搜索 ×
×

tars源码分析之21

发布2022-07-17浏览738次

详情内容

sha到底是怎么实现的，来看下：

  1. #include "util/tc_sha.h"
  2. #include "util/tc_common.h"
  3. #include <stdio.h>
  4. #include <string.h>
  5. #include <endian.h>
  6. #include <limits.h>
  7.  
  8. namespace tars
  9. {
  10.  
  11. /*  Defines for suffixes to 32 and 64 bit unsigned numeric values   */
  12. #define sfx_lo(x,y) x##y
  13. #define sfx_hi(x,y) sfx_lo(x,y)
  14. #define n_u32(p)    sfx_hi(0x##p, s_u32)
  15. #define n_u64(p)    sfx_hi(0x##p, s_u64)
  16.  
  17. #if UINT_MAX == 0xffffffff
  18.   #define s_u32    u
  19. #elif ULONG_MAX == 0xffffffff
  20.   #define s_u32   ul
  21. #else
  22. #error Please define sha2_32t as an unsigned 32 bit type in sha2.h
  23. #endif
  24.  
  25. #if ULONG_MAX == 0xffffffffffffffff
  26.   #define s_u64   ul
  27. #elif ULONG_MAX == 0xffffffff
  28.   #define s_u64  ull
  29. #else
  30. #error Please define sha2_64t as an unsigned 64 bit type in sha2.h
  31. #endif
  32.  
  33. #define ch(x,y,z)       (((x) & (y)) ^ (~(x) & (z)))
  34. #define parity(x,y,z)   ((x) ^ (y) ^ (z))
  35. #define maj(x,y,z)      (((x) & (y)) ^ ((x) & (z)) ^ ((y) & (z)))
  36.  
  37. namespace detail_sha1
  38. {
  39.  
  40. #define SHA1_BLOCK_SIZE  64
  41. #define SHA1_DIGEST_SIZE 20
  42.  
  43. typedef struct
  44. {
  45.     uint32_t count[2];
  46.     uint32_t hash[5];
  47.     uint32_t wbuf[16];
  48. } sha1_ctx;
  49.  
  50. #define rotr32_sha1(x,n) (((x) << n) | ((x) >> (32 - n)))
  51.  
  52. #define SHA1_MASK   (SHA1_BLOCK_SIZE - 1)
  53.  
  54. #if(__BYTE_ORDER == __BIG_ENDIAN)
  55. #define swap_b32_sha1(x) (x)
  56. #elif defined(bswap_32_sha1)
  57. #define swap_b32_sha1(x) bswap_32_sha1(x)
  58. #else
  59. #define swap_b32_sha1(x) ((rotr32_sha1((x), 8) & 0x00ff00ff) | (rotr32_sha1((x), 24) & 0xff00ff00))
  60. #endif
  61.  
  62. /* A normal version as set out in the FIPS. This version uses   */
  63. /* partial loop unrolling and is optimised for the Pentium 4    */
  64.  
  65. #define rnd(f,k)    \
  66.     t = a; a = rotr32_sha1(a,5) + f(b,c,d) + e + k + w[i]; \
  67.     e = d; d = c; c = rotr32_sha1(b, 30); b = t
  68.  
  69. void sha1_compile(sha1_ctx ctx[1])
  70. {   uint32_t    w[80], i, a, b, c, d, e, t;
  71.  
  72.     /* note that words are compiled from the buffer into 32-bit */
  73.     /* words in big-endian order so an order reversal is needed */
  74.     /* here on little endian machines                           */
  75.     for (i = 0; i < SHA1_BLOCK_SIZE / 4; ++i) w[i] = swap_b32_sha1(ctx->wbuf[i]);
  76.  
  77.     for (i = SHA1_BLOCK_SIZE / 4; i < 80; ++i) w[i] = rotr32_sha1(w[i - 3] ^ w[i - 8] ^ w[i - 14] ^ w[i - 16], 1);
  78.  
  79.     a = ctx->hash[0];
  80.     b = ctx->hash[1];
  81.     c = ctx->hash[2];
  82.     d = ctx->hash[3];
  83.     e = ctx->hash[4];
  84.  
  85.     for (i = 0; i < 20; ++i)
  86.     {
  87.         rnd(ch, 0x5a827999);
  88.     }
  89.  
  90.     for (i = 20; i < 40; ++i)
  91.     {
  92.         rnd(parity, 0x6ed9eba1);
  93.     }
  94.  
  95.     for (i = 40; i < 60; ++i)
  96.     {
  97.         rnd(maj, 0x8f1bbcdc);
  98.     }
  99.  
  100.     for (i = 60; i < 80; ++i)
  101.     {
  102.         rnd(parity, 0xca62c1d6);
  103.     }
  104.  
  105.     ctx->hash[0] += a;
  106.     ctx->hash[1] += b;
  107.     ctx->hash[2] += c;
  108.     ctx->hash[3] += d;
  109.     ctx->hash[4] += e;
  110. }
  111.  
  112. void sha1_begin(sha1_ctx ctx[1])
  113. {
  114.     ctx->count[0] = ctx->count[1] = 0;
  115.     ctx->hash[0] = 0x67452301;
  116.     ctx->hash[1] = 0xefcdab89;
  117.     ctx->hash[2] = 0x98badcfe;
  118.     ctx->hash[3] = 0x10325476;
  119.     ctx->hash[4] = 0xc3d2e1f0;
  120. }
  121.  
  122. /* SHA1 hash data in an array of bytes into hash buffer and call the        */
  123. /* hash_compile function as required.                                       */
  124.  
  125. void sha1_hash(const unsigned char data[], unsigned int len, sha1_ctx ctx[1])
  126. {   
  127.     uint32_t pos = (uint32_t)(ctx->count[0] & SHA1_MASK),
  128.         space = SHA1_BLOCK_SIZE - pos;
  129.     const unsigned char *sp = data;
  130.  
  131.     if ((ctx->count[0] += len) < len) ++(ctx->count[1]);
  132.  
  133.     while (len >= space)     /* tranfer whole blocks while possible  */
  134.     {
  135.         memcpy(((unsigned char *)ctx->wbuf) + pos, sp, space);
  136.         sp += space; len -= space; space = SHA1_BLOCK_SIZE; pos = 0;
  137.         sha1_compile(ctx);
  138.     }
  139.  
  140.     memcpy(((unsigned char *)ctx->wbuf) + pos, sp, len);
  141. }
  142.  
  143. /* SHA1 final padding and digest calculation  */
  144. #if(__BYTE_ORDER == __LITTLE_ENDIAN)
  145. static uint32_t  mask[4] = {   0x00000000, 0x000000ff, 0x0000ffff, 0x00ffffff };
  146. static uint32_t  bits[4] = {   0x00000080, 0x00008000, 0x00800000, 0x80000000 };
  147. #else
  148. static uint32_t  mask[4] = {   0x00000000, 0xff000000, 0xffff0000, 0xffffff00 };
  149. static uint32_t  bits[4] = {   0x80000000, 0x00800000, 0x00008000, 0x00000080 };
  150. #endif
  151.  
  152. void sha1_end(unsigned char hval[], sha1_ctx ctx[1])
  153. {
  154.     uint32_t i = (uint32_t)(ctx->count[0] & SHA1_MASK);
  155.  
  156.     /* mask out the rest of any partial 32-bit word and then set    */
  157.     /* the next byte to 0x80. On big-endian machines any bytes in   */
  158.     /* the buffer will be at the top end of 32 bit words, on little */
  159.     /* endian machines they will be at the bottom. Hence the AND    */
  160.     /* and OR masks above are reversed for little endian systems    */
  161.     /* Note that we can always add the first padding byte at this   */
  162.     /* because the buffer always contains at least one empty slot   */
  163.     ctx->wbuf[i >> 2] = (ctx->wbuf[i >> 2] & mask[i & 3]) | bits[i & 3];
  164.  
  165.     /* we need 9 or more empty positions, one for the padding byte  */
  166.     /* (above) and eight for the length count.  If there is not     */
  167.     /* enough space pad and empty the buffer                        */
  168.     if (i > SHA1_BLOCK_SIZE - 9)
  169.     {
  170.         if (i < 60) ctx->wbuf[15] = 0;
  171.         sha1_compile(ctx);
  172.         i = 0;
  173.     }
  174.     else    /* compute a word index for the empty buffer positions  */
  175.         i = (i >> 2) + 1;
  176.  
  177.     while (i < 14) /* and zero pad all but last two positions      */
  178.         ctx->wbuf[i++] = 0;
  179.  
  180.     /* assemble the eight byte counter in in big-endian format      */
  181.     ctx->wbuf[14] = swap_b32_sha1((ctx->count[1] << 3) | (ctx->count[0] >> 29));
  182.     ctx->wbuf[15] = swap_b32_sha1(ctx->count[0] << 3);
  183.  
  184.     sha1_compile(ctx);
  185.  
  186.     /* extract the hash value as bytes in case the hash buffer is   */
  187.     /* misaligned for 32-bit words                                  */
  188.     for (i = 0; i < SHA1_DIGEST_SIZE; ++i) hval[i] = (unsigned char)(ctx->hash[i >> 2] >> 8 * (~i & 3));
  189. }
  190.  
  191. }
  192.  
  193. //
  194.  
  195. namespace detail_sha2
  196. {
  197.  
  198. #define SHA256_DIGEST_SIZE  32
  199. #define SHA384_DIGEST_SIZE  48
  200. #define SHA512_DIGEST_SIZE  64
  201.  
  202. #define SHA256_BLOCK_SIZE   64
  203. #define SHA384_BLOCK_SIZE  128
  204. #define SHA512_BLOCK_SIZE  128
  205.  
  206. /* type to hold the SHA256 context              */
  207.  
  208. typedef struct
  209. {uint32_t count[2];
  210.     uint32_t hash[8];
  211.     uint32_t wbuf[16];
  212. } sha256_ctx;
  213.  
  214. /* type to hold the SHA384/512 context          */
  215.  
  216. typedef struct
  217. {uint64_t count[2];
  218.     uint64_t hash[8];
  219.     uint64_t wbuf[16];
  220. } sha512_ctx;
  221.  
  222. typedef sha512_ctx  sha384_ctx;
  223.  
  224. #define rotr32_sha2(x,n) (((x) >> n) | ((x) << (32 - n)))
  225. #define rotr64_sha2(x,n) (((x) >> n) | ((x) << (64 - n)))
  226.  
  227. #define SHA256_MASK (SHA256_BLOCK_SIZE - 1)
  228. #define SHA512_MASK (SHA512_BLOCK_SIZE - 1)
  229.  
  230. #if !defined(bswap_32_sha2)
  231. #define bswap_32_sha2(x) ((rotr32_sha2((x), 24) & 0x00ff00ff) | (rotr32_sha2((x), 8) & 0xff00ff00))
  232. #endif
  233.  
  234. #if(__BYTE_ORDER == __LITTLE_ENDIAN)
  235. #define bsw_32_sha2(p,n) { int _i = (n); while(_i--) p[_i] = bswap_32_sha2(p[_i]); }
  236. #else
  237. #define bsw_32_sha2(p,n)
  238. #endif
  239.  
  240. #if(__BYTE_ORDER == __LITTLE_ENDIAN)
  241.   #if !defined(bswap_64_sha2)
  242.   #define bswap_64_sha2(x) (((uint64_t)(bswap_32_sha2((uint32_t)(x)))) << 32 | bswap_32_sha2((uint32_t)((x) >> 32)))
  243.   #endif
  244. #define bsw_64_sha2(p,n) { int _i = (n); while(_i--) p[_i] = bswap_64_sha2(p[_i]); }
  245. #else
  246. #define bsw_64_sha2(p,n)
  247. #endif
  248.  
  249. /* SHA256 mixing function definitions   */
  250.  
  251. #define s256_0(x) (rotr32_sha2((x),  2) ^ rotr32_sha2((x), 13) ^ rotr32_sha2((x), 22))
  252. #define s256_1(x) (rotr32_sha2((x),  6) ^ rotr32_sha2((x), 11) ^ rotr32_sha2((x), 25))
  253. #define g256_0(x) (rotr32_sha2((x),  7) ^ rotr32_sha2((x), 18) ^ ((x) >>  3))
  254. #define g256_1(x) (rotr32_sha2((x), 17) ^ rotr32_sha2((x), 19) ^ ((x) >> 10))
  255.  
  256. /* rotated SHA256 round definition. Rather than swapping variables as in    */
  257. /* FIPS-180, different variables are 'rotated' on each round, returning     */
  258. /* to their starting positions every eight rounds                           */
  259.  
  260. #define h2(i) ctx->wbuf[i & 15] += \
  261.     g256_1(ctx->wbuf[(i + 14) & 15]) + ctx->wbuf[(i + 9) & 15] + g256_0(ctx->wbuf[(i + 1) & 15])
  262.  
  263. #define h2_cycle(i,j)  \
  264.     v[(7 - i) & 7] += (j ? h2(i) : ctx->wbuf[i & 15]) + k256[i + j] \
  265.         + s256_1(v[(4 - i) & 7]) + ch(v[(4 - i) & 7], v[(5 - i) & 7], v[(6 - i) & 7]); \
  266.     v[(3 - i) & 7] += v[(7 - i) & 7]; \
  267.     v[(7 - i) & 7] += s256_0(v[(0 - i) & 7]) + maj(v[(0 - i) & 7], v[(1 - i) & 7], v[(2 - i) & 7])
  268.  
  269. /* SHA256 mixing data   */
  270.  
  271. const uint32_t k256[64] =
  272. {   n_u32(428a2f98), n_u32(71374491), n_u32(b5c0fbcf), n_u32(e9b5dba5),
  273.     n_u32(3956c25b), n_u32(59f111f1), n_u32(923f82a4), n_u32(ab1c5ed5),
  274.     n_u32(d807aa98), n_u32(12835b01), n_u32(243185be), n_u32(550c7dc3),
  275.     n_u32(72be5d74), n_u32(80deb1fe), n_u32(9bdc06a7), n_u32(c19bf174),
  276.     n_u32(e49b69c1), n_u32(efbe4786), n_u32(0fc19dc6), n_u32(240ca1cc),
  277.     n_u32(2de92c6f), n_u32(4a7484aa), n_u32(5cb0a9dc), n_u32(76f988da),
  278.     n_u32(983e5152), n_u32(a831c66d), n_u32(b00327c8), n_u32(bf597fc7),
  279.     n_u32(c6e00bf3), n_u32(d5a79147), n_u32(06ca6351), n_u32(14292967),
  280.     n_u32(27b70a85), n_u32(2e1b2138), n_u32(4d2c6dfc), n_u32(53380d13),
  281.     n_u32(650a7354), n_u32(766a0abb), n_u32(81c2c92e), n_u32(92722c85),
  282.     n_u32(a2bfe8a1), n_u32(a81a664b), n_u32(c24b8b70), n_u32(c76c51a3),
  283.     n_u32(d192e819), n_u32(d6990624), n_u32(f40e3585), n_u32(106aa070),
  284.     n_u32(19a4c116), n_u32(1e376c08), n_u32(2748774c), n_u32(34b0bcb5),
  285.     n_u32(391c0cb3), n_u32(4ed8aa4a), n_u32(5b9cca4f), n_u32(682e6ff3),
  286.     n_u32(748f82ee), n_u32(78a5636f), n_u32(84c87814), n_u32(8cc70208),
  287.     n_u32(90befffa), n_u32(a4506ceb), n_u32(bef9a3f7), n_u32(c67178f2),
  288. };
  289.  
  290. /* SHA256 initialisation data */
  291.  
  292. const uint32_t i256[8] =
  293. {
  294.     n_u32(6a09e667), n_u32(bb67ae85), n_u32(3c6ef372), n_u32(a54ff53a),
  295.     n_u32(510e527f), n_u32(9b05688c), n_u32(1f83d9ab), n_u32(5be0cd19)
  296. };
  297.  
  298. void sha256_begin(sha256_ctx ctx[1])
  299. {
  300.     ctx->count[0] = ctx->count[1] = 0;
  301.     memcpy(ctx->hash, i256, 8 * sizeof(uint32_t));
  302. }
  303.  
  304. /* Compile 64 bytes of hash data into SHA256 digest value   */
  305. /* NOTE: this routine assumes that the byte order in the    */
  306. /* ctx->wbuf[] at this point is in such an order that low   */
  307. /* address bytes in the ORIGINAL byte stream placed in this */
  308. /* buffer will now go to the high end of words on BOTH big  */
  309. /* and little endian systems                                */
  310.  
  311. void sha256_compile(sha256_ctx ctx[1])
  312. {   uint32_t    v[8], j;
  313.  
  314.     memcpy(v, ctx->hash, 8 * sizeof(uint32_t));
  315.  
  316.     for (j = 0; j < 64; j += 16)
  317.     {
  318.         h2_cycle(0, j); h2_cycle(1, j); h2_cycle(2, j); h2_cycle(3, j);
  319.         h2_cycle(4, j); h2_cycle(5, j); h2_cycle(6, j); h2_cycle(7, j);
  320.         h2_cycle(8, j); h2_cycle(9, j); h2_cycle(10, j); h2_cycle(11, j);
  321.         h2_cycle(12, j); h2_cycle(13, j); h2_cycle(14, j); h2_cycle(15, j);
  322.     }
  323.  
  324.     ctx->hash[0] += v[0]; ctx->hash[1] += v[1]; ctx->hash[2] += v[2]; ctx->hash[3] += v[3];
  325.     ctx->hash[4] += v[4]; ctx->hash[5] += v[5]; ctx->hash[6] += v[6]; ctx->hash[7] += v[7];
  326. }
  327.  
  328. /* SHA256 hash data in an array of bytes into hash buffer   */
  329. /* and call the hash_compile function as required.          */
  330.  
  331. void sha256_hash(const unsigned char data[], unsigned long len, sha256_ctx ctx[1])
  332. {   uint32_t pos = (uint32_t)(ctx->count[0] & SHA256_MASK),
  333.     space = SHA256_BLOCK_SIZE - pos;
  334.     const unsigned char *sp = data;
  335.  
  336.     if ((ctx->count[0] += len) < len) ++(ctx->count[1]);
  337.  
  338.     while (len >= space)     /* tranfer whole blocks while possible  */
  339.     {
  340.         memcpy(((unsigned char *)ctx->wbuf) + pos, sp, space);
  341.         sp += space; len -= space; space = SHA256_BLOCK_SIZE; pos = 0;
  342.         bsw_32_sha2(ctx->wbuf, SHA256_BLOCK_SIZE >> 2);
  343.         sha256_compile(ctx);
  344.     }
  345.  
  346.     memcpy(((unsigned char *)ctx->wbuf) + pos, sp, len);
  347. }
  348.  
  349. /* SHA256 Final padding and digest calculation  */
  350.  
  351. static uint32_t  m1[4] =
  352. {
  353.     n_u32(00000000), n_u32(ff000000), n_u32(ffff0000), n_u32(ffffff00)
  354. };
  355.  
  356. static uint32_t  b1[4] =
  357. {
  358.     n_u32(80000000), n_u32(00800000), n_u32(00008000), n_u32(00000080)
  359. };
  360.  
  361. void sha256_end(unsigned char hval[], sha256_ctx ctx[1])
  362. {   
  363.     uint32_t    i = (uint32_t)(ctx->count[0] & SHA256_MASK);
  364.  
  365.     bsw_32_sha2(ctx->wbuf, (i + 3) >> 2);
  366.     /* bytes in the buffer are now in an order in which references  */
  367.     /* to 32-bit words will put bytes with lower addresses into the */
  368.     /* top of 32 bit words on BOTH big and little endian machines   */
  369.  
  370.     /* we now need to mask valid bytes and add the padding which is */
  371.     /* a single 1 bit and as many zero bits as necessary.           */
  372.     ctx->wbuf[i >> 2] = (ctx->wbuf[i >> 2] & m1[i & 3]) | b1[i & 3];
  373.  
  374.     /* we need 9 or more empty positions, one for the padding byte  */
  375.     /* (above) and eight for the length count.  If there is not     */
  376.     /* enough space pad and empty the buffer                        */
  377.     if (i > SHA256_BLOCK_SIZE - 9)
  378.     {
  379.         if (i < 60) ctx->wbuf[15] = 0;
  380.         sha256_compile(ctx);
  381.         i = 0;
  382.     }
  383.     else    /* compute a word index for the empty buffer positions  */
  384.         i = (i >> 2) + 1;
  385.  
  386.     while (i < 14) /* and zero pad all but last two positions      */
  387.         ctx->wbuf[i++] = 0;
  388.  
  389.     /* the following 32-bit length fields are assembled in the      */
  390.     /* wrong byte order on little endian machines but this is       */
  391.     /* corrected later since they are only ever used as 32-bit      */
  392.     /* word values.                                                 */
  393.  
  394.     ctx->wbuf[14] = (ctx->count[1] << 3) | (ctx->count[0] >> 29);
  395.     ctx->wbuf[15] = ctx->count[0] << 3;
  396.  
  397.     sha256_compile(ctx);
  398.  
  399.     /* extract the hash value as bytes in case the hash buffer is   */
  400.     /* mislaigned for 32-bit words                                  */
  401.     for (i = 0; i < SHA256_DIGEST_SIZE; ++i) hval[i] = (unsigned char)(ctx->hash[i >> 2] >> 8 * (~i & 3));
  402. }
  403.  
  404. /* SHA512 mixing function definitions   */
  405.  
  406. #define s512_0(x) (rotr64_sha2((x), 28) ^ rotr64_sha2((x), 34) ^ rotr64_sha2((x), 39))
  407. #define s512_1(x) (rotr64_sha2((x), 14) ^ rotr64_sha2((x), 18) ^ rotr64_sha2((x), 41))
  408. #define g512_0(x) (rotr64_sha2((x),  1) ^ rotr64_sha2((x),  8) ^ ((x) >>  7))
  409. #define g512_1(x) (rotr64_sha2((x), 19) ^ rotr64_sha2((x), 61) ^ ((x) >>  6))
  410.  
  411. /* rotated SHA512 round definition. Rather than swapping variables as in    */
  412. /* FIPS-180, different variables are 'rotated' on each round, returning     */
  413. /* to their starting positions every eight rounds                           */
  414.  
  415. #define h5(i) ctx->wbuf[i & 15] += \
  416.     g512_1(ctx->wbuf[(i + 14) & 15]) + ctx->wbuf[(i + 9) & 15] + g512_0(ctx->wbuf[(i + 1) & 15])
  417.  
  418. #define h5_cycle(i,j)  \
  419.     v[(7 - i) & 7] += (j ? h5(i) : ctx->wbuf[i & 15]) + k512[i + j] \
  420.         + s512_1(v[(4 - i) & 7]) + ch(v[(4 - i) & 7], v[(5 - i) & 7], v[(6 - i) & 7]); \
  421.     v[(3 - i) & 7] += v[(7 - i) & 7]; \
  422.     v[(7 - i) & 7] += s512_0(v[(0 - i) & 7]) + maj(v[(0 - i) & 7], v[(1 - i) & 7], v[(2 - i) & 7])
  423.  
  424. /* SHA384/SHA512 mixing data    */
  425.  
  426. const uint64_t  k512[80] =
  427. {
  428.     n_u64(428a2f98d728ae22), n_u64(7137449123ef65cd),
  429.     n_u64(b5c0fbcfec4d3b2f), n_u64(e9b5dba58189dbbc),
  430.     n_u64(3956c25bf348b538), n_u64(59f111f1b605d019),
  431.     n_u64(923f82a4af194f9b), n_u64(ab1c5ed5da6d8118),
  432.     n_u64(d807aa98a3030242), n_u64(12835b0145706fbe),
  433.     n_u64(243185be4ee4b28c), n_u64(550c7dc3d5ffb4e2),
  434.     n_u64(72be5d74f27b896f), n_u64(80deb1fe3b1696b1),
  435.     n_u64(9bdc06a725c71235), n_u64(c19bf174cf692694),
  436.     n_u64(e49b69c19ef14ad2), n_u64(efbe4786384f25e3),
  437.     n_u64(0fc19dc68b8cd5b5), n_u64(240ca1cc77ac9c65),
  438.     n_u64(2de92c6f592b0275), n_u64(4a7484aa6ea6e483),
  439.     n_u64(5cb0a9dcbd41fbd4), n_u64(76f988da831153b5),
  440.     n_u64(983e5152ee66dfab), n_u64(a831c66d2db43210),
  441.     n_u64(b00327c898fb213f), n_u64(bf597fc7beef0ee4),
  442.     n_u64(c6e00bf33da88fc2), n_u64(d5a79147930aa725),
  443.     n_u64(06ca6351e003826f), n_u64(142929670a0e6e70),
  444.     n_u64(27b70a8546d22ffc), n_u64(2e1b21385c26c926),
  445.     n_u64(4d2c6dfc5ac42aed), n_u64(53380d139d95b3df),
  446.     n_u64(650a73548baf63de), n_u64(766a0abb3c77b2a8),
  447.     n_u64(81c2c92e47edaee6), n_u64(92722c851482353b),
  448.     n_u64(a2bfe8a14cf10364), n_u64(a81a664bbc423001),
  449.     n_u64(c24b8b70d0f89791), n_u64(c76c51a30654be30),
  450.     n_u64(d192e819d6ef5218), n_u64(d69906245565a910),
  451.     n_u64(f40e35855771202a), n_u64(106aa07032bbd1b8),
  452.     n_u64(19a4c116b8d2d0c8), n_u64(1e376c085141ab53),
  453.     n_u64(2748774cdf8eeb99), n_u64(34b0bcb5e19b48a8),
  454.     n_u64(391c0cb3c5c95a63), n_u64(4ed8aa4ae3418acb),
  455.     n_u64(5b9cca4f7763e373), n_u64(682e6ff3d6b2b8a3),
  456.     n_u64(748f82ee5defb2fc), n_u64(78a5636f43172f60),
  457.     n_u64(84c87814a1f0ab72), n_u64(8cc702081a6439ec),
  458.     n_u64(90befffa23631e28), n_u64(a4506cebde82bde9),
  459.     n_u64(bef9a3f7b2c67915), n_u64(c67178f2e372532b),
  460.     n_u64(ca273eceea26619c), n_u64(d186b8c721c0c207),
  461.     n_u64(eada7dd6cde0eb1e), n_u64(f57d4f7fee6ed178),
  462.     n_u64(06f067aa72176fba), n_u64(0a637dc5a2c898a6),
  463.     n_u64(113f9804bef90dae), n_u64(1b710b35131c471b),
  464.     n_u64(28db77f523047d84), n_u64(32caab7b40c72493),
  465.     n_u64(3c9ebe0a15c9bebc), n_u64(431d67c49c100d4c),
  466.     n_u64(4cc5d4becb3e42b6), n_u64(597f299cfc657e2a),
  467.     n_u64(5fcb6fab3ad6faec), n_u64(6c44198c4a475817)
  468. };
  469.  
  470. /* Compile 64 bytes of hash data into SHA384/SHA512 digest value  */
  471.  
  472. void sha512_compile(sha512_ctx ctx[1])
  473. {   uint64_t    v[8];
  474.     uint32_t    j;
  475.  
  476.     memcpy(v, ctx->hash, 8 * sizeof(uint64_t));
  477.  
  478.     for (j = 0; j < 80; j += 16)
  479.     {
  480.         h5_cycle(0, j); h5_cycle(1, j); h5_cycle(2, j); h5_cycle(3, j);
  481.         h5_cycle(4, j); h5_cycle(5, j); h5_cycle(6, j); h5_cycle(7, j);
  482.         h5_cycle(8, j); h5_cycle(9, j); h5_cycle(10, j); h5_cycle(11, j);
  483.         h5_cycle(12, j); h5_cycle(13, j); h5_cycle(14, j); h5_cycle(15, j);
  484.     }
  485.  
  486.     ctx->hash[0] += v[0]; ctx->hash[1] += v[1]; ctx->hash[2] += v[2]; ctx->hash[3] += v[3];
  487.     ctx->hash[4] += v[4]; ctx->hash[5] += v[5]; ctx->hash[6] += v[6]; ctx->hash[7] += v[7];
  488. }
  489.  
  490. /* Compile 128 bytes of hash data into SHA256 digest value  */
  491. /* NOTE: this routine assumes that the byte order in the    */
  492. /* ctx->wbuf[] at this point is in such an order that low   */
  493. /* address bytes in the ORIGINAL byte stream placed in this */
  494. /* buffer will now go to the high end of words on BOTH big  */
  495. /* and little endian systems                                */
  496.  
  497. void sha512_hash(const unsigned char data[], unsigned long len, sha512_ctx ctx[1])
  498. {   
  499.     uint32_t pos = (uint32_t)(ctx->count[0] & SHA512_MASK),
  500.     space = SHA512_BLOCK_SIZE - pos;
  501.     const unsigned char *sp = data;
  502.  
  503.     if ((ctx->count[0] += len) < len) ++(ctx->count[1]);
  504.  
  505.     while (len >= space)     /* tranfer whole blocks while possible  */
  506.     {
  507.         memcpy(((unsigned char *)ctx->wbuf) + pos, sp, space);
  508.         sp += space; len -= space; space = SHA512_BLOCK_SIZE; pos = 0;
  509.         bsw_64_sha2(ctx->wbuf, SHA512_BLOCK_SIZE >> 3);
  510.         sha512_compile(ctx);
  511.     }
  512.  
  513.     memcpy(((unsigned char *)ctx->wbuf) + pos, sp, len);
  514. }
  515.  
  516. /* SHA384/512 Final padding and digest calculation  */
  517.  
  518. static uint64_t  m2[8] =
  519. {
  520.     n_u64(0000000000000000), n_u64(ff00000000000000),
  521.     n_u64(ffff000000000000), n_u64(ffffff0000000000),
  522.     n_u64(ffffffff00000000), n_u64(ffffffffff000000),
  523.     n_u64(ffffffffffff0000), n_u64(ffffffffffffff00)
  524. };
  525.  
  526. static uint64_t  b2[8] =
  527. {
  528.     n_u64(8000000000000000), n_u64(0080000000000000),
  529.     n_u64(0000800000000000), n_u64(0000008000000000),
  530.     n_u64(0000000080000000), n_u64(0000000000800000),
  531.     n_u64(0000000000008000), n_u64(0000000000000080)
  532. };
  533.  
  534. static void sha_end(unsigned char hval[], sha512_ctx ctx[1], const unsigned int hlen)
  535. {   
  536.     uint32_t    i = (uint32_t)(ctx->count[0] & SHA512_MASK);
  537.  
  538.     bsw_64_sha2(ctx->wbuf, (i + 7) >> 3);
  539.  
  540.     /* bytes in the buffer are now in an order in which references  */
  541.     /* to 64-bit words will put bytes with lower addresses into the */
  542.     /* top of 64 bit words on BOTH big and little endian machines   */
  543.  
  544.     /* we now need to mask valid bytes and add the padding which is */
  545.     /* a single 1 bit and as many zero bits as necessary.           */
  546.     ctx->wbuf[i >> 3] = (ctx->wbuf[i >> 3] & m2[i & 7]) | b2[i & 7];
  547.  
  548.     /* we need 17 or more empty byte positions, one for the padding */
  549.     /* byte (above) and sixteen for the length count.  If there is  */
  550.     /* not enough space pad and empty the buffer                    */
  551.     if (i > SHA512_BLOCK_SIZE - 17)
  552.     {
  553.         if (i < 120) ctx->wbuf[15] = 0;
  554.         sha512_compile(ctx);
  555.         i = 0;
  556.     }
  557.     else i = (i >> 3) + 1;
  558.  
  559.     while (i < 14) ctx->wbuf[i++] = 0;
  560.  
  561.     /* the following 64-bit length fields are assembled in the      */
  562.     /* wrong byte order on little endian machines but this is       */
  563.     /* corrected later since they are only ever used as 64-bit      */
  564.     /* word values.                                                 */
  565.  
  566.     ctx->wbuf[14] = (ctx->count[1] << 3) | (ctx->count[0] >> 61);
  567.     ctx->wbuf[15] = ctx->count[0] << 3;
  568.  
  569.     sha512_compile(ctx);
  570.  
  571.     /* extract the hash value as bytes in case the hash buffer is   */
  572.     /* misaligned for 32-bit words                                  */
  573.     for (i = 0; i < hlen; ++i) hval[i] = (unsigned char)(ctx->hash[i >> 3] >> 8 * (~i & 7));
  574. }
  575.  
  576. ///
  577. /* SHA384 initialisation data   */
  578.  
  579. const uint64_t  i384[80] =
  580. {
  581.     n_u64(cbbb9d5dc1059ed8), n_u64(629a292a367cd507),
  582.     n_u64(9159015a3070dd17), n_u64(152fecd8f70e5939),
  583.     n_u64(67332667ffc00b31), n_u64(8eb44a8768581511),
  584.     n_u64(db0c2e0d64f98fa7), n_u64(47b5481dbefa4fa4)
  585. };
  586.  
  587. void sha384_begin(sha384_ctx ctx[1])
  588. {
  589.     ctx->count[0] = ctx->count[1] = 0;
  590.     memcpy(ctx->hash, i384, 8 * sizeof(uint64_t));
  591. }
  592.  
  593. void sha384_end(unsigned char hval[], sha384_ctx ctx[1])
  594. {
  595.     sha_end(hval, ctx, SHA384_DIGEST_SIZE);
  596. }
  597.  
  598. ///
  599.  
  600. /* SHA512 initialisation data   */
  601.  
  602. const uint64_t  i512[80] =
  603. {
  604.     n_u64(6a09e667f3bcc908), n_u64(bb67ae8584caa73b),
  605.     n_u64(3c6ef372fe94f82b), n_u64(a54ff53a5f1d36f1),
  606.     n_u64(510e527fade682d1), n_u64(9b05688c2b3e6c1f),
  607.     n_u64(1f83d9abfb41bd6b), n_u64(5be0cd19137e2179)
  608. };
  609.  
  610. void sha512_begin(sha512_ctx ctx[1])
  611. {
  612.     ctx->count[0] = ctx->count[1] = 0;
  613.     memcpy(ctx->hash, i512, 8 * sizeof(uint64_t));
  614. }
  615.  
  616. void sha512_end(unsigned char hval[], sha512_ctx ctx[1])
  617. {
  618.     sha_end(hval, ctx, SHA512_DIGEST_SIZE);
  619. }
  620.  
  621. }//detail_sha2
  622.  
  623. //
  624.  
  625. vector<char> TC_SHA::sha1bin(const char *data, size_t len)
  626. {
  627.     vector<char> digest;
  628.     digest.resize(SHA1_DIGEST_SIZE);
  629.  
  630.     detail_sha1::sha1_ctx cx[1];
  631.  
  632.     detail_sha1::sha1_begin(cx);
  633.     detail_sha1::sha1_hash((unsigned char *)data, len, cx);
  634.     detail_sha1::sha1_end((unsigned char *)&digest[0], cx);
  635.  
  636.     return digest;
  637. }
  638.  
  639. string TC_SHA::sha1str(const char *buffer, size_t length)
  640. {
  641.     vector<char> digest =  sha1bin(buffer, length);
  642.  
  643.     return TC_Common::bin2str(&digest[0], digest.size());
  644. }
  645.  
  646. string TC_SHA::sha1file(const string &fileName)
  647. {
  648.     unsigned char sOutBuffer[SHA1_DIGEST_SIZE];
  649.     unsigned char buf[16*1024];
  650.     FILE *f;
  651.     size_t n;
  652.     detail_sha1::sha1_ctx cx[1];
  653.     if(( f = fopen( fileName.c_str(), "rb" )) == NULL )
  654.         throw TC_SHA_Exception("[TC_SHA::sha1file] fopen '" + fileName + "', error.", errno);
  655.  
  656.     detail_sha1::sha1_begin(cx);
  657.     while((n = fread( buf, 1, sizeof( buf ),f)) > 0 )
  658.         detail_sha1::sha1_hash(buf, n, cx);
  659.  
  660.     detail_sha1::sha1_end (sOutBuffer, cx);
  661.  
  662.     fclose(f);
  663.  
  664.     return TC_Common::bin2str(sOutBuffer, sizeof(sOutBuffer));
  665. }
  666.  
  667. vector<char> TC_SHA::sha256bin(const char *data, size_t len)
  668. {
  669.     vector<char> digest;
  670.     digest.resize(SHA256_DIGEST_SIZE);
  671.  
  672.     detail_sha2::sha256_ctx cx[1];
  673.  
  674.     detail_sha2::sha256_begin(cx);
  675.     detail_sha2::sha256_hash((unsigned char *)data, len, cx);
  676.     detail_sha2::sha256_end((unsigned char *)&digest[0], cx);
  677.  
  678.     return digest;
  679. }
  680.  
  681. string TC_SHA::sha256str(const char *buffer, size_t length)
  682. {
  683.     vector<char> digest =  sha256bin(buffer, length);
  684.  
  685.     return TC_Common::bin2str(&digest[0], digest.size());
  686. }
  687.  
  688. string TC_SHA::sha256file(const string &fileName)
  689. {
  690.     unsigned char sOutBuffer[SHA256_DIGEST_SIZE];
  691.     unsigned char buf[16*1024];
  692.     FILE *f;
  693.     size_t n;
  694.     detail_sha2::sha256_ctx cx[1];
  695.     if(( f = fopen( fileName.c_str(), "rb" )) == NULL )
  696.         throw TC_SHA_Exception("[TC_SHA::sha256file] fopen '" + fileName + "', error.", errno);
  697.  
  698.     detail_sha2::sha256_begin(cx);
  699.     while((n = fread( buf, 1, sizeof( buf ),f)) > 0 )
  700.         detail_sha2::sha256_hash(buf, n, cx);
  701.  
  702.     detail_sha2::sha256_end(sOutBuffer, cx);
  703.  
  704.     fclose(f);
  705.  
  706.     return TC_Common::bin2str(sOutBuffer, sizeof(sOutBuffer));
  707. }
  708.  
  709. vector<char> TC_SHA::sha384bin(const char *data, size_t len)
  710. {
  711.     vector<char> digest;
  712.     digest.resize(SHA384_DIGEST_SIZE);
  713.  
  714.     detail_sha2::sha384_ctx cx[1];
  715.  
  716.     detail_sha2::sha384_begin(cx);
  717.     detail_sha2::sha512_hash((unsigned char *)data, len, cx);
  718.     detail_sha2::sha384_end((unsigned char *)&digest[0], cx);
  719.  
  720.     return digest;
  721. }
  722.  
  723. string TC_SHA::sha384str(const char *buffer, size_t length)
  724. {
  725.     vector<char> digest =  sha384bin(buffer, length);
  726.  
  727.     return TC_Common::bin2str(&digest[0], digest.size());
  728. }
  729.  
  730. string TC_SHA::sha384file(const string &fileName)
  731. {
  732.     unsigned char sOutBuffer[SHA384_DIGEST_SIZE];
  733.     unsigned char buf[16*1024];
  734.     FILE *f;
  735.     size_t n;
  736.     detail_sha2::sha384_ctx cx[1];
  737.     if(( f = fopen( fileName.c_str(), "rb" )) == NULL )
  738.         throw TC_SHA_Exception("[TC_SHA::sha384file] fopen '" + fileName + "', error.", errno);
  739.  
  740.     detail_sha2::sha384_begin(cx);
  741.     while((n = fread( buf, 1, sizeof( buf ),f)) > 0 )
  742.         detail_sha2::sha512_hash(buf, n, cx);
  743.  
  744.     detail_sha2::sha384_end(sOutBuffer, cx);
  745.  
  746.     fclose(f);
  747.  
  748.     return TC_Common::bin2str(sOutBuffer, sizeof(sOutBuffer));
  749. }
  750.  
  751. vector<char> TC_SHA::sha512bin(const char *data, size_t len)
  752. {
  753.     vector<char> digest;
  754.     digest.resize(SHA512_DIGEST_SIZE);
  755.  
  756.     detail_sha2::sha512_ctx cx[1];
  757.  
  758.     detail_sha2::sha512_begin(cx);
  759.     detail_sha2::sha512_hash((unsigned char *)data, len, cx);
  760.     detail_sha2::sha512_end((unsigned char *)&digest[0], cx);
  761.  
  762.     return digest;
  763. }
  764.  
  765. string TC_SHA::sha512str(const char *buffer, size_t length)
  766. {
  767.     vector<char> digest =  sha512bin(buffer, length);
  768.  
  769.     return TC_Common::bin2str(&digest[0], digest.size());
  770. }
  771.  
  772. string TC_SHA::sha512file(const string &fileName)
  773. {
  774.     unsigned char sOutBuffer[SHA512_DIGEST_SIZE];
  775.     unsigned char buf[16*1024];
  776.     FILE *f;
  777.     size_t n;
  778.     detail_sha2::sha512_ctx cx[1];
  779.     if(( f = fopen( fileName.c_str(), "rb" )) == NULL )
  780.         throw TC_SHA_Exception("[TC_SHA::sha512file] fopen '" + fileName + "', error.", errno);
  781.  
  782.     detail_sha2::sha512_begin(cx);
  783.     while((n = fread( buf, 1, sizeof( buf ),f)) > 0 )
  784.         detail_sha2::sha512_hash(buf, n, cx);
  785.  
  786.     detail_sha2::sha512_end(sOutBuffer, cx);
  787.  
  788.     fclose(f);
  789.  
  790.     return TC_Common::bin2str(sOutBuffer, sizeof(sOutBuffer));
  791. }
  792.  
  793. }

相关技术文章

最新源码

下载排行榜
点击QQ咨询
开通会员
返回顶部
×
微信扫码支付 元
微信扫码支付
确定支付下载
请使用微信描二维码支付
×

提示信息

×

选择支付方式

  • 微信支付
  • 支付宝付款
确定支付下载