纽威
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

214 lines
9.0 KiB

3 years ago
  1. /**
  2. * jQuery MD5 hash algorithm function
  3. *
  4. * <code>
  5. * Calculate the md5 hash of a String
  6. * String $.md5 ( String str )
  7. * </code>
  8. *
  9. * Calculates the MD5 hash of str using the » RSA Data Security, Inc. MD5 Message-Digest Algorithm, and returns that hash.
  10. * MD5 (Message-Digest algorithm 5) is a widely-used cryptographic hash function with a 128-bit hash value. MD5 has been employed in a wide variety of security applications, and is also commonly used to check the integrity of data. The generated hash is also non-reversable. Data cannot be retrieved from the message digest, the digest uniquely identifies the data.
  11. * MD5 was developed by Professor Ronald L. Rivest in 1994. Its 128 bit (16 byte) message digest makes it a faster implementation than SHA-1.
  12. * This script is used to process a variable length message into a fixed-length output of 128 bits using the MD5 algorithm. It is fully compatible with UTF-8 encoding. It is very useful when u want to transfer encrypted passwords over the internet. If you plan using UTF-8 encoding in your project don't forget to set the page encoding to UTF-8 (Content-Type meta tag).
  13. * This function orginally get from the WebToolkit and rewrite for using as the jQuery plugin.
  14. *
  15. * Example
  16. * Code
  17. * <code>
  18. * $.md5("I'm Persian.");
  19. * </code>
  20. * Result
  21. * <code>
  22. * "b8c901d0f02223f9761016cfff9d68df"
  23. * </code>
  24. *
  25. * @alias Muhammad Hussein Fattahizadeh < muhammad [AT] semnanweb [DOT] com >
  26. * @link http://www.semnanweb.com/jquery-plugin/md5.html
  27. * @see http://www.webtoolkit.info/
  28. * @license http://www.gnu.org/licenses/gpl.html [GNU General Public License]
  29. * @param {jQuery} {md5:function(string))
  30. * @return string
  31. */
  32. (function($){
  33. var rotateLeft = function(lValue, iShiftBits) {
  34. return (lValue << iShiftBits) | (lValue >>> (32 - iShiftBits));
  35. }
  36. var addUnsigned = function(lX, lY) {
  37. var lX4, lY4, lX8, lY8, lResult;
  38. lX8 = (lX & 0x80000000);
  39. lY8 = (lY & 0x80000000);
  40. lX4 = (lX & 0x40000000);
  41. lY4 = (lY & 0x40000000);
  42. lResult = (lX & 0x3FFFFFFF) + (lY & 0x3FFFFFFF);
  43. if (lX4 & lY4) return (lResult ^ 0x80000000 ^ lX8 ^ lY8);
  44. if (lX4 | lY4) {
  45. if (lResult & 0x40000000) return (lResult ^ 0xC0000000 ^ lX8 ^ lY8);
  46. else return (lResult ^ 0x40000000 ^ lX8 ^ lY8);
  47. } else {
  48. return (lResult ^ lX8 ^ lY8);
  49. }
  50. }
  51. var F = function(x, y, z) {
  52. return (x & y) | ((~ x) & z);
  53. }
  54. var G = function(x, y, z) {
  55. return (x & z) | (y & (~ z));
  56. }
  57. var H = function(x, y, z) {
  58. return (x ^ y ^ z);
  59. }
  60. var I = function(x, y, z) {
  61. return (y ^ (x | (~ z)));
  62. }
  63. var FF = function(a, b, c, d, x, s, ac) {
  64. a = addUnsigned(a, addUnsigned(addUnsigned(F(b, c, d), x), ac));
  65. return addUnsigned(rotateLeft(a, s), b);
  66. };
  67. var GG = function(a, b, c, d, x, s, ac) {
  68. a = addUnsigned(a, addUnsigned(addUnsigned(G(b, c, d), x), ac));
  69. return addUnsigned(rotateLeft(a, s), b);
  70. };
  71. var HH = function(a, b, c, d, x, s, ac) {
  72. a = addUnsigned(a, addUnsigned(addUnsigned(H(b, c, d), x), ac));
  73. return addUnsigned(rotateLeft(a, s), b);
  74. };
  75. var II = function(a, b, c, d, x, s, ac) {
  76. a = addUnsigned(a, addUnsigned(addUnsigned(I(b, c, d), x), ac));
  77. return addUnsigned(rotateLeft(a, s), b);
  78. };
  79. var convertToWordArray = function(string) {
  80. var lWordCount;
  81. var lMessageLength = string.length;
  82. var lNumberOfWordsTempOne = lMessageLength + 8;
  83. var lNumberOfWordsTempTwo = (lNumberOfWordsTempOne - (lNumberOfWordsTempOne % 64)) / 64;
  84. var lNumberOfWords = (lNumberOfWordsTempTwo + 1) * 16;
  85. var lWordArray = Array(lNumberOfWords - 1);
  86. var lBytePosition = 0;
  87. var lByteCount = 0;
  88. while (lByteCount < lMessageLength) {
  89. lWordCount = (lByteCount - (lByteCount % 4)) / 4;
  90. lBytePosition = (lByteCount % 4) * 8;
  91. lWordArray[lWordCount] = (lWordArray[lWordCount] | (string.charCodeAt(lByteCount) << lBytePosition));
  92. lByteCount++;
  93. }
  94. lWordCount = (lByteCount - (lByteCount % 4)) / 4;
  95. lBytePosition = (lByteCount % 4) * 8;
  96. lWordArray[lWordCount] = lWordArray[lWordCount] | (0x80 << lBytePosition);
  97. lWordArray[lNumberOfWords - 2] = lMessageLength << 3;
  98. lWordArray[lNumberOfWords - 1] = lMessageLength >>> 29;
  99. return lWordArray;
  100. };
  101. var wordToHex = function(lValue) {
  102. var WordToHexValue = "", WordToHexValueTemp = "", lByte, lCount;
  103. for (lCount = 0; lCount <= 3; lCount++) {
  104. lByte = (lValue >>> (lCount * 8)) & 255;
  105. WordToHexValueTemp = "0" + lByte.toString(16);
  106. WordToHexValue = WordToHexValue + WordToHexValueTemp.substr(WordToHexValueTemp.length - 2, 2);
  107. }
  108. return WordToHexValue;
  109. };
  110. var uTF8Encode = function(string) {
  111. string = string.replace(/\x0d\x0a/g, "\x0a");
  112. var output = "";
  113. for (var n = 0; n < string.length; n++) {
  114. var c = string.charCodeAt(n);
  115. if (c < 128) {
  116. output += String.fromCharCode(c);
  117. } else if ((c > 127) && (c < 2048)) {
  118. output += String.fromCharCode((c >> 6) | 192);
  119. output += String.fromCharCode((c & 63) | 128);
  120. } else {
  121. output += String.fromCharCode((c >> 12) | 224);
  122. output += String.fromCharCode(((c >> 6) & 63) | 128);
  123. output += String.fromCharCode((c & 63) | 128);
  124. }
  125. }
  126. return output;
  127. };
  128. $.extend({
  129. md5: function(string) {
  130. var x = Array();
  131. var k, AA, BB, CC, DD, a, b, c, d;
  132. var S11=7, S12=12, S13=17, S14=22;
  133. var S21=5, S22=9 , S23=14, S24=20;
  134. var S31=4, S32=11, S33=16, S34=23;
  135. var S41=6, S42=10, S43=15, S44=21;
  136. string = uTF8Encode(string);
  137. x = convertToWordArray(string);
  138. a = 0x67452301; b = 0xEFCDAB89; c = 0x98BADCFE; d = 0x10325476;
  139. for (k = 0; k < x.length; k += 16) {
  140. AA = a; BB = b; CC = c; DD = d;
  141. a = FF(a, b, c, d, x[k+0], S11, 0xD76AA478);
  142. d = FF(d, a, b, c, x[k+1], S12, 0xE8C7B756);
  143. c = FF(c, d, a, b, x[k+2], S13, 0x242070DB);
  144. b = FF(b, c, d, a, x[k+3], S14, 0xC1BDCEEE);
  145. a = FF(a, b, c, d, x[k+4], S11, 0xF57C0FAF);
  146. d = FF(d, a, b, c, x[k+5], S12, 0x4787C62A);
  147. c = FF(c, d, a, b, x[k+6], S13, 0xA8304613);
  148. b = FF(b, c, d, a, x[k+7], S14, 0xFD469501);
  149. a = FF(a, b, c, d, x[k+8], S11, 0x698098D8);
  150. d = FF(d, a, b, c, x[k+9], S12, 0x8B44F7AF);
  151. c = FF(c, d, a, b, x[k+10], S13, 0xFFFF5BB1);
  152. b = FF(b, c, d, a, x[k+11], S14, 0x895CD7BE);
  153. a = FF(a, b, c, d, x[k+12], S11, 0x6B901122);
  154. d = FF(d, a, b, c, x[k+13], S12, 0xFD987193);
  155. c = FF(c, d, a, b, x[k+14], S13, 0xA679438E);
  156. b = FF(b, c, d, a, x[k+15], S14, 0x49B40821);
  157. a = GG(a, b, c, d, x[k+1], S21, 0xF61E2562);
  158. d = GG(d, a, b, c, x[k+6], S22, 0xC040B340);
  159. c = GG(c, d, a, b, x[k+11], S23, 0x265E5A51);
  160. b = GG(b, c, d, a, x[k+0], S24, 0xE9B6C7AA);
  161. a = GG(a, b, c, d, x[k+5], S21, 0xD62F105D);
  162. d = GG(d, a, b, c, x[k+10], S22, 0x2441453);
  163. c = GG(c, d, a, b, x[k+15], S23, 0xD8A1E681);
  164. b = GG(b, c, d, a, x[k+4], S24, 0xE7D3FBC8);
  165. a = GG(a, b, c, d, x[k+9], S21, 0x21E1CDE6);
  166. d = GG(d, a, b, c, x[k+14], S22, 0xC33707D6);
  167. c = GG(c, d, a, b, x[k+3], S23, 0xF4D50D87);
  168. b = GG(b, c, d, a, x[k+8], S24, 0x455A14ED);
  169. a = GG(a, b, c, d, x[k+13], S21, 0xA9E3E905);
  170. d = GG(d, a, b, c, x[k+2], S22, 0xFCEFA3F8);
  171. c = GG(c, d, a, b, x[k+7], S23, 0x676F02D9);
  172. b = GG(b, c, d, a, x[k+12], S24, 0x8D2A4C8A);
  173. a = HH(a, b, c, d, x[k+5], S31, 0xFFFA3942);
  174. d = HH(d, a, b, c, x[k+8], S32, 0x8771F681);
  175. c = HH(c, d, a, b, x[k+11], S33, 0x6D9D6122);
  176. b = HH(b, c, d, a, x[k+14], S34, 0xFDE5380C);
  177. a = HH(a, b, c, d, x[k+1], S31, 0xA4BEEA44);
  178. d = HH(d, a, b, c, x[k+4], S32, 0x4BDECFA9);
  179. c = HH(c, d, a, b, x[k+7], S33, 0xF6BB4B60);
  180. b = HH(b, c, d, a, x[k+10], S34, 0xBEBFBC70);
  181. a = HH(a, b, c, d, x[k+13], S31, 0x289B7EC6);
  182. d = HH(d, a, b, c, x[k+0], S32, 0xEAA127FA);
  183. c = HH(c, d, a, b, x[k+3], S33, 0xD4EF3085);
  184. b = HH(b, c, d, a, x[k+6], S34, 0x4881D05);
  185. a = HH(a, b, c, d, x[k+9], S31, 0xD9D4D039);
  186. d = HH(d, a, b, c, x[k+12], S32, 0xE6DB99E5);
  187. c = HH(c, d, a, b, x[k+15], S33, 0x1FA27CF8);
  188. b = HH(b, c, d, a, x[k+2], S34, 0xC4AC5665);
  189. a = II(a, b, c, d, x[k+0], S41, 0xF4292244);
  190. d = II(d, a, b, c, x[k+7], S42, 0x432AFF97);
  191. c = II(c, d, a, b, x[k+14], S43, 0xAB9423A7);
  192. b = II(b, c, d, a, x[k+5], S44, 0xFC93A039);
  193. a = II(a, b, c, d, x[k+12], S41, 0x655B59C3);
  194. d = II(d, a, b, c, x[k+3], S42, 0x8F0CCC92);
  195. c = II(c, d, a, b, x[k+10], S43, 0xFFEFF47D);
  196. b = II(b, c, d, a, x[k+1], S44, 0x85845DD1);
  197. a = II(a, b, c, d, x[k+8], S41, 0x6FA87E4F);
  198. d = II(d, a, b, c, x[k+15], S42, 0xFE2CE6E0);
  199. c = II(c, d, a, b, x[k+6], S43, 0xA3014314);
  200. b = II(b, c, d, a, x[k+13], S44, 0x4E0811A1);
  201. a = II(a, b, c, d, x[k+4], S41, 0xF7537E82);
  202. d = II(d, a, b, c, x[k+11], S42, 0xBD3AF235);
  203. c = II(c, d, a, b, x[k+2], S43, 0x2AD7D2BB);
  204. b = II(b, c, d, a, x[k+9], S44, 0xEB86D391);
  205. a = addUnsigned(a, AA);
  206. b = addUnsigned(b, BB);
  207. c = addUnsigned(c, CC);
  208. d = addUnsigned(d, DD);
  209. }
  210. var tempValue = wordToHex(a) + wordToHex(b) + wordToHex(c) + wordToHex(d);
  211. return tempValue.toLowerCase();
  212. }
  213. });
  214. })(jQuery);