Du kan inte välja fler än 25 ämnen Ämnen måste starta med en bokstav eller siffra, kan innehålla bindestreck ('-') och vara max 35 tecken långa.

md5.js 12 KiB

2 år sedan
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385
  1. /*
  2. * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
  3. * Digest Algorithm, as defined in RFC 1321.
  4. * Version 2.2 Copyright (C) Paul Johnston 1999 - 2009
  5. * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
  6. * Distributed under the BSD License
  7. * See http://pajhome.org.uk/crypt/md5 for more info.
  8. */
  9. /*
  10. * Configurable variables. You may need to tweak these to be compatible with
  11. * the server-side, but the defaults work in most cases.
  12. */
  13. var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
  14. var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
  15. /*
  16. * These are the functions you'll usually want to call
  17. * They take string arguments and return either hex or base-64 encoded strings
  18. */
  19. function hex_md5(s) { return rstr2hex(rstr_md5(str2rstr_utf8(s))); }
  20. function b64_md5(s) { return rstr2b64(rstr_md5(str2rstr_utf8(s))); }
  21. function any_md5(s, e) { return rstr2any(rstr_md5(str2rstr_utf8(s)), e); }
  22. function hex_hmac_md5(k, d)
  23. { return rstr2hex(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
  24. function b64_hmac_md5(k, d)
  25. { return rstr2b64(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }
  26. function any_hmac_md5(k, d, e)
  27. { return rstr2any(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)), e); }
  28. /*
  29. * Perform a simple self-test to see if the VM is working
  30. */
  31. function md5_vm_test()
  32. {
  33. return hex_md5("abc").toLowerCase() == "900150983cd24fb0d6963f7d28e17f72";
  34. }
  35. /*
  36. * Calculate the MD5 of a raw string
  37. */
  38. function rstr_md5(s)
  39. {
  40. return binl2rstr(binl_md5(rstr2binl(s), s.length * 8));
  41. }
  42. /*
  43. * Calculate the HMAC-MD5, of a key and some data (raw strings)
  44. */
  45. function rstr_hmac_md5(key, data)
  46. {
  47. var bkey = rstr2binl(key);
  48. if(bkey.length > 16) bkey = binl_md5(bkey, key.length * 8);
  49. var ipad = Array(16), opad = Array(16);
  50. for(var i = 0; i < 16; i++)
  51. {
  52. ipad[i] = bkey[i] ^ 0x36363636;
  53. opad[i] = bkey[i] ^ 0x5C5C5C5C;
  54. }
  55. var hash = binl_md5(ipad.concat(rstr2binl(data)), 512 + data.length * 8);
  56. return binl2rstr(binl_md5(opad.concat(hash), 512 + 128));
  57. }
  58. /*
  59. * Convert a raw string to a hex string
  60. */
  61. function rstr2hex(input)
  62. {
  63. try { hexcase } catch(e) { hexcase=0; }
  64. var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  65. var output = "";
  66. var x;
  67. for(var i = 0; i < input.length; i++)
  68. {
  69. x = input.charCodeAt(i);
  70. output += hex_tab.charAt((x >>> 4) & 0x0F)
  71. + hex_tab.charAt( x & 0x0F);
  72. }
  73. return output;
  74. }
  75. /*
  76. * Convert a raw string to a base-64 string
  77. */
  78. function rstr2b64(input)
  79. {
  80. try { b64pad } catch(e) { b64pad=''; }
  81. var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  82. var output = "";
  83. var len = input.length;
  84. for(var i = 0; i < len; i += 3)
  85. {
  86. var triplet = (input.charCodeAt(i) << 16)
  87. | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)
  88. | (i + 2 < len ? input.charCodeAt(i+2) : 0);
  89. for(var j = 0; j < 4; j++)
  90. {
  91. if(i * 8 + j * 6 > input.length * 8) output += b64pad;
  92. else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);
  93. }
  94. }
  95. return output;
  96. }
  97. /*
  98. * Convert a raw string to an arbitrary string encoding
  99. */
  100. function rstr2any(input, encoding)
  101. {
  102. var divisor = encoding.length;
  103. var i, j, q, x, quotient;
  104. /* Convert to an array of 16-bit big-endian values, forming the dividend */
  105. var dividend = Array(Math.ceil(input.length / 2));
  106. for(i = 0; i < dividend.length; i++)
  107. {
  108. dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);
  109. }
  110. /*
  111. * Repeatedly perform a long division. The binary array forms the dividend,
  112. * the length of the encoding is the divisor. Once computed, the quotient
  113. * forms the dividend for the next step. All remainders are stored for later
  114. * use.
  115. */
  116. var full_length = Math.ceil(input.length * 8 /
  117. (Math.log(encoding.length) / Math.log(2)));
  118. var remainders = Array(full_length);
  119. for(j = 0; j < full_length; j++)
  120. {
  121. quotient = Array();
  122. x = 0;
  123. for(i = 0; i < dividend.length; i++)
  124. {
  125. x = (x << 16) + dividend[i];
  126. q = Math.floor(x / divisor);
  127. x -= q * divisor;
  128. if(quotient.length > 0 || q > 0)
  129. quotient[quotient.length] = q;
  130. }
  131. remainders[j] = x;
  132. dividend = quotient;
  133. }
  134. /* Convert the remainders to the output string */
  135. var output = "";
  136. for(i = remainders.length - 1; i >= 0; i--)
  137. output += encoding.charAt(remainders[i]);
  138. return output;
  139. }
  140. /*
  141. * Encode a string as utf-8.
  142. * For efficiency, this assumes the input is valid utf-16.
  143. */
  144. function str2rstr_utf8(input)
  145. {
  146. var output = "";
  147. var i = -1;
  148. var x, y;
  149. while(++i < input.length)
  150. {
  151. /* Decode utf-16 surrogate pairs */
  152. x = input.charCodeAt(i);
  153. y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;
  154. if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)
  155. {
  156. x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);
  157. i++;
  158. }
  159. /* Encode output as utf-8 */
  160. if(x <= 0x7F)
  161. output += String.fromCharCode(x);
  162. else if(x <= 0x7FF)
  163. output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),
  164. 0x80 | ( x & 0x3F));
  165. else if(x <= 0xFFFF)
  166. output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),
  167. 0x80 | ((x >>> 6 ) & 0x3F),
  168. 0x80 | ( x & 0x3F));
  169. else if(x <= 0x1FFFFF)
  170. output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),
  171. 0x80 | ((x >>> 12) & 0x3F),
  172. 0x80 | ((x >>> 6 ) & 0x3F),
  173. 0x80 | ( x & 0x3F));
  174. }
  175. return output;
  176. }
  177. /*
  178. * Encode a string as utf-16
  179. */
  180. function str2rstr_utf16le(input)
  181. {
  182. var output = "";
  183. for(var i = 0; i < input.length; i++)
  184. output += String.fromCharCode( input.charCodeAt(i) & 0xFF,
  185. (input.charCodeAt(i) >>> 8) & 0xFF);
  186. return output;
  187. }
  188. function str2rstr_utf16be(input)
  189. {
  190. var output = "";
  191. for(var i = 0; i < input.length; i++)
  192. output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,
  193. input.charCodeAt(i) & 0xFF);
  194. return output;
  195. }
  196. /*
  197. * Convert a raw string to an array of little-endian words
  198. * Characters >255 have their high-byte silently ignored.
  199. */
  200. function rstr2binl(input)
  201. {
  202. var output = Array(input.length >> 2);
  203. for(var i = 0; i < output.length; i++)
  204. output[i] = 0;
  205. for(var i = 0; i < input.length * 8; i += 8)
  206. output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (i%32);
  207. return output;
  208. }
  209. /*
  210. * Convert an array of little-endian words to a string
  211. */
  212. function binl2rstr(input)
  213. {
  214. var output = "";
  215. for(var i = 0; i < input.length * 32; i += 8)
  216. output += String.fromCharCode((input[i>>5] >>> (i % 32)) & 0xFF);
  217. return output;
  218. }
  219. /*
  220. * Calculate the MD5 of an array of little-endian words, and a bit length.
  221. */
  222. function binl_md5(x, len)
  223. {
  224. /* append padding */
  225. x[len >> 5] |= 0x80 << ((len) % 32);
  226. x[(((len + 64) >>> 9) << 4) + 14] = len;
  227. var a = 1732584193;
  228. var b = -271733879;
  229. var c = -1732584194;
  230. var d = 271733878;
  231. for(var i = 0; i < x.length; i += 16)
  232. {
  233. var olda = a;
  234. var oldb = b;
  235. var oldc = c;
  236. var oldd = d;
  237. a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
  238. d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
  239. c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
  240. b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
  241. a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
  242. d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
  243. c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
  244. b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
  245. a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
  246. d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
  247. c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
  248. b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
  249. a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
  250. d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
  251. c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
  252. b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
  253. a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
  254. d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
  255. c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
  256. b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
  257. a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
  258. d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
  259. c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
  260. b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
  261. a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
  262. d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
  263. c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
  264. b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
  265. a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
  266. d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
  267. c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
  268. b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
  269. a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
  270. d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
  271. c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
  272. b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
  273. a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
  274. d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
  275. c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
  276. b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
  277. a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
  278. d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
  279. c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
  280. b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
  281. a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
  282. d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
  283. c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
  284. b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
  285. a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
  286. d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
  287. c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
  288. b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
  289. a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
  290. d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
  291. c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
  292. b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
  293. a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
  294. d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
  295. c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
  296. b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
  297. a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
  298. d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
  299. c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
  300. b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
  301. a = safe_add(a, olda);
  302. b = safe_add(b, oldb);
  303. c = safe_add(c, oldc);
  304. d = safe_add(d, oldd);
  305. }
  306. return Array(a, b, c, d);
  307. }
  308. /*
  309. * These functions implement the four basic operations the algorithm uses.
  310. */
  311. function md5_cmn(q, a, b, x, s, t)
  312. {
  313. return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
  314. }
  315. function md5_ff(a, b, c, d, x, s, t)
  316. {
  317. return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
  318. }
  319. function md5_gg(a, b, c, d, x, s, t)
  320. {
  321. return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
  322. }
  323. function md5_hh(a, b, c, d, x, s, t)
  324. {
  325. return md5_cmn(b ^ c ^ d, a, b, x, s, t);
  326. }
  327. function md5_ii(a, b, c, d, x, s, t)
  328. {
  329. return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
  330. }
  331. /*
  332. * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  333. * to work around bugs in some JS interpreters.
  334. */
  335. function safe_add(x, y)
  336. {
  337. var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  338. var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  339. return (msw << 16) | (lsw & 0xFFFF);
  340. }
  341. /*
  342. * Bitwise rotate a 32-bit number to the left.
  343. */
  344. function bit_rol(num, cnt)
  345. {
  346. return (num << cnt) | (num >>> (32 - cnt));
  347. }
  348. module.exports = {
  349. md5 : function(str){
  350. return hex_md5(str);
  351. }
  352. }