1
0

md5c.c 12 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374
  1. /** BEGIN COPYRIGHT BLOCK
  2. * This Program is free software; you can redistribute it and/or modify it under
  3. * the terms of the GNU General Public License as published by the Free Software
  4. * Foundation; version 2 of the License.
  5. *
  6. * This Program is distributed in the hope that it will be useful, but WITHOUT
  7. * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS
  8. * FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.
  9. *
  10. * You should have received a copy of the GNU General Public License along with
  11. * this Program; if not, write to the Free Software Foundation, Inc., 59 Temple
  12. * Place, Suite 330, Boston, MA 02111-1307 USA.
  13. *
  14. * In addition, as a special exception, Red Hat, Inc. gives You the additional
  15. * right to link the code of this Program with code not covered under the GNU
  16. * General Public License ("Non-GPL Code") and to distribute linked combinations
  17. * including the two, subject to the limitations in this paragraph. Non-GPL Code
  18. * permitted under this exception must only link to the code of this Program
  19. * through those well defined interfaces identified in the file named EXCEPTION
  20. * found in the source code files (the "Approved Interfaces"). The files of
  21. * Non-GPL Code may instantiate templates or use macros or inline functions from
  22. * the Approved Interfaces without causing the resulting work to be covered by
  23. * the GNU General Public License. Only Red Hat, Inc. may make changes or
  24. * additions to the list of Approved Interfaces. You must obey the GNU General
  25. * Public License in all respects for all of the Program code and other code used
  26. * in conjunction with the Program except the Non-GPL Code covered by this
  27. * exception. If you modify this file, you may extend this exception to your
  28. * version of the file, but you are not obligated to do so. If you do not wish to
  29. * provide this exception without modification, you must delete this exception
  30. * statement from your version and license this file solely under the GPL without
  31. * exception.
  32. *
  33. *
  34. * Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
  35. * Copyright (C) 2005 Red Hat, Inc.
  36. * All rights reserved.
  37. * END COPYRIGHT BLOCK **/
  38. #ifdef HAVE_CONFIG_H
  39. # include <config.h>
  40. #endif
  41. /* MD5 code taken from reference implementation published in RFC 1321 */
  42. /* MD5C.C - RSA Data Security, Inc., MD5 message-digest algorithm */
  43. /* Copyright (C) 1991-2, RSA Data Security, Inc. Created 1991. All
  44. rights reserved.
  45. License to copy and use this software is granted provided that it
  46. is identified as the "RSA Data Security, Inc. MD5 Message-Digest
  47. Algorithm" in all material mentioning or referencing this software
  48. or this function.
  49. License is also granted to make and use derivative works provided
  50. that such works are identified as "derived from the RSA Data
  51. Security, Inc. MD5 Message-Digest Algorithm" in all material
  52. mentioning or referencing the derived work.
  53. RSA Data Security, Inc. makes no representations concerning either
  54. the merchantability of this software or the suitability of this
  55. software for any particular purpose. It is provided "as is"
  56. without express or implied warranty of any kind.
  57. These notices must be retained in any copies of any part of this
  58. documentation and/or software.
  59. */
  60. #include "md5.h"
  61. /* Constants for MD5Transform routine. */
  62. #define S11 7
  63. #define S12 12
  64. #define S13 17
  65. #define S14 22
  66. #define S21 5
  67. #define S22 9
  68. #define S23 14
  69. #define S24 20
  70. #define S31 4
  71. #define S32 11
  72. #define S33 16
  73. #define S34 23
  74. #define S41 6
  75. #define S42 10
  76. #define S43 15
  77. #define S44 21
  78. static void MD5Transform (UINT4 [4], const unsigned char [64]);
  79. static void Encode (unsigned char *, const UINT4 *, unsigned int);
  80. static void Decode (UINT4 *, const unsigned char *, unsigned int);
  81. static void MD5_memcpy (POINTER, const POINTER, unsigned int);
  82. static void MD5_memset (POINTER, int, unsigned int);
  83. static unsigned char PADDING[64] = {
  84. 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  85. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
  86. 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0
  87. };
  88. /* F, G, H and I are basic MD5 functions.
  89. */
  90. #define F(x, y, z) (((x) & (y)) | ((~(x)) & (z)))
  91. #define G(x, y, z) (((x) & (z)) | ((y) & (~(z))))
  92. #define H(x, y, z) ((x) ^ (y) ^ (z))
  93. #define I(x, y, z) ((y) ^ ((x) | (~(z))))
  94. /* ROTATE_LEFT rotates x left n bits.
  95. */
  96. #define ROTATE_LEFT(x, n) (((x) << (n)) | ((x) >> (32-(n))))
  97. /* FF, GG, HH, and II transformations for rounds 1, 2, 3, and 4.
  98. Rotation is separate from addition to prevent recomputation.
  99. */
  100. #define FF(a, b, c, d, x, s, ac) { \
  101. (a) += F ((b), (c), (d)) + (x) + (UINT4)(ac); \
  102. (a) = ROTATE_LEFT ((a), (s)); \
  103. (a) += (b); \
  104. }
  105. #define GG(a, b, c, d, x, s, ac) { \
  106. (a) += G ((b), (c), (d)) + (x) + (UINT4)(ac); \
  107. (a) = ROTATE_LEFT ((a), (s)); \
  108. (a) += (b); \
  109. }
  110. #define HH(a, b, c, d, x, s, ac) { \
  111. (a) += H ((b), (c), (d)) + (x) + (UINT4)(ac); \
  112. (a) = ROTATE_LEFT ((a), (s)); \
  113. (a) += (b); \
  114. }
  115. #define II(a, b, c, d, x, s, ac) { \
  116. (a) += I ((b), (c), (d)) + (x) + (UINT4)(ac); \
  117. (a) = ROTATE_LEFT ((a), (s)); \
  118. (a) += (b); \
  119. }
  120. /* MD5 initialization. Begins an MD5 operation, writing a new context.
  121. */
  122. void mta_MD5Init (context)
  123. mta_MD5_CTX *context; /* context */
  124. {
  125. context->count[0] = context->count[1] = 0;
  126. /* Load magic initialization constants.
  127. */
  128. context->state[0] = 0x67452301;
  129. context->state[1] = 0xefcdab89;
  130. context->state[2] = 0x98badcfe;
  131. context->state[3] = 0x10325476;
  132. }
  133. /* MD5 block update operation. Continues an MD5 message-digest
  134. operation, processing another message block, and updating the
  135. context.
  136. */
  137. void mta_MD5Update (context, input, inputLen)
  138. mta_MD5_CTX *context; /* context */
  139. const unsigned char *input; /* input block */
  140. unsigned int inputLen; /* length of input block */
  141. {
  142. unsigned int i, index, partLen;
  143. /* Compute number of bytes mod 64 */
  144. index = (unsigned int)((context->count[0] >> 3) & 0x3F);
  145. /* Update number of bits */
  146. if ((context->count[0] += ((UINT4)inputLen << 3))
  147. < ((UINT4)inputLen << 3))
  148. context->count[1]++;
  149. context->count[1] += ((UINT4)inputLen >> 29);
  150. partLen = 64 - index;
  151. /* Transform as many times as possible.
  152. */
  153. if (inputLen >= partLen) {
  154. MD5_memcpy
  155. ((POINTER)&context->buffer[index], (POINTER)input, partLen);
  156. MD5Transform (context->state, context->buffer);
  157. for (i = partLen; i + 63 < inputLen; i += 64)
  158. MD5Transform (context->state, &input[i]);
  159. index = 0;
  160. }
  161. else
  162. i = 0;
  163. /* Buffer remaining input */
  164. MD5_memcpy
  165. ((POINTER)&context->buffer[index], (POINTER)&input[i],
  166. inputLen-i);
  167. }
  168. /* MD5 finalization. Ends an MD5 message-digest operation, writing the
  169. the message digest and zeroizing the context.
  170. */
  171. void mta_MD5Final (digest, context)
  172. unsigned char digest[16]; /* message digest */
  173. mta_MD5_CTX *context; /* context */
  174. {
  175. unsigned char bits[8];
  176. unsigned int index, padLen;
  177. /* Save number of bits */
  178. Encode (bits, context->count, 8);
  179. /* Pad out to 56 mod 64.
  180. */
  181. index = (unsigned int)((context->count[0] >> 3) & 0x3f);
  182. padLen = (index < 56) ? (56 - index) : (120 - index);
  183. mta_MD5Update (context, PADDING, padLen);
  184. /* Append length (before padding) */
  185. mta_MD5Update (context, bits, 8);
  186. /* Store state in digest */
  187. Encode (digest, context->state, 16);
  188. /* Zeroize sensitive information.
  189. */
  190. MD5_memset ((POINTER)context, 0, sizeof (*context));
  191. }
  192. /* MD5 basic transformation. Transforms state based on block.
  193. */
  194. static void MD5Transform (state, block)
  195. UINT4 state[4];
  196. const unsigned char block[64];
  197. {
  198. UINT4 a = state[0], b = state[1], c = state[2], d = state[3], x[16];
  199. Decode (x, block, 64);
  200. /* Round 1 */
  201. FF (a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
  202. FF (d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
  203. FF (c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
  204. FF (b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
  205. FF (a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
  206. FF (d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
  207. FF (c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
  208. FF (b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
  209. FF (a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
  210. FF (d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
  211. FF (c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
  212. FF (b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
  213. FF (a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
  214. FF (d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
  215. FF (c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
  216. FF (b, c, d, a, x[15], S14, 0x49b40821); /* 16 */
  217. /* Round 2 */
  218. GG (a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
  219. GG (d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
  220. GG (c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
  221. GG (b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
  222. GG (a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
  223. GG (d, a, b, c, x[10], S22, 0x2441453); /* 22 */
  224. GG (c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
  225. GG (b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
  226. GG (a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
  227. GG (d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
  228. GG (c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
  229. GG (b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
  230. GG (a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
  231. GG (d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
  232. GG (c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
  233. GG (b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */
  234. /* Round 3 */
  235. HH (a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
  236. HH (d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
  237. HH (c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
  238. HH (b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
  239. HH (a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
  240. HH (d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
  241. HH (c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
  242. HH (b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
  243. HH (a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
  244. HH (d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
  245. HH (c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
  246. HH (b, c, d, a, x[ 6], S34, 0x4881d05); /* 44 */
  247. HH (a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
  248. HH (d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
  249. HH (c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
  250. HH (b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */
  251. /* Round 4 */
  252. II (a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
  253. II (d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
  254. II (c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
  255. II (b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
  256. II (a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
  257. II (d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
  258. II (c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
  259. II (b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
  260. II (a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
  261. II (d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
  262. II (c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
  263. II (b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
  264. II (a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
  265. II (d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
  266. II (c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
  267. II (b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */
  268. state[0] += a;
  269. state[1] += b;
  270. state[2] += c;
  271. state[3] += d;
  272. /* Zeroize sensitive information.
  273. */
  274. MD5_memset ((POINTER)x, 0, sizeof (x));
  275. }
  276. /* Encodes input (UINT4) into output (unsigned char). Assumes len is
  277. a multiple of 4.
  278. */
  279. static void Encode (output, input, len)
  280. unsigned char *output;
  281. const UINT4 *input;
  282. unsigned int len;
  283. {
  284. unsigned int i, j;
  285. for (i = 0, j = 0; j < len; i++, j += 4) {
  286. output[j] = (unsigned char)(input[i] & 0xff);
  287. output[j+1] = (unsigned char)((input[i] >> 8) & 0xff);
  288. output[j+2] = (unsigned char)((input[i] >> 16) & 0xff);
  289. output[j+3] = (unsigned char)((input[i] >> 24) & 0xff);
  290. }
  291. }
  292. /* Decodes input (unsigned char) into output (UINT4). Assumes len is
  293. a multiple of 4.
  294. */
  295. static void Decode (output, input, len)
  296. UINT4 *output;
  297. const unsigned char *input;
  298. unsigned int len;
  299. {
  300. unsigned int i, j;
  301. for (i = 0, j = 0; j < len; i++, j += 4)
  302. output[i] = ((UINT4)input[j]) | (((UINT4)input[j+1]) << 8) |
  303. (((UINT4)input[j+2]) << 16) | (((UINT4)input[j+3]) << 24);
  304. }
  305. /* Note: Replace "for loop" with standard memcpy if possible.
  306. */
  307. static void MD5_memcpy (output, input, len)
  308. POINTER output;
  309. const POINTER input;
  310. unsigned int len;
  311. {
  312. unsigned int i;
  313. for (i = 0; i < len; i++)
  314. output[i] = input[i];
  315. }
  316. /* Note: Replace "for loop" with standard memset if possible.
  317. */
  318. static void MD5_memset (output, value, len)
  319. POINTER output;
  320. int value;
  321. unsigned int len;
  322. {
  323. unsigned int i;
  324. for (i = 0; i < len; i++)
  325. ((char *)output)[i] = (char)value;
  326. }