md5.c 5.2 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164
  1. #include <string.h>
  2. #include "md5.h"
  3. unsigned char PADDING[]= {0x80,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  4. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  5. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,
  6. 0,0,0,0,0,0,0,0,0,0,0,0,0,0,0,0
  7. };
  8. void MD5Init(MD5_CTX *context)
  9. {
  10. context->count[0] = 0;
  11. context->count[1] = 0;
  12. context->state[0] = 0x67452301;
  13. context->state[1] = 0xEFCDAB89;
  14. context->state[2] = 0x98BADCFE;
  15. context->state[3] = 0x10325476;
  16. }
  17. void MD5Update(MD5_CTX *context,unsigned char *input,unsigned int inputlen)
  18. {
  19. unsigned int i = 0,index = 0,partlen = 0;
  20. index = (context->count[0] >> 3) & 0x3F;
  21. partlen = 64 - index;
  22. context->count[0] += inputlen << 3;
  23. if(context->count[0] < (inputlen << 3))
  24. context->count[1]++;
  25. context->count[1] += inputlen >> 29;
  26. if(inputlen >= partlen)
  27. {
  28. memcpy(&context->buffer[index],input,partlen);
  29. MD5Transform(context->state,context->buffer);
  30. for(i = partlen; i+64 <= inputlen; i+=64)
  31. MD5Transform(context->state,&input[i]);
  32. index = 0;
  33. }
  34. else
  35. {
  36. i = 0;
  37. }
  38. memcpy(&context->buffer[index],&input[i],inputlen-i);
  39. }
  40. void MD5Final(MD5_CTX *context,unsigned char digest[16])
  41. {
  42. unsigned int index = 0,padlen = 0;
  43. unsigned char bits[8];
  44. index = (context->count[0] >> 3) & 0x3F;
  45. padlen = (index < 56)?(56-index):(120-index);
  46. MD5Encode(bits,context->count,8);
  47. MD5Update(context,PADDING,padlen);
  48. MD5Update(context,bits,8);
  49. MD5Encode(digest,context->state,16);
  50. }
  51. void MD5Encode(unsigned char *output,unsigned int *input,unsigned int len)
  52. {
  53. unsigned int i = 0,j = 0;
  54. while(j < len)
  55. {
  56. output[j] = input[i] & 0xFF;
  57. output[j+1] = (input[i] >> 8) & 0xFF;
  58. output[j+2] = (input[i] >> 16) & 0xFF;
  59. output[j+3] = (input[i] >> 24) & 0xFF;
  60. i++;
  61. j+=4;
  62. }
  63. }
  64. void MD5Decode(unsigned int *output,unsigned char *input,unsigned int len)
  65. {
  66. unsigned int i = 0,j = 0;
  67. while(j < len)
  68. {
  69. output[i] = (input[j]) |
  70. (input[j+1] << 8) |
  71. (input[j+2] << 16) |
  72. (input[j+3] << 24);
  73. i++;
  74. j+=4;
  75. }
  76. }
  77. void MD5Transform(unsigned int state[4],unsigned char block[64])
  78. {
  79. unsigned int a = state[0];
  80. unsigned int b = state[1];
  81. unsigned int c = state[2];
  82. unsigned int d = state[3];
  83. unsigned int x[64];
  84. MD5Decode(x,block,64);
  85. FF(a, b, c, d, x[ 0], 7, 0xd76aa478);
  86. FF(d, a, b, c, x[ 1], 12, 0xe8c7b756);
  87. FF(c, d, a, b, x[ 2], 17, 0x242070db);
  88. FF(b, c, d, a, x[ 3], 22, 0xc1bdceee);
  89. FF(a, b, c, d, x[ 4], 7, 0xf57c0faf);
  90. FF(d, a, b, c, x[ 5], 12, 0x4787c62a);
  91. FF(c, d, a, b, x[ 6], 17, 0xa8304613);
  92. FF(b, c, d, a, x[ 7], 22, 0xfd469501);
  93. FF(a, b, c, d, x[ 8], 7, 0x698098d8);
  94. FF(d, a, b, c, x[ 9], 12, 0x8b44f7af);
  95. FF(c, d, a, b, x[10], 17, 0xffff5bb1);
  96. FF(b, c, d, a, x[11], 22, 0x895cd7be);
  97. FF(a, b, c, d, x[12], 7, 0x6b901122);
  98. FF(d, a, b, c, x[13], 12, 0xfd987193);
  99. FF(c, d, a, b, x[14], 17, 0xa679438e);
  100. FF(b, c, d, a, x[15], 22, 0x49b40821);
  101. GG(a, b, c, d, x[ 1], 5, 0xf61e2562);
  102. GG(d, a, b, c, x[ 6], 9, 0xc040b340);
  103. GG(c, d, a, b, x[11], 14, 0x265e5a51);
  104. GG(b, c, d, a, x[ 0], 20, 0xe9b6c7aa);
  105. GG(a, b, c, d, x[ 5], 5, 0xd62f105d);
  106. GG(d, a, b, c, x[10], 9, 0x2441453);
  107. GG(c, d, a, b, x[15], 14, 0xd8a1e681);
  108. GG(b, c, d, a, x[ 4], 20, 0xe7d3fbc8);
  109. GG(a, b, c, d, x[ 9], 5, 0x21e1cde6);
  110. GG(d, a, b, c, x[14], 9, 0xc33707d6);
  111. GG(c, d, a, b, x[ 3], 14, 0xf4d50d87);
  112. GG(b, c, d, a, x[ 8], 20, 0x455a14ed);
  113. GG(a, b, c, d, x[13], 5, 0xa9e3e905);
  114. GG(d, a, b, c, x[ 2], 9, 0xfcefa3f8);
  115. GG(c, d, a, b, x[ 7], 14, 0x676f02d9);
  116. GG(b, c, d, a, x[12], 20, 0x8d2a4c8a);
  117. HH(a, b, c, d, x[ 5], 4, 0xfffa3942);
  118. HH(d, a, b, c, x[ 8], 11, 0x8771f681);
  119. HH(c, d, a, b, x[11], 16, 0x6d9d6122);
  120. HH(b, c, d, a, x[14], 23, 0xfde5380c);
  121. HH(a, b, c, d, x[ 1], 4, 0xa4beea44);
  122. HH(d, a, b, c, x[ 4], 11, 0x4bdecfa9);
  123. HH(c, d, a, b, x[ 7], 16, 0xf6bb4b60);
  124. HH(b, c, d, a, x[10], 23, 0xbebfbc70);
  125. HH(a, b, c, d, x[13], 4, 0x289b7ec6);
  126. HH(d, a, b, c, x[ 0], 11, 0xeaa127fa);
  127. HH(c, d, a, b, x[ 3], 16, 0xd4ef3085);
  128. HH(b, c, d, a, x[ 6], 23, 0x4881d05);
  129. HH(a, b, c, d, x[ 9], 4, 0xd9d4d039);
  130. HH(d, a, b, c, x[12], 11, 0xe6db99e5);
  131. HH(c, d, a, b, x[15], 16, 0x1fa27cf8);
  132. HH(b, c, d, a, x[ 2], 23, 0xc4ac5665);
  133. II(a, b, c, d, x[ 0], 6, 0xf4292244);
  134. II(d, a, b, c, x[ 7], 10, 0x432aff97);
  135. II(c, d, a, b, x[14], 15, 0xab9423a7);
  136. II(b, c, d, a, x[ 5], 21, 0xfc93a039);
  137. II(a, b, c, d, x[12], 6, 0x655b59c3);
  138. II(d, a, b, c, x[ 3], 10, 0x8f0ccc92);
  139. II(c, d, a, b, x[10], 15, 0xffeff47d);
  140. II(b, c, d, a, x[ 1], 21, 0x85845dd1);
  141. II(a, b, c, d, x[ 8], 6, 0x6fa87e4f);
  142. II(d, a, b, c, x[15], 10, 0xfe2ce6e0);
  143. II(c, d, a, b, x[ 6], 15, 0xa3014314);
  144. II(b, c, d, a, x[13], 21, 0x4e0811a1);
  145. II(a, b, c, d, x[ 4], 6, 0xf7537e82);
  146. II(d, a, b, c, x[11], 10, 0xbd3af235);
  147. II(c, d, a, b, x[ 2], 15, 0x2ad7d2bb);
  148. II(b, c, d, a, x[ 9], 21, 0xeb86d391);
  149. state[0] += a;
  150. state[1] += b;
  151. state[2] += c;
  152. state[3] += d;
  153. }