md5.c 5.8 KB

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