0b965591-0aa1-48c9-8e0d-2849f4dace51.js 8.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286
  1. "use strict";
  2. cc._RF.push(module, '0b965WRCqFIyY4NKEn02s5R', 'md5');
  3. // common-plugin/Scripts/md5.js
  4. "use strict";
  5. /*
  6. * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
  7. * Digest Algorithm, as defined in RFC 1321.
  8. * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
  9. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  10. * Distributed under the BSD License
  11. * See http://pajhome.org.uk/crypt/md5 for more info.
  12. */
  13. /*
  14. * Configurable variables. You may need to tweak these to be compatible with
  15. * the server-side, but the defaults work in most cases.
  16. */
  17. var hexcase = 0;
  18. /* hex output format. 0 - lowercase; 1 - uppercase */
  19. var b64pad = "";
  20. /* base-64 pad character. "=" for strict RFC compliance */
  21. var chrsz = 8;
  22. /* bits per input character. 8 - ASCII; 16 - Unicode */
  23. /*
  24. * These are the functions you'll usually want to call
  25. * They take string arguments and return either hex or base-64 encoded strings
  26. */
  27. function hex_md5(s) {
  28. return binl2hex(core_md5(str2binl(s), s.length * chrsz));
  29. }
  30. function b64_md5(s) {
  31. return binl2b64(core_md5(str2binl(s), s.length * chrsz));
  32. }
  33. function str_md5(s) {
  34. return binl2str(core_md5(str2binl(s), s.length * chrsz));
  35. }
  36. function hex_hmac_md5(key, data) {
  37. return binl2hex(core_hmac_md5(key, data));
  38. }
  39. function b64_hmac_md5(key, data) {
  40. return binl2b64(core_hmac_md5(key, data));
  41. }
  42. function str_hmac_md5(key, data) {
  43. return binl2str(core_hmac_md5(key, data));
  44. }
  45. /*
  46. * Perform a simple self-test to see if the VM is working
  47. */
  48. function md5_vm_test() {
  49. return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
  50. }
  51. /*
  52. * Calculate the MD5 of an array of little-endian words, and a bit length
  53. */
  54. function core_md5(x, len) {
  55. /* append padding */
  56. x[len >> 5] |= 0x80 << len % 32;
  57. x[(len + 64 >>> 9 << 4) + 14] = len;
  58. var a = 1732584193;
  59. var b = -271733879;
  60. var c = -1732584194;
  61. var d = 271733878;
  62. for (var i = 0; i < x.length; i += 16) {
  63. var olda = a;
  64. var oldb = b;
  65. var oldc = c;
  66. var oldd = d;
  67. a = md5_ff(a, b, c, d, x[i + 0], 7, -680876936);
  68. d = md5_ff(d, a, b, c, x[i + 1], 12, -389564586);
  69. c = md5_ff(c, d, a, b, x[i + 2], 17, 606105819);
  70. b = md5_ff(b, c, d, a, x[i + 3], 22, -1044525330);
  71. a = md5_ff(a, b, c, d, x[i + 4], 7, -176418897);
  72. d = md5_ff(d, a, b, c, x[i + 5], 12, 1200080426);
  73. c = md5_ff(c, d, a, b, x[i + 6], 17, -1473231341);
  74. b = md5_ff(b, c, d, a, x[i + 7], 22, -45705983);
  75. a = md5_ff(a, b, c, d, x[i + 8], 7, 1770035416);
  76. d = md5_ff(d, a, b, c, x[i + 9], 12, -1958414417);
  77. c = md5_ff(c, d, a, b, x[i + 10], 17, -42063);
  78. b = md5_ff(b, c, d, a, x[i + 11], 22, -1990404162);
  79. a = md5_ff(a, b, c, d, x[i + 12], 7, 1804603682);
  80. d = md5_ff(d, a, b, c, x[i + 13], 12, -40341101);
  81. c = md5_ff(c, d, a, b, x[i + 14], 17, -1502002290);
  82. b = md5_ff(b, c, d, a, x[i + 15], 22, 1236535329);
  83. a = md5_gg(a, b, c, d, x[i + 1], 5, -165796510);
  84. d = md5_gg(d, a, b, c, x[i + 6], 9, -1069501632);
  85. c = md5_gg(c, d, a, b, x[i + 11], 14, 643717713);
  86. b = md5_gg(b, c, d, a, x[i + 0], 20, -373897302);
  87. a = md5_gg(a, b, c, d, x[i + 5], 5, -701558691);
  88. d = md5_gg(d, a, b, c, x[i + 10], 9, 38016083);
  89. c = md5_gg(c, d, a, b, x[i + 15], 14, -660478335);
  90. b = md5_gg(b, c, d, a, x[i + 4], 20, -405537848);
  91. a = md5_gg(a, b, c, d, x[i + 9], 5, 568446438);
  92. d = md5_gg(d, a, b, c, x[i + 14], 9, -1019803690);
  93. c = md5_gg(c, d, a, b, x[i + 3], 14, -187363961);
  94. b = md5_gg(b, c, d, a, x[i + 8], 20, 1163531501);
  95. a = md5_gg(a, b, c, d, x[i + 13], 5, -1444681467);
  96. d = md5_gg(d, a, b, c, x[i + 2], 9, -51403784);
  97. c = md5_gg(c, d, a, b, x[i + 7], 14, 1735328473);
  98. b = md5_gg(b, c, d, a, x[i + 12], 20, -1926607734);
  99. a = md5_hh(a, b, c, d, x[i + 5], 4, -378558);
  100. d = md5_hh(d, a, b, c, x[i + 8], 11, -2022574463);
  101. c = md5_hh(c, d, a, b, x[i + 11], 16, 1839030562);
  102. b = md5_hh(b, c, d, a, x[i + 14], 23, -35309556);
  103. a = md5_hh(a, b, c, d, x[i + 1], 4, -1530992060);
  104. d = md5_hh(d, a, b, c, x[i + 4], 11, 1272893353);
  105. c = md5_hh(c, d, a, b, x[i + 7], 16, -155497632);
  106. b = md5_hh(b, c, d, a, x[i + 10], 23, -1094730640);
  107. a = md5_hh(a, b, c, d, x[i + 13], 4, 681279174);
  108. d = md5_hh(d, a, b, c, x[i + 0], 11, -358537222);
  109. c = md5_hh(c, d, a, b, x[i + 3], 16, -722521979);
  110. b = md5_hh(b, c, d, a, x[i + 6], 23, 76029189);
  111. a = md5_hh(a, b, c, d, x[i + 9], 4, -640364487);
  112. d = md5_hh(d, a, b, c, x[i + 12], 11, -421815835);
  113. c = md5_hh(c, d, a, b, x[i + 15], 16, 530742520);
  114. b = md5_hh(b, c, d, a, x[i + 2], 23, -995338651);
  115. a = md5_ii(a, b, c, d, x[i + 0], 6, -198630844);
  116. d = md5_ii(d, a, b, c, x[i + 7], 10, 1126891415);
  117. c = md5_ii(c, d, a, b, x[i + 14], 15, -1416354905);
  118. b = md5_ii(b, c, d, a, x[i + 5], 21, -57434055);
  119. a = md5_ii(a, b, c, d, x[i + 12], 6, 1700485571);
  120. d = md5_ii(d, a, b, c, x[i + 3], 10, -1894986606);
  121. c = md5_ii(c, d, a, b, x[i + 10], 15, -1051523);
  122. b = md5_ii(b, c, d, a, x[i + 1], 21, -2054922799);
  123. a = md5_ii(a, b, c, d, x[i + 8], 6, 1873313359);
  124. d = md5_ii(d, a, b, c, x[i + 15], 10, -30611744);
  125. c = md5_ii(c, d, a, b, x[i + 6], 15, -1560198380);
  126. b = md5_ii(b, c, d, a, x[i + 13], 21, 1309151649);
  127. a = md5_ii(a, b, c, d, x[i + 4], 6, -145523070);
  128. d = md5_ii(d, a, b, c, x[i + 11], 10, -1120210379);
  129. c = md5_ii(c, d, a, b, x[i + 2], 15, 718787259);
  130. b = md5_ii(b, c, d, a, x[i + 9], 21, -343485551);
  131. a = safe_add(a, olda);
  132. b = safe_add(b, oldb);
  133. c = safe_add(c, oldc);
  134. d = safe_add(d, oldd);
  135. }
  136. return Array(a, b, c, d);
  137. }
  138. /*
  139. * These functions implement the four basic operations the algorithm uses.
  140. */
  141. function md5_cmn(q, a, b, x, s, t) {
  142. return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b);
  143. }
  144. function md5_ff(a, b, c, d, x, s, t) {
  145. return md5_cmn(b & c | ~b & d, a, b, x, s, t);
  146. }
  147. function md5_gg(a, b, c, d, x, s, t) {
  148. return md5_cmn(b & d | c & ~d, a, b, x, s, t);
  149. }
  150. function md5_hh(a, b, c, d, x, s, t) {
  151. return md5_cmn(b ^ c ^ d, a, b, x, s, t);
  152. }
  153. function md5_ii(a, b, c, d, x, s, t) {
  154. return md5_cmn(c ^ (b | ~d), a, b, x, s, t);
  155. }
  156. /*
  157. * Calculate the HMAC-MD5, of a key and some data
  158. */
  159. function core_hmac_md5(key, data) {
  160. var bkey = str2binl(key);
  161. if (bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
  162. var ipad = Array(16),
  163. opad = Array(16);
  164. for (var i = 0; i < 16; i++) {
  165. ipad[i] = bkey[i] ^ 0x36363636;
  166. opad[i] = bkey[i] ^ 0x5C5C5C5C;
  167. }
  168. var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
  169. return core_md5(opad.concat(hash), 512 + 128);
  170. }
  171. /*
  172. * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  173. * to work around bugs in some JS interpreters.
  174. */
  175. function safe_add(x, y) {
  176. var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  177. var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  178. return msw << 16 | lsw & 0xFFFF;
  179. }
  180. /*
  181. * Bitwise rotate a 32-bit number to the left.
  182. */
  183. function bit_rol(num, cnt) {
  184. return num << cnt | num >>> 32 - cnt;
  185. }
  186. /*
  187. * Convert a string to an array of little-endian words
  188. * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
  189. */
  190. function str2binl(str) {
  191. var bin = Array();
  192. var mask = (1 << chrsz) - 1;
  193. for (var i = 0; i < str.length * chrsz; i += chrsz) {
  194. bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << i % 32;
  195. }
  196. return bin;
  197. }
  198. /*
  199. * Convert an array of little-endian words to a string
  200. */
  201. function binl2str(bin) {
  202. var str = "";
  203. var mask = (1 << chrsz) - 1;
  204. for (var i = 0; i < bin.length * 32; i += chrsz) {
  205. str += String.fromCharCode(bin[i >> 5] >>> i % 32 & mask);
  206. }
  207. return str;
  208. }
  209. /*
  210. * Convert an array of little-endian words to a hex string.
  211. */
  212. function binl2hex(binarray) {
  213. var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  214. var str = "";
  215. for (var i = 0; i < binarray.length * 4; i++) {
  216. str += hex_tab.charAt(binarray[i >> 2] >> i % 4 * 8 + 4 & 0xF) + hex_tab.charAt(binarray[i >> 2] >> i % 4 * 8 & 0xF);
  217. }
  218. return str;
  219. }
  220. /*
  221. * Convert an array of little-endian words to a base-64 string
  222. */
  223. function binl2b64(binarray) {
  224. var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  225. var str = "";
  226. for (var i = 0; i < binarray.length * 4; i += 3) {
  227. var triplet = (binarray[i >> 2] >> 8 * (i % 4) & 0xFF) << 16 | (binarray[i + 1 >> 2] >> 8 * ((i + 1) % 4) & 0xFF) << 8 | binarray[i + 2 >> 2] >> 8 * ((i + 2) % 4) & 0xFF;
  228. for (var j = 0; j < 4; j++) {
  229. if (i * 8 + j * 6 > binarray.length * 32) str += b64pad;else str += tab.charAt(triplet >> 6 * (3 - j) & 0x3F);
  230. }
  231. }
  232. return str;
  233. }
  234. module.exports = hex_md5;
  235. cc._RF.pop();