devbox
不正经
这个屌丝很懒，什么也没留下！
关注作者
热门标签
热门文章
当前位置:   article > 正文

SHA1和MD5_sha1转md5

作者：不正经 | 2024-04-30 22:21:05

赞

踩

sha1转md5
  1. #ifndef SHA1_H
  2. #define SHA1_H
  3.  
  4. #include "stdint.h"
  5. //! #定义SHA 中的返回ENUM
  6. /*！
  7.    @see enum
  8. */
  9. #ifndef _SHA_enum_
  10. #define _SHA_enum_
  11. enum
  12. {
  13. 	shaSuccess = 0,
  14. 	/*! <空指示参量 */
  15. 	shaNull,            
  16. 	/*! < 输入数据太长提示 */
  17. 	shaInputTooLong,
  18. 	 /*! <called Input after Result --以输入结果命名之 */
  19. 	shaStateError      
  20. };
  21. #endif
  22. //! SHA1HashSize定义的是SHA1哈希表的大小
  23. #define SHA1HashSize 20
  24. //!   #能够进行动态链接库编译的SHA1类
  25.  /*!  
  26.        @see class _declspec(dllexport) SHA_1
  27.        将SHA1算法写成动态链接库的形式方便调用，生成消息使用
  28.  */
  29. class _declspec(dllexport) SHA_1
  30. {
  31. public:
  32. 	//! #定义数据结构控制上下文消息 SHA1Context
  33. 	/*!
  34. 	    以下这种结构将会控制上下文消息 for the SHA-1
  35. 	    hashing operation
  36. 		@see struct SHA1Context
  37. 	*/
  38. 	typedef struct SHA1Context
  39. 	{
  40. 		uint32_t Intermediate_Hash[SHA1HashSize/4]; /*! <Message Digest  */
  41.  
  42. 		uint32_t Length_Low;            /*! <Message length in bits      */
  43. 		uint32_t Length_High;           /*! <Message length in bits      */
  44.  
  45. 		/*! <Index into message block array   */
  46. 		int_least16_t Message_Block_Index;
  47. 		uint8_t Message_Block[64];      /*! <512-bit message blocks      */
  48.  
  49. 		int Computed;               /*! <Is the digest computed?         */
  50. 		int Corrupted;             /*! <Is the message digest corrupted? */
  51. 	} SHA1Context;
  52.  
  53. public:
  54.     //! #SHA_1 的构造函数
  55.     /*!
  56. 	 @see SHA_1()
  57.       其中应该对SHA_1类中的一些变量进行相应的初始化
  58.     */
  59. 	SHA_1();
  60. 	//! #SHA_1的析构函数
  61.     /*!
  62. 	@see ~SHA_1()
  63.       释放内存
  64.     */
  65. 	~SHA_1(void);
  66.  
  67. 	/*----------------------------------函数原型----------------------------------*/
  68. 	//! #SHA1算法中的数据填充模块
  69.     /*!
  70. 	  @see void SHA1PadMessage(SHA1Context *);
  71. 	  @param[SHA1Context*  定义填充信息指针
  72. 	  @return[void] 不返回任何值
  73.     */
  74. 	void SHA1PadMessage(SHA1Context *);    /*  定义填充信息指针  */
  75.     //! #SHA1的消息块描述函数
  76.     /*!
  77. 	  @see void SHA1ProcessMessageBlock(SHA1Context *);
  78. 	  @param[SHA1Context*  定义填充信息指针
  79. 	  @param[in] 消息块长度为固定之512比特
  80. 	  @return[void] 不返回任何值
  81.     */
  82. 	void SHA1ProcessMessageBlock(SHA1Context *);
  83. 	//! #SHA1的数据初始化操作函数
  84.     /*!
  85. 	  @see int SHA1Reset(  SHA1Context *);
  86. 	  @param[SHA1Context*  定义填充信息指针
  87. 	  @return[int] 成功返回shaNull，失败返回shaSuccess
  88. 	  @see SHA1 enum
  89.     */
  90. 	int SHA1Reset(  SHA1Context *);
  91. 	//! #SHA1的输入描述函数
  92.     /*!
  93. 	  @see int SHA1Input(  SHA1Context *, const uint8_t *, unsigned int);
  94. 	  @param[SHA1Context*  定义填充信息指针
  95.       @param[uint8_t 接收单位长度为8字节倍数的消息
  96. 	  @return[enum] 成功返回shaNull，失败返回shaSuccess，错误返回shaStateError
  97. 	  @see SHA1 enum
  98.     */
  99. 	int SHA1Input(  SHA1Context *, const uint8_t *, unsigned int);
  100. 	//! #SHA1的结果描述函数
  101.     /*!
  102. 	  @see int SHA1Result( SHA1Context *, uint8_t Message_Digest[SHA1HashSize]);
  103. 	  @param[SHA1Context*  定义填充信息指针
  104.       @param[uint8_t 160比特的消息摘要队列
  105. 	  @attention 返回一个160比特的消息摘要队列
  106. 	  @return[enum] 成功返回shaNull，失败返回shaSuccess，错误返回shaStateError
  107. 	  @see SHA1 enum
  108.     */
  109. 	int SHA1Result( SHA1Context *, uint8_t Message_Digest[SHA1HashSize]);
  110.  
  111. private:
  112. };
  113.  
  114. #endif // SHA1_H
  1. #include "SHA1.h"
  2. /*！以下所用各种参量名称皆为sha-1在出版物上所用之公用名称  */
  3. /*
  4.  *  以下是为 SHA1 向左环形移位宏 之定义
  5.  */
  6. #define SHA1CircularShift(bits,word) \
  7.                 (((word) << (bits)) | ((word) >> (32-(bits))))
  8.  
  9. SHA_1::SHA_1()
  10. {
  11. }
  12.  
  13. SHA_1::~SHA_1(void)
  14. {
  15. }
  16.  
  17. /*
  18.  *  以下为sha-1消息块描述：
  19.  *  消息块长度为固定之512比特
  20.  */
  21. void SHA_1::SHA1ProcessMessageBlock(SHA1Context *context)
  22. {
  23.     const uint32_t K[] =    {       /* Constants defined in SHA-1   */
  24.                             0x5A827999,
  25.                             0x6ED9EBA1,
  26.                             0x8F1BBCDC,
  27.                             0xCA62C1D6
  28.                             };
  29.     int               t;                 /* 循环计数 */
  30.     uint32_t      temp;              /* 临时缓存 */
  31.     uint32_t      W[80];             /* 字顺序   */
  32.     uint32_t      A, B, C, D, E;     /* 设置系统磁盘缓存块 */
  33.  
  34.     /*
  35.      *  以下为初始化在W队列中的头16字数据
  36.      */
  37.     for(t = 0; t < 16; t++)
  38.     {
  39.         W[t] = context->Message_Block[t * 4] << 24;
  40.         W[t] |= context->Message_Block[t * 4 + 1] << 16;
  41.         W[t] |= context->Message_Block[t * 4 + 2] << 8;
  42.         W[t] |= context->Message_Block[t * 4 + 3];
  43.     }
  44.  
  45.     for(t = 16; t < 80; t++)
  46.     {
  47.        W[t] = SHA1CircularShift(1,W[t-3] ^ W[t-8] ^ W[t-14] ^ W[t-16]);
  48.     }
  49.  
  50.     A = context->Intermediate_Hash[0];
  51.     B = context->Intermediate_Hash[1];
  52.     C = context->Intermediate_Hash[2];
  53.     D = context->Intermediate_Hash[3];
  54.     E = context->Intermediate_Hash[4];
  55.     /*  
  56.      *  以下为定义算法所用之数学函数及其迭代算法描述  
  57.      */
  58.     for(t = 0; t < 20; t++)
  59.     {
  60. 		temp =  SHA1CircularShift(5,A) +
  61. 			((B & C) | ((~B) & D)) + E + W[t] + K[0];
  62. 		E = D;
  63. 		D = C;
  64. 		C = SHA1CircularShift(30,B);
  65. 		B = A;
  66. 		A = temp;
  67.     }
  68.  
  69.     for(t = 20; t < 40; t++)
  70.     {
  71.         temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[1];
  72.         E = D;
  73.         D = C;
  74.         C = SHA1CircularShift(30,B);
  75.         B = A;
  76.         A = temp;
  77.     }
  78.  
  79.     for(t = 40; t < 60; t++)
  80.     {
  81.         temp = SHA1CircularShift(5,A) +
  82.                ((B & C) | (B & D) | (C & D)) + E + W[t] + K[2];
  83.         E = D;
  84.         D = C;
  85.         C = SHA1CircularShift(30,B);
  86.         B = A;
  87.         A = temp;
  88.     }
  89.  
  90.     for(t = 60; t < 80; t++)
  91.     {
  92.         temp = SHA1CircularShift(5,A) + (B ^ C ^ D) + E + W[t] + K[3];
  93.         E = D;
  94.         D = C;
  95.         C = SHA1CircularShift(30,B);
  96.         B = A;
  97.         A = temp;
  98.     }
  99.     /*  
  100.      *  以下为迭代算法第80步（最后一步）描述
  101.      */
  102.     context->Intermediate_Hash[0] += A;
  103.     context->Intermediate_Hash[1] += B;
  104.     context->Intermediate_Hash[2] += C;
  105.     context->Intermediate_Hash[3] += D;
  106.     context->Intermediate_Hash[4] += E;
  107.  
  108.     context->Message_Block_Index = 0;
  109. }
  110.  
  111.  
  112. /*
  113.  *  SHA1PadMessage
  114.  *  数据填充模块
  115.  */
  116.  
  117. void SHA_1::SHA1PadMessage(SHA1Context *context)
  118. {
  119.  
  120.     if (context->Message_Block_Index > 55)
  121.     {
  122.         context->Message_Block[context->Message_Block_Index++] = 0x80;
  123.         while(context->Message_Block_Index < 64)
  124.         {
  125.             context->Message_Block[context->Message_Block_Index++] = 0;
  126.         }
  127.  
  128.         SHA1ProcessMessageBlock(context);
  129.  
  130.         while(context->Message_Block_Index < 56)
  131.         {
  132.             context->Message_Block[context->Message_Block_Index++] = 0;
  133.         }
  134.     }
  135.     else
  136.     {
  137.         context->Message_Block[context->Message_Block_Index++] = 0x80;
  138.         while(context->Message_Block_Index < 56)
  139.         {
  140.             context->Message_Block[context->Message_Block_Index++] = 0;
  141.         }
  142.     }
  143.  
  144.     /*
  145.      *  把最后64位保存为数据长度
  146.      */
  147.     context->Message_Block[56] = context->Length_High >> 24;
  148.     context->Message_Block[57] = context->Length_High >> 16;
  149.     context->Message_Block[58] = context->Length_High >> 8;
  150.     context->Message_Block[59] = context->Length_High;
  151.     context->Message_Block[60] = context->Length_Low >> 24;
  152.     context->Message_Block[61] = context->Length_Low >> 16;
  153.     context->Message_Block[62] = context->Length_Low >> 8;
  154.     context->Message_Block[63] = context->Length_Low;
  155.  
  156.     SHA1ProcessMessageBlock(context);
  157. }
  158.  
  159. /*
  160.  *  SHA1Reset
  161.  *  
  162.  *  以下为数据初始化之操作
  163.  *  Parameters:（参数设置）
  164.  *  context: [in/out]
  165.  *  The context to reset.
  166.  *
  167.  */
  168. int SHA_1::SHA1Reset(SHA1Context *context)
  169. {
  170.     if (!context)
  171.     {
  172.         return shaNull;
  173.     }
  174.  
  175.     context->Length_Low             = 0;
  176.     context->Length_High            = 0;
  177.     context->Message_Block_Index    = 0;
  178.  
  179.     context->Intermediate_Hash[0]   = 0x67452301;
  180.     context->Intermediate_Hash[1]   = 0xEFCDAB89;
  181.     context->Intermediate_Hash[2]   = 0x98BADCFE;
  182.     context->Intermediate_Hash[3]   = 0x10325476;
  183.     context->Intermediate_Hash[4]   = 0xC3D2E1F0;
  184.  
  185.     context->Computed   = 0;
  186.     context->Corrupted  = 0;
  187.     return shaSuccess;
  188. }
  189.  
  190. /*
  191.  *  SHA1Result
  192.  *
  193.  *  以下为sha-1结果描述：
  194.  *:
  195.  *  该算法将会返回一个160比特的消息摘要队列
  196.  *
  197.  *  或者输出计算错误
  198.  *
  199.  */
  200. int SHA_1::SHA1Result( SHA1Context *context,
  201.                 uint8_t Message_Digest[SHA1HashSize])
  202. {
  203.     int i;
  204.  
  205.     if (!context || !Message_Digest)
  206.     {
  207.         return shaNull;
  208.     }
  209.  
  210.     if (context->Corrupted)
  211.     {
  212.         return context->Corrupted;
  213.     }
  214.  
  215.     if (!context->Computed)
  216.     {
  217.         SHA1PadMessage(context);
  218.         for(i=0; i<64; ++i)
  219.         {
  220.             /* 消息清零 */
  221.             context->Message_Block[i] = 0;
  222.         }
  223.         context->Length_Low = 0;    /* 长度清零 */
  224.         context->Length_High = 0;
  225.         context->Computed = 1;
  226.     }
  227.  
  228.     for(i = 0; i < SHA1HashSize; ++i)
  229.     {
  230.         Message_Digest[i] = context->Intermediate_Hash[i>>2]
  231.                             >> 8 * ( 3 - ( i & 0x03 ) );
  232.     }
  233.  
  234.     return shaSuccess;
  235. }
  236.  
  237. /*
  238.  *  以下为sha-1输入描述：
  239.  *
  240.  *  接收单位长度为8字节倍数的消息
  241.  *
  242.  */
  243. int SHA_1::SHA1Input(    SHA1Context    *context,
  244.                   const uint8_t  *message_array,
  245.                   unsigned       length)
  246. {
  247.     if (!length)
  248.     {
  249.         return shaSuccess;
  250.     }
  251.  
  252.     if (!context || !message_array)
  253.     {
  254.         return shaNull;
  255.     }
  256.  
  257.     if (context->Computed)
  258.     {
  259.         context->Corrupted = shaStateError;
  260.         return shaStateError;
  261.     }
  262.  
  263.     if (context->Corrupted)
  264.     {
  265.          return context->Corrupted;
  266.     }
  267.     while(length-- && !context->Corrupted)
  268.     {
  269.     context->Message_Block[context->Message_Block_Index++] =
  270.                     (*message_array & 0xFF);
  271.  
  272.     context->Length_Low += 8;
  273.     if (context->Length_Low == 0)
  274.     {
  275.         context->Length_High++;
  276.         if (context->Length_High == 0)
  277.         {
  278.             /* Message is too long */
  279.             context->Corrupted = 1;
  280.         }
  281.     }
  282.  
  283.     if (context->Message_Block_Index == 64)
  284.     {
  285.         SHA1ProcessMessageBlock(context);
  286.     }
  287.  
  288.     message_array++;
  289.     }
  290.  
  291.     return shaSuccess;
  292. }
  1. #ifndef MD5_H
  2. #define MD5_H
  3.  
  4.  
  5. typedef struct
  6. {
  7.   unsigned int count[2];
  8.   unsigned int state[4];
  9.   unsigned char buffer[64];
  10. } MD5_CTX;
  11.  
  12. #define F(x,y,z) ((x & y) | (~x & z))
  13. #define G(x,y,z) ((x & z) | (y & ~z))
  14. #define H(x,y,z) (x^y^z)
  15. #define I(x,y,z) (y ^ (x | ~z))
  16. #define ROTATE_LEFT(x,n) ((x << n) | (x >> (32-n)))
  17.  
  18. #define FF(a,b,c,d,x,s,ac) \
  19. { \
  20.   a += F(b,c,d) + x + ac; \
  21.   a = ROTATE_LEFT(a,s); \
  22.   a += b; \
  23. }
  24. #define GG(a,b,c,d,x,s,ac) \
  25. { \
  26.   a += G(b,c,d) + x + ac; \
  27.   a = ROTATE_LEFT(a,s); \
  28.   a += b; \
  29. }
  30. #define HH(a,b,c,d,x,s,ac) \
  31. { \
  32.   a += H(b,c,d) + x + ac; \
  33.   a = ROTATE_LEFT(a,s); \
  34.   a += b; \
  35. }
  36. #define II(a,b,c,d,x,s,ac) \
  37. { \
  38.   a += I(b,c,d) + x + ac; \
  39.   a = ROTATE_LEFT(a,s); \
  40.   a += b; \
  41. }
  42. void MD5Init(MD5_CTX *context);
  43. void MD5Update(MD5_CTX *context, unsigned char *input, unsigned int inputlen);
  44. void MD5Final(MD5_CTX *context, unsigned char digest[16]);
  45. void MD5Transform(unsigned int state[4], unsigned char block[64]);
  46. void MD5Encode(unsigned char *output, unsigned int *input, unsigned int len);
  47. void MD5Decode(unsigned int *output, unsigned char *input, unsigned int len);
  48.  
  49. #endif
  50.  
  51.  
  52.  
  53. #include "md5.h"
  54. #include <memory.h>
  55. #include <stdlib.h>
  56. #include <stdio.h>
  57. #include<fcntl.h>
  58. unsigned char PADDING[] =
  59. {
  60.   0x80,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  61.   0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  62.   0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  63.   0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
  64. };
  65.  
  66. void MD5Init(MD5_CTX *context)
  67. {
  68.   context->count[0] = 0;
  69.   context->count[1] = 0;
  70.   context->state[0] = 0x67452301;
  71.   context->state[1] = 0xEFCDAB89;
  72.   context->state[2] = 0x98BADCFE;
  73.   context->state[3] = 0x10325476;
  74. }
  75.  
  76. void MD5Update(MD5_CTX *context, unsigned char *input, unsigned int inputlen)
  77. {
  78.   unsigned int i = 0;
  79.   unsigned int index = 0;
  80.   unsigned int partlen = 0;
  81.  
  82.   index = (context->count[0] >> 3) & 0x3F;
  83.   partlen = 64 - index;
  84.   context->count[0] += inputlen << 3;
  85.  
  86.   if(context->count[0] < (inputlen << 3))
  87.     context->count[1]++;
  88.   context->count[1] += inputlen >> 29;
  89.  
  90.   if(inputlen >= partlen)
  91.   {
  92.     memcpy(&context->buffer[index], input,partlen);
  93.     MD5Transform(context->state, context->buffer);
  94.  
  95.     for(i = partlen; i+64 <= inputlen; i+=64)
  96.       MD5Transform(context->state, &input[i]);
  97.  
  98.     index = 0;
  99.   }
  100.   else
  101.   {
  102.     i = 0;
  103.   }
  104.   memcpy(&context->buffer[index], &input[i], inputlen-i);
  105. }
  106.  
  107. void MD5Final(MD5_CTX *context, unsigned char digest[16])
  108. {
  109.   unsigned int index = 0,padlen = 0;
  110.   unsigned char bits[8];
  111.  
  112.   index = (context->count[0] >> 3) & 0x3F;
  113.   padlen = (index < 56)?(56-index):(120-index);
  114.   MD5Encode(bits, context->count, 8);
  115.   MD5Update(context, PADDING, padlen);
  116.   MD5Update(context, bits, 8);
  117.   MD5Encode(digest, context->state, 16);
  118. }
  119.  
  120. void MD5Encode(unsigned char *output,unsigned int *input,unsigned int len)
  121. {
  122.   unsigned int i = 0;
  123.   unsigned int j = 0;
  124.  
  125.   while(j < len)
  126.   {
  127.     output[j] = input[i] & 0xFF;
  128.     output[j+1] = (input[i] >> 8) & 0xFF;
  129.     output[j+2] = (input[i] >> 16) & 0xFF;
  130.     output[j+3] = (input[i] >> 24) & 0xFF;
  131.     i++;
  132.     j += 4;
  133.   }
  134. }
  135.  
  136. void MD5Decode(unsigned int *output, unsigned char *input, unsigned int len)
  137. {
  138.   unsigned int i = 0;
  139.   unsigned int j = 0;
  140.  
  141.   while(j < len)
  142.   {
  143.     output[i] = (input[j]) |
  144.       (input[j+1] << 8) |
  145.       (input[j+2] << 16) |
  146.       (input[j+3] << 24);
  147.     i++;
  148.     j += 4;
  149.   }
  150. }
  151.  
  152. void MD5Transform(unsigned int state[4], unsigned char block[64])
  153. {
  154.   unsigned int a = state[0];
  155.   unsigned int b = state[1];
  156.   unsigned int c = state[2];
  157.   unsigned int d = state[3];
  158.   unsigned int x[64];
  159.  
  160.   MD5Decode(x,block,64);
  161.  
  162.   FF(a, b, c, d, x[ 0], 7, 0xd76aa478); /* 1 */
  163.   FF(d, a, b, c, x[ 1], 12, 0xe8c7b756); /* 2 */
  164.   FF(c, d, a, b, x[ 2], 17, 0x242070db); /* 3 */
  165.   FF(b, c, d, a, x[ 3], 22, 0xc1bdceee); /* 4 */
  166.   FF(a, b, c, d, x[ 4], 7, 0xf57c0faf); /* 5 */
  167.   FF(d, a, b, c, x[ 5], 12, 0x4787c62a); /* 6 */
  168.   FF(c, d, a, b, x[ 6], 17, 0xa8304613); /* 7 */
  169.   FF(b, c, d, a, x[ 7], 22, 0xfd469501); /* 8 */
  170.   FF(a, b, c, d, x[ 8], 7, 0x698098d8); /* 9 */
  171.   FF(d, a, b, c, x[ 9], 12, 0x8b44f7af); /* 10 */
  172.   FF(c, d, a, b, x[10], 17, 0xffff5bb1); /* 11 */
  173.   FF(b, c, d, a, x[11], 22, 0x895cd7be); /* 12 */
  174.   FF(a, b, c, d, x[12], 7, 0x6b901122); /* 13 */
  175.   FF(d, a, b, c, x[13], 12, 0xfd987193); /* 14 */
  176.   FF(c, d, a, b, x[14], 17, 0xa679438e); /* 15 */
  177.   FF(b, c, d, a, x[15], 22, 0x49b40821); /* 16 */
  178.  
  179.   /* Round 2 */
  180.   GG(a, b, c, d, x[ 1], 5, 0xf61e2562); /* 17 */
  181.   GG(d, a, b, c, x[ 6], 9, 0xc040b340); /* 18 */
  182.   GG(c, d, a, b, x[11], 14, 0x265e5a51); /* 19 */
  183.   GG(b, c, d, a, x[ 0], 20, 0xe9b6c7aa); /* 20 */
  184.   GG(a, b, c, d, x[ 5], 5, 0xd62f105d); /* 21 */
  185.   GG(d, a, b, c, x[10], 9,  0x2441453); /* 22 */
  186.   GG(c, d, a, b, x[15], 14, 0xd8a1e681); /* 23 */
  187.   GG(b, c, d, a, x[ 4], 20, 0xe7d3fbc8); /* 24 */
  188.   GG(a, b, c, d, x[ 9], 5, 0x21e1cde6); /* 25 */
  189.   GG(d, a, b, c, x[14], 9, 0xc33707d6); /* 26 */
  190.   GG(c, d, a, b, x[ 3], 14, 0xf4d50d87); /* 27 */
  191.   GG(b, c, d, a, x[ 8], 20, 0x455a14ed); /* 28 */
  192.   GG(a, b, c, d, x[13], 5, 0xa9e3e905); /* 29 */
  193.   GG(d, a, b, c, x[ 2], 9, 0xfcefa3f8); /* 30 */
  194.   GG(c, d, a, b, x[ 7], 14, 0x676f02d9); /* 31 */
  195.   GG(b, c, d, a, x[12], 20, 0x8d2a4c8a); /* 32 */
  196.  
  197.   /* Round 3 */
  198.   HH(a, b, c, d, x[ 5], 4, 0xfffa3942); /* 33 */
  199.   HH(d, a, b, c, x[ 8], 11, 0x8771f681); /* 34 */
  200.   HH(c, d, a, b, x[11], 16, 0x6d9d6122); /* 35 */
  201.   HH(b, c, d, a, x[14], 23, 0xfde5380c); /* 36 */
  202.   HH(a, b, c, d, x[ 1], 4, 0xa4beea44); /* 37 */
  203.   HH(d, a, b, c, x[ 4], 11, 0x4bdecfa9); /* 38 */
  204.   HH(c, d, a, b, x[ 7], 16, 0xf6bb4b60); /* 39 */
  205.   HH(b, c, d, a, x[10], 23, 0xbebfbc70); /* 40 */
  206.   HH(a, b, c, d, x[13], 4, 0x289b7ec6); /* 41 */
  207.   HH(d, a, b, c, x[ 0], 11, 0xeaa127fa); /* 42 */
  208.   HH(c, d, a, b, x[ 3], 16, 0xd4ef3085); /* 43 */
  209.   HH(b, c, d, a, x[ 6], 23,  0x4881d05); /* 44 */
  210.   HH(a, b, c, d, x[ 9], 4, 0xd9d4d039); /* 45 */
  211.   HH(d, a, b, c, x[12], 11, 0xe6db99e5); /* 46 */
  212.   HH(c, d, a, b, x[15], 16, 0x1fa27cf8); /* 47 */
  213.   HH(b, c, d, a, x[ 2], 23, 0xc4ac5665); /* 48 */
  214.  
  215.   /* Round 4 */
  216.   II(a, b, c, d, x[ 0], 6, 0xf4292244); /* 49 */
  217.   II(d, a, b, c, x[ 7], 10, 0x432aff97); /* 50 */
  218.   II(c, d, a, b, x[14], 15, 0xab9423a7); /* 51 */
  219.   II(b, c, d, a, x[ 5], 21, 0xfc93a039); /* 52 */
  220.   II(a, b, c, d, x[12], 6, 0x655b59c3); /* 53 */
  221.   II(d, a, b, c, x[ 3], 10, 0x8f0ccc92); /* 54 */
  222.   II(c, d, a, b, x[10], 15, 0xffeff47d); /* 55 */
  223.   II(b, c, d, a, x[ 1], 21, 0x85845dd1); /* 56 */
  224.   II(a, b, c, d, x[ 8], 6, 0x6fa87e4f); /* 57 */
  225.   II(d, a, b, c, x[15], 10, 0xfe2ce6e0); /* 58 */
  226.   II(c, d, a, b, x[ 6], 15, 0xa3014314); /* 59 */
  227.   II(b, c, d, a, x[13], 21, 0x4e0811a1); /* 60 */
  228.   II(a, b, c, d, x[ 4], 6, 0xf7537e82); /* 61 */
  229.   II(d, a, b, c, x[11], 10, 0xbd3af235); /* 62 */
  230.   II(c, d, a, b, x[ 2], 15, 0x2ad7d2bb); /* 63 */
  231.   II(b, c, d, a, x[ 9], 21, 0xeb86d391); /* 64 */
  232.   state[0] += a;
  233.   state[1] += b;
  234.   state[2] += c;
  235.   state[3] += d;
  236. }

声明：本文内容由网友自发贡献，不代表【wpsshop博客】立场，版权归原作者所有，本站不承担相应法律责任。如您发现有侵权的内容，请联系我们。转载请注明出处：https://www.wpsshop.cn/w/不正经/article/detail/515553
推荐阅读
相关标签

Copyright © 2003-2013 www.wpsshop.cn 版权所有，并保留所有权利。

  

闽ICP备14008679号