md5.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393
  1. /***************************************************************************
  2. * _ _ ____ _
  3. * Project ___| | | | _ \| |
  4. * / __| | | | |_) | |
  5. * | (__| |_| | _ <| |___
  6. * \___|\___/|_| \_\_____|
  7. *
  8. * Copyright (C) 1998 - 2011, Daniel Stenberg, <daniel@haxx.se>, et al.
  9. *
  10. * This software is licensed as described in the file COPYING, which
  11. * you should have received as part of this distribution. The terms
  12. * are also available at http://curl.haxx.se/docs/copyright.html.
  13. *
  14. * You may opt to use, copy, modify, merge, publish, distribute and/or sell
  15. * copies of the Software, and permit persons to whom the Software is
  16. * furnished to do so, under the terms of the COPYING file.
  17. *
  18. * This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
  19. * KIND, either express or implied.
  20. *
  21. ***************************************************************************/
  22. #include "setup.h"
  23. #ifndef CURL_DISABLE_CRYPTO_AUTH
  24. #include "curl_md5.h"
  25. #include "curl_hmac.h"
  26. #ifdef USE_GNUTLS
  27. #include <gcrypt.h>
  28. typedef gcry_md_hd_t MD5_CTX;
  29. static void MD5_Init(MD5_CTX * ctx)
  30. {
  31. gcry_md_open(ctx, GCRY_MD_MD5, 0);
  32. }
  33. static void MD5_Update(MD5_CTX * ctx,
  34. const unsigned char * input,
  35. unsigned int inputLen)
  36. {
  37. gcry_md_write(*ctx, input, inputLen);
  38. }
  39. static void MD5_Final(unsigned char digest[16], MD5_CTX * ctx)
  40. {
  41. memcpy(digest, gcry_md_read(*ctx, 0), 16);
  42. gcry_md_close(*ctx);
  43. }
  44. #else
  45. #ifdef USE_SSLEAY
  46. /* When OpenSSL is available we use the MD5-function from OpenSSL */
  47. # ifdef USE_OPENSSL
  48. # include <openssl/md5.h>
  49. # else
  50. # include <md5.h>
  51. # endif
  52. #else /* USE_SSLEAY */
  53. /* When OpenSSL is not available we use this code segment */
  54. /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
  55. rights reserved.
  56. License to copy and use this software is granted provided that it
  57. is identified as the "RSA Data Security, Inc. MD5 Message-Digest
  58. Algorithm" in all material mentioning or referencing this software
  59. or this function.
  60. License is also granted to make and use derivative works provided
  61. that such works are identified as "derived from the RSA Data
  62. Security, Inc. MD5 Message-Digest Algorithm" in all material
  63. mentioning or referencing the derived work.
  64. RSA Data Security, Inc. makes no representations concerning either
  65. the merchantability of this software or the suitability of this
  66. software for any particular purpose. It is provided "as is"
  67. without express or implied warranty of any kind.
  68. These notices must be retained in any copies of any part of this
  69. documentation and/or software.
  70. */
  71. /* UINT4 defines a four byte word */
  72. typedef unsigned int UINT4;
  73. /* MD5 context. */
  74. struct md5_ctx {
  75. UINT4 state[4]; /* state (ABCD) */
  76. UINT4 count[2]; /* number of bits, modulo 2^64 (lsb first) */
  77. unsigned char buffer[64]; /* input buffer */
  78. };
  79. typedef struct md5_ctx MD5_CTX;
  80. static void MD5_Init(struct md5_ctx *);
  81. static void MD5_Update(struct md5_ctx *, const unsigned char *, unsigned int);
  82. static void MD5_Final(unsigned char [16], struct md5_ctx *);
  83. /* Constants for MD5Transform routine.
  84. */
  85. #define S11 7
  86. #define S12 12
  87. #define S13 17
  88. #define S14 22
  89. #define S21 5
  90. #define S22 9
  91. #define S23 14
  92. #define S24 20
  93. #define S31 4
  94. #define S32 11
  95. #define S33 16
  96. #define S34 23
  97. #define S41 6
  98. #define S42 10
  99. #define S43 15
  100. #define S44 21
  101. static void MD5Transform(UINT4 [4], const unsigned char [64]);
  102. static void Encode(unsigned char *, UINT4 *, unsigned int);
  103. static void Decode(UINT4 *, const unsigned char *, unsigned int);
  104. static const unsigned char PADDING[64] = {
  105. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  106. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  107. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  108. };
  109. /* F, G, H and I are basic MD5 functions.
  110. */
  111. #define F(x, y, z) (((x) & (y)) | ((~x) & (z)))
  112. #define G(x, y, z) (((x) & (z)) | ((y) & (~z)))
  113. #define H(x, y, z) ((x) ^ (y) ^ (z))
  114. #define I(x, y, z) ((y) ^ ((x) | (~z)))
  115. /* ROTATE_LEFT rotates x left n bits.
  116. */
  117. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
  118. /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
  119. Rotation is separate from addition to prevent recomputation.
  120. */
  121. #define FF(a, b, c, d, x, s, ac) { \
  122. (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
  123. (a) = ROTATE_LEFT ((a), (s)); \
  124. (a) += (b); \
  125. }
  126. #define GG(a, b, c, d, x, s, ac) { \
  127. (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
  128. (a) = ROTATE_LEFT ((a), (s)); \
  129. (a) += (b); \
  130. }
  131. #define HH(a, b, c, d, x, s, ac) { \
  132. (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
  133. (a) = ROTATE_LEFT ((a), (s)); \
  134. (a) += (b); \
  135. }
  136. #define II(a, b, c, d, x, s, ac) { \
  137. (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
  138. (a) = ROTATE_LEFT ((a), (s)); \
  139. (a) += (b); \
  140. }
  141. /* MD5 initialization. Begins an MD5 operation, writing a new context.
  142. */
  143. static void MD5_Init(struct md5_ctx *context)
  144. {
  145. context->count[0] = context->count[1] = 0;
  146. /* Load magic initialization constants. */
  147. context->state[0] = 0x67452301;
  148. context->state[1] = 0xefcdab89;
  149. context->state[2] = 0x98badcfe;
  150. context->state[3] = 0x10325476;
  151. }
  152. /* MD5 block update operation. Continues an MD5 message-digest
  153. operation, processing another message block, and updating the
  154. context.
  155. */
  156. static void MD5_Update (struct md5_ctx *context, /* context */
  157. const unsigned char *input, /* input block */
  158. unsigned int inputLen) /* length of input block */
  159. {
  160. unsigned int i, bufindex, partLen;
  161. /* Compute number of bytes mod 64 */
  162. bufindex = (unsigned int)((context->count[0] >> 3) & 0x3F);
  163. /* Update number of bits */
  164. if((context->count[0] += ((UINT4)inputLen << 3))
  165. < ((UINT4)inputLen << 3))
  166. context->count[1]++;
  167. context->count[1] += ((UINT4)inputLen >> 29);
  168. partLen = 64 - bufindex;
  169. /* Transform as many times as possible. */
  170. if(inputLen >= partLen) {
  171. memcpy(&context->buffer[bufindex], input, partLen);
  172. MD5Transform(context->state, context->buffer);
  173. for(i = partLen; i + 63 < inputLen; i += 64)
  174. MD5Transform(context->state, &input[i]);
  175. bufindex = 0;
  176. }
  177. else
  178. i = 0;
  179. /* Buffer remaining input */
  180. memcpy(&context->buffer[bufindex], &input[i], inputLen-i);
  181. }
  182. /* MD5 finalization. Ends an MD5 message-digest operation, writing the
  183. the message digest and zeroizing the context.
  184. */
  185. static void MD5_Final(unsigned char digest[16], /* message digest */
  186. struct md5_ctx *context) /* context */
  187. {
  188. unsigned char bits[8];
  189. unsigned int count, padLen;
  190. /* Save number of bits */
  191. Encode (bits, context->count, 8);
  192. /* Pad out to 56 mod 64. */
  193. count = (unsigned int)((context->count[0] >> 3) & 0x3f);
  194. padLen = (count < 56) ? (56 - count) : (120 - count);
  195. MD5_Update (context, PADDING, padLen);
  196. /* Append length (before padding) */
  197. MD5_Update (context, bits, 8);
  198. /* Store state in digest */
  199. Encode (digest, context->state, 16);
  200. /* Zeroize sensitive information. */
  201. memset ((void *)context, 0, sizeof (*context));
  202. }
  203. /* MD5 basic transformation. Transforms state based on block. */
  204. static void MD5Transform(UINT4 state[4],
  205. const unsigned char block[64])
  206. {
  207. UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
  208. Decode (x, block, 64);
  209. /* Round 1 */
  210. FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
  211. FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
  212. FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
  213. FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
  214. FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
  215. FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
  216. FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
  217. FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
  218. FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
  219. FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
  220. FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
  221. FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
  222. FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
  223. FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
  224. FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
  225. FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
  226. /* Round 2 */
  227. GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
  228. GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
  229. GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
  230. GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
  231. GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
  232. GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
  233. GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
  234. GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
  235. GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
  236. GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
  237. GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
  238. GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
  239. GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
  240. GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
  241. GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
  242. GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
  243. /* Round 3 */
  244. HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
  245. HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
  246. HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
  247. HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
  248. HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
  249. HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
  250. HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
  251. HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
  252. HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
  253. HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
  254. HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
  255. HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
  256. HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
  257. HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
  258. HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
  259. HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
  260. /* Round 4 */
  261. II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
  262. II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
  263. II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
  264. II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
  265. II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
  266. II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
  267. II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
  268. II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
  269. II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
  270. II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
  271. II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
  272. II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
  273. II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
  274. II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
  275. II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
  276. II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
  277. state[0] += a;
  278. state[1] += b;
  279. state[2] += c;
  280. state[3] += d;
  281. /* Zeroize sensitive information. */
  282. memset((void *)x, 0, sizeof (x));
  283. }
  284. /* Encodes input (UINT4) into output (unsigned char). Assumes len is
  285. a multiple of 4.
  286. */
  287. static void Encode (unsigned char *output,
  288. UINT4 *input,
  289. unsigned int len)
  290. {
  291. unsigned int i, j;
  292. for(i = 0, j = 0; j < len; i++, j += 4) {
  293. output[j] = (unsigned char)(input[i] & 0xff);
  294. output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
  295. output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
  296. output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
  297. }
  298. }
  299. /* Decodes input (unsigned char) into output (UINT4). Assumes len is
  300. a multiple of 4.
  301. */
  302. static void Decode (UINT4 *output,
  303. const unsigned char *input,
  304. unsigned int len)
  305. {
  306. unsigned int i, j;
  307. for(i = 0, j = 0; j < len; i++, j += 4)
  308. output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
  309. (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
  310. }
  311. #endif /* USE_SSLEAY */
  312. #endif /* USE_GNUTLS */
  313. const HMAC_params Curl_HMAC_MD5[] = {
  314. {
  315. (HMAC_hinit_func) MD5_Init, /* Hash initialization function. */
  316. (HMAC_hupdate_func) MD5_Update, /* Hash update function. */
  317. (HMAC_hfinal_func) MD5_Final, /* Hash computation end function. */
  318. sizeof(MD5_CTX), /* Size of hash context structure. */
  319. 64, /* Maximum key length. */
  320. 16 /* Result size. */
  321. }
  322. };
  323. void Curl_md5it(unsigned char *outbuffer, /* 16 bytes */
  324. const unsigned char *input)
  325. {
  326. MD5_CTX ctx;
  327. MD5_Init(&ctx);
  328. MD5_Update(&ctx, input, (unsigned int)strlen((char *)input));
  329. MD5_Final(outbuffer, &ctx);
  330. }
  331. #endif /* CURL_DISABLE_CRYPTO_AUTH */