API tools faq
paste
Advertisement
Guest User

MD5 - FFD.H - METIN2DEV PROTECT

a guest
Jun 3rd, 2016
1,652
0
Never
Add comment
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ (WinAPI) 11.20 KB | None | 0 0
raw download clone embed print report
  1. #ifndef MD5_H
  2. #define MD5_H
  3.  
  4. // Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
  5. // rights reserved.
  6.  
  7. // License to copy and use this software is granted provided that it
  8. // is identified as the "RSA Data Security, Inc. MD5 Message-Digest
  9. // Algorithm" in all material mentioning or referencing this software
  10. // or this function.
  11. //
  12. // License is also granted to make and use derivative works provided
  13. // that such works are identified as "derived from the RSA Data
  14. // Security, Inc. MD5 Message-Digest Algorithm" in all material
  15. // mentioning or referencing the derived work.
  16. //
  17. // RSA Data Security, Inc. makes no representations concerning either
  18. // the merchantability of this software or the suitability of this
  19. // software for any particular purpose. It is provided "as is"
  20. // without express or implied warranty of any kind.
  21. //
  22. // These notices must be retained in any copies of any part of this
  23. // documentation and/or software.
  24.  
  25.  
  26.  
  27. // The original md5 implementation avoids external libraries.
  28. // This version has dependency on stdio.h for file input and
  29. // string.h for memcpy.
  30. #include <stdio.h>
  31. #include <string.h>
  32.  
  33. #pragma region MD5 defines
  34. // Constants for MD5Transform routine.
  35. #define S11 7
  36. #define S12 12
  37. #define S13 17
  38. #define S14 22
  39. #define S21 5
  40. #define S22 9
  41. #define S23 14
  42. #define S24 20
  43. #define S31 4
  44. #define S32 11
  45. #define S33 16
  46. #define S34 23
  47. #define S41 6
  48. #define S42 10
  49. #define S43 15
  50. #define S44 21
  51.  
  52.  
  53.  
  54.  
  55.  
  56.  
  57. static unsigned char PADDING[64] = {
  58.     0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  59.     0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  60.     0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  61. };
  62.  
  63. // F, G, H and I are basic MD5 functions.
  64. #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
  65. #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
  66. #define H(x, y, z) ((x) ^ (y) ^ (z))
  67. #define I(x, y, z) ((y) ^ ((x) | (~z)))
  68.  
  69. // ROTATE_LEFT rotates x left n bits.
  70. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
  71.  
  72. // FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
  73. // Rotation is separate from addition to prevent recomputation.
  74. #define FF(a, b, c, d, x, s, ac) { \
  75.     (a) += F((b), (c), (d)) + (x)+(UINT4)(ac); \
  76.     (a) = ROTATE_LEFT((a), (s)); \
  77.     (a) += (b); \
  78. }
  79. #define GG(a, b, c, d, x, s, ac) { \
  80.     (a) += G((b), (c), (d)) + (x)+(UINT4)(ac); \
  81.     (a) = ROTATE_LEFT((a), (s)); \
  82.     (a) += (b); \
  83.     }
  84. #define HH(a, b, c, d, x, s, ac) { \
  85.     (a) += H((b), (c), (d)) + (x)+(UINT4)(ac); \
  86.     (a) = ROTATE_LEFT((a), (s)); \
  87.     (a) += (b); \
  88.     }
  89. #define II(a, b, c, d, x, s, ac) { \
  90.     (a) += I((b), (c), (d)) + (x)+(UINT4)(ac); \
  91.     (a) = ROTATE_LEFT((a), (s)); \
  92.     (a) += (b); \
  93.     }
  94. #pragma endregion
  95.  
  96. typedef unsigned char BYTE;
  97.  
  98. // POINTER defines a generic pointer type
  99. typedef unsigned char *POINTER;
  100.  
  101. // UINT2 defines a two byte word
  102. typedef unsigned short int UINT2;
  103.  
  104. // UINT4 defines a four byte word
  105. typedef unsigned long int UINT4;
  106.  
  107.  
  108. // convenient object that wraps
  109. // the C-functions for use in C++ only
  110. class MD5
  111. {
  112. private:
  113.     struct __context_t {
  114.         UINT4 state[4];                                   /* state (ABCD) */
  115.         UINT4 count[2];        /* number of bits, modulo 2^64 (lsb first) */
  116.         unsigned char buffer[64];                         /* input buffer */
  117.     } context;
  118.  
  119. #pragma region static helper functions
  120.     // The core of the MD5 algorithm is here.
  121.     // MD5 basic transformation. Transforms state based on block.
  122.     static void MD5Transform(UINT4 state[4], unsigned char block[64])
  123.     {
  124.         UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
  125.  
  126.         Decode(x, block, 64);
  127.  
  128.         /* Round 1 */
  129.         FF(a, b, c, d, x[0], S11, 0xd76aa478); /* 1 */
  130.         FF(d, a, b, c, x[1], S12, 0xe8c7b756); /* 2 */
  131.         FF(c, d, a, b, x[2], S13, 0x242070db); /* 3 */
  132.         FF(b, c, d, a, x[3], S14, 0xc1bdceee); /* 4 */
  133.         FF(a, b, c, d, x[4], S11, 0xf57c0faf); /* 5 */
  134.         FF(d, a, b, c, x[5], S12, 0x4787c62a); /* 6 */
  135.         FF(c, d, a, b, x[6], S13, 0xa8304613); /* 7 */
  136.         FF(b, c, d, a, x[7], S14, 0xfd469501); /* 8 */
  137.         FF(a, b, c, d, x[8], S11, 0x698098d8); /* 9 */
  138.         FF(d, a, b, c, x[9], S12, 0x8b44f7af); /* 10 */
  139.         FF(c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
  140.         FF(b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
  141.         FF(a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
  142.         FF(d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
  143.         FF(c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
  144.         FF(b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
  145.  
  146.         /* Round 2 */
  147.         GG(a, b, c, d, x[1], S21, 0xf61e2562); /* 17 */
  148.         GG(d, a, b, c, x[6], S22, 0xc040b340); /* 18 */
  149.         GG(c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
  150.         GG(b, c, d, a, x[0], S24, 0xe9b6c7aa); /* 20 */
  151.         GG(a, b, c, d, x[5], S21, 0xd62f105d); /* 21 */
  152.         GG(d, a, b, c, x[10], S22, 0x2441453); /* 22 */
  153.         GG(c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
  154.         GG(b, c, d, a, x[4], S24, 0xe7d3fbc8); /* 24 */
  155.         GG(a, b, c, d, x[9], S21, 0x21e1cde6); /* 25 */
  156.         GG(d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
  157.         GG(c, d, a, b, x[3], S23, 0xf4d50d87); /* 27 */
  158.         GG(b, c, d, a, x[8], S24, 0x455a14ed); /* 28 */
  159.         GG(a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
  160.         GG(d, a, b, c, x[2], S22, 0xfcefa3f8); /* 30 */
  161.         GG(c, d, a, b, x[7], S23, 0x676f02d9); /* 31 */
  162.         GG(b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
  163.  
  164.         /* Round 3 */
  165.         HH(a, b, c, d, x[5], S31, 0xfffa3942); /* 33 */
  166.         HH(d, a, b, c, x[8], S32, 0x8771f681); /* 34 */
  167.         HH(c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
  168.         HH(b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
  169.         HH(a, b, c, d, x[1], S31, 0xa4beea44); /* 37 */
  170.         HH(d, a, b, c, x[4], S32, 0x4bdecfa9); /* 38 */
  171.         HH(c, d, a, b, x[7], S33, 0xf6bb4b60); /* 39 */
  172.         HH(b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
  173.         HH(a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
  174.         HH(d, a, b, c, x[0], S32, 0xeaa127fa); /* 42 */
  175.         HH(c, d, a, b, x[3], S33, 0xd4ef3085); /* 43 */
  176.         HH(b, c, d, a, x[6], S34, 0x4881d05); /* 44 */
  177.         HH(a, b, c, d, x[9], S31, 0xd9d4d039); /* 45 */
  178.         HH(d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
  179.         HH(c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
  180.         HH(b, c, d, a, x[2], S34, 0xc4ac5665); /* 48 */
  181.  
  182.         /* Round 4 */
  183.         II(a, b, c, d, x[0], S41, 0xf4292244); /* 49 */
  184.         II(d, a, b, c, x[7], S42, 0x432aff97); /* 50 */
  185.         II(c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
  186.         II(b, c, d, a, x[5], S44, 0xfc93a039); /* 52 */
  187.         II(a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
  188.         II(d, a, b, c, x[3], S42, 0x8f0ccc92); /* 54 */
  189.         II(c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
  190.         II(b, c, d, a, x[1], S44, 0x85845dd1); /* 56 */
  191.         II(a, b, c, d, x[8], S41, 0x6fa87e4f); /* 57 */
  192.         II(d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
  193.         II(c, d, a, b, x[6], S43, 0xa3014314); /* 59 */
  194.         II(b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
  195.         II(a, b, c, d, x[4], S41, 0xf7537e82); /* 61 */
  196.         II(d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
  197.         II(c, d, a, b, x[2], S43, 0x2ad7d2bb); /* 63 */
  198.         II(b, c, d, a, x[9], S44, 0xeb86d391); /* 64 */
  199.  
  200.         state[0] += a;
  201.         state[1] += b;
  202.         state[2] += c;
  203.         state[3] += d;
  204.  
  205.         // Zeroize sensitive information.
  206.         memset((POINTER)x, 0, sizeof (x));
  207.     }
  208.  
  209.     // Encodes input (UINT4) into output (unsigned char). Assumes len is
  210.     // a multiple of 4.
  211.     static void Encode(unsigned char *output, UINT4 *input, unsigned int len)
  212.     {
  213.         unsigned int i, j;
  214.  
  215.         for (i = 0, j = 0; j < len; i++, j += 4) {
  216.             output[j] = (unsigned char)(input[i] & 0xff);
  217.             output[j + 1] = (unsigned char)((input[i] >> 8) & 0xff);
  218.             output[j + 2] = (unsigned char)((input[i] >> 16) & 0xff);
  219.             output[j + 3] = (unsigned char)((input[i] >> 24) & 0xff);
  220.         }
  221.     }
  222.  
  223.     // Decodes input (unsigned char) into output (UINT4). Assumes len is
  224.     // a multiple of 4.
  225.     static void Decode(UINT4 *output, unsigned char *input, unsigned int len)
  226.     {
  227.         unsigned int i, j;
  228.  
  229.         for (i = 0, j = 0; j < len; i++, j += 4)
  230.             output[i] = ((UINT4)input[j]) | (((UINT4)input[j + 1]) << 8) |
  231.             (((UINT4)input[j + 2]) << 16) | (((UINT4)input[j + 3]) << 24);
  232.     }
  233. #pragma endregion
  234.  
  235.  
  236. public:
  237.     // MAIN FUNCTIONS
  238.     MD5()
  239.     {
  240.         Init();
  241.     }
  242.  
  243.     // MD5 initialization. Begins an MD5 operation, writing a new context.
  244.     void Init()
  245.     {
  246.         context.count[0] = context.count[1] = 0;
  247.  
  248.         // Load magic initialization constants.
  249.         context.state[0] = 0x67452301;
  250.         context.state[1] = 0xefcdab89;
  251.         context.state[2] = 0x98badcfe;
  252.         context.state[3] = 0x10325476;
  253.     }
  254.  
  255.     // MD5 block update operation. Continues an MD5 message-digest
  256.     // operation, processing another message block, and updating the
  257.     // context.
  258.     void Update(
  259.         unsigned char *input,   // input block
  260.         unsigned int inputLen) // length of input block
  261.     {
  262.         unsigned int i, index, partLen;
  263.  
  264.         // Compute number of bytes mod 64
  265.         index = (unsigned int)((context.count[0] >> 3) & 0x3F);
  266.  
  267.         // Update number of bits
  268.         if ((context.count[0] += ((UINT4)inputLen << 3))
  269.             < ((UINT4)inputLen << 3))
  270.             context.count[1]++;
  271.         context.count[1] += ((UINT4)inputLen >> 29);
  272.  
  273.         partLen = 64 - index;
  274.  
  275.         // Transform as many times as possible.
  276.         if (inputLen >= partLen) {
  277.             memcpy((POINTER)&context.buffer[index], (POINTER)input, partLen);
  278.             MD5Transform(context.state, context.buffer);
  279.  
  280.             for (i = partLen; i + 63 < inputLen; i += 64)
  281.                 MD5Transform(context.state, &input[i]);
  282.  
  283.             index = 0;
  284.         }
  285.         else
  286.             i = 0;
  287.  
  288.         /* Buffer remaining input */
  289.         memcpy((POINTER)&context.buffer[index], (POINTER)&input[i], inputLen - i);
  290.     }
  291.  
  292.     // MD5 finalization. Ends an MD5 message-digest operation, writing the
  293.     // the message digest and zeroizing the context.
  294.     // Writes to digestRaw
  295.     void Final()
  296.     {
  297.         unsigned char bits[8];
  298.         unsigned int index, padLen;
  299.  
  300.         // Save number of bits
  301.         Encode(bits, context.count, 8);
  302.  
  303.         // Pad out to 56 mod 64.
  304.         index = (unsigned int)((context.count[0] >> 3) & 0x3f);
  305.         padLen = (index < 56) ? (56 - index) : (120 - index);
  306.         Update(PADDING, padLen);
  307.  
  308.         // Append length (before padding)
  309.         Update(bits, 8);
  310.  
  311.         // Store state in digest
  312.         Encode(digestRaw, context.state, 16);
  313.  
  314.         // Zeroize sensitive information.
  315.         memset((POINTER)&context, 0, sizeof (context));
  316.  
  317.         writeToString();
  318.     }
  319.  
  320.     /// Buffer must be 32+1 (nul) = 33 chars long at least
  321.     void writeToString()
  322.     {
  323.         int pos;
  324.  
  325.         for (pos = 0; pos < 16; pos++)
  326.             sprintf(digestChars + (pos * 2), "%02x", digestRaw[pos]);
  327.     }
  328.  
  329.  
  330. public:
  331.     // an MD5 digest is a 16-byte number (32 hex digits)
  332.     BYTE digestRaw[16];
  333.  
  334.     // This version of the digest is actually
  335.     // a "printf'd" version of the digest.
  336.     char digestChars[33];
  337.  
  338.     /// Load a file from disk and digest it
  339.     // Digests a file and returns the result.
  340.     char* digestFile(char *filename)
  341.     {
  342.         Init();
  343.  
  344.         FILE *file;
  345.  
  346.         int len;
  347.         unsigned char buffer[1024];
  348.  
  349.         if ((file = fopen(filename, "rb")) == NULL)
  350.             printf("%s can't be opened\n", filename);
  351.         else
  352.         {
  353.             while (len = fread(buffer, 1, 1024, file))
  354.                 Update(buffer, len);
  355.             Final();
  356.  
  357.             fclose(file);
  358.         }
  359.  
  360.         return digestChars;
  361.     }
  362.  
  363.     /// Digests a byte-array already in memory
  364.     char* digestMemory(BYTE *memchunk, int len)
  365.     {
  366.         Init();
  367.         Update(memchunk, len);
  368.         Final();
  369.  
  370.         return digestChars;
  371.     }
  372.  
  373.     // Digests a string and prints the result.
  374.     char* digestString(char *string)
  375.     {
  376.         Init();
  377.         Update((unsigned char*)string, strlen(string));
  378.         Final();
  379.  
  380.         return digestChars;
  381.     }
  382. };
  383.  
  384. #endif
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement
Public Pastes
Advertisement
We use cookies for various purposes including analytics. By continuing to use Pastebin, you agree to our use of cookies as described in the Cookies Policy.  OK, I Understand
Not a member of Pastebin yet?
Sign Up, it unlocks many cool features!