☰

Portable MD5 Lib.

自己用的库, 动态调用。

目前為 2014-07-17 提交的版本，檢視 最新版本。

此腳本不應該直接安裝，它是一個供其他腳本使用的函式庫。欲使用本函式庫，請在腳本 metadata 寫上： // @require https://update.cn-greasyfork.org/scripts/130/10064/Portable%20MD5%20Lib.js 

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