5dm-xeh

5dm-xeh-kumi

  1. // ==UserScript==
  2. // @name 5dm-xeh
  3. // @namespace http://tampermonkey.net/
  4. // @version 0.1
  5. // @description 5dm-xeh-kumi
  6. // @author kumi
  7. // @match https://.*
  8. // @icon https://www.google.com/s2/favicons?domain=keylol.com
  9. // @license MIT
  10. // @grant none
  11.  
  12. // ==/UserScript==
  13.  
  14. var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
  15. var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
  16. var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
  17.  
  18. function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
  19. function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
  20. function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}
  21. function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
  22. function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
  23. function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }
  24.  
  25. /*
  26. * Perform a simple self-test to see if the VM is working
  27. */
  28. function md5_vm_test()
  29. {
  30. return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
  31. }
  32.  
  33. /*
  34. * Calculate the MD5 of an array of little-endian words, and a bit length
  35. */
  36. function core_md5(x, len)
  37. {
  38. /* append padding */
  39. x[len >> 5] |= 0x80 << ((len) % 32);
  40. x[(((len + 64) >>> 9) << 4) + 14] = len;
  41.  
  42. var a = 1732584193;
  43. var b = -271733879;
  44. var c = -1732584194;
  45. var d = 271733878;
  46.  
  47. for(var i = 0; i < x.length; i += 16)
  48. {
  49. var olda = a;
  50. var oldb = b;
  51. var oldc = c;
  52. var oldd = d;
  53.  
  54. a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
  55. d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
  56. c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
  57. b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
  58. a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
  59. d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
  60. c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
  61. b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
  62. a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
  63. d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
  64. c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
  65. b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
  66. a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
  67. d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
  68. c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
  69. b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
  70.  
  71. a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
  72. d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
  73. c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
  74. b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
  75. a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
  76. d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
  77. c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
  78. b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
  79. a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
  80. d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
  81. c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
  82. b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
  83. a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
  84. d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
  85. c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
  86. b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
  87.  
  88. a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
  89. d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
  90. c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
  91. b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
  92. a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
  93. d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
  94. c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
  95. b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
  96. a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
  97. d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
  98. c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
  99. b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
  100. a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
  101. d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
  102. c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
  103. b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
  104.  
  105. a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
  106. d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
  107. c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
  108. b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
  109. a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
  110. d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
  111. c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
  112. b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
  113. a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
  114. d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
  115. c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
  116. b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
  117. a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
  118. d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
  119. c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
  120. b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
  121.  
  122. a = safe_add(a, olda);
  123. b = safe_add(b, oldb);
  124. c = safe_add(c, oldc);
  125. d = safe_add(d, oldd);
  126. }
  127. return Array(a, b, c, d);
  128.  
  129. }
  130.  
  131. /*
  132. * These functions implement the four basic operations the algorithm uses.
  133. */
  134. function md5_cmn(q, a, b, x, s, t)
  135. {
  136. return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
  137. }
  138. function md5_ff(a, b, c, d, x, s, t)
  139. {
  140. return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
  141. }
  142. function md5_gg(a, b, c, d, x, s, t)
  143. {
  144. return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
  145. }
  146. function md5_hh(a, b, c, d, x, s, t)
  147. {
  148. return md5_cmn(b ^ c ^ d, a, b, x, s, t);
  149. }
  150. function md5_ii(a, b, c, d, x, s, t)
  151. {
  152. return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
  153. }
  154.  
  155. /*
  156. * Calculate the HMAC-MD5, of a key and some data
  157. */
  158. function core_hmac_md5(key, data)
  159. {
  160. var bkey = str2binl(key);
  161. if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
  162.  
  163. var ipad = Array(16), opad = Array(16);
  164. for(var i = 0; i < 16; i++)
  165. {
  166. ipad[i] = bkey[i] ^ 0x36363636;
  167. opad[i] = bkey[i] ^ 0x5C5C5C5C;
  168. }
  169.  
  170. var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
  171. return core_md5(opad.concat(hash), 512 + 128);
  172. }
  173.  
  174. /*
  175. * Add integers, wrapping at 2^32. This uses 16-bit operations internally
  176. * to work around bugs in some JS interpreters.
  177. */
  178. function safe_add(x, y)
  179. {
  180. var lsw = (x & 0xFFFF) + (y & 0xFFFF);
  181. var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
  182. return (msw << 16) | (lsw & 0xFFFF);
  183. }
  184.  
  185. /*
  186. * Bitwise rotate a 32-bit number to the left.
  187. */
  188. function bit_rol(num, cnt)
  189. {
  190. return (num << cnt) | (num >>> (32 - cnt));
  191. }
  192.  
  193. /*
  194. * Convert a string to an array of little-endian words
  195. * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
  196. */
  197. function str2binl(str)
  198. {
  199. var bin = Array();
  200. var mask = (1 << chrsz) - 1;
  201. for(var i = 0; i < str.length * chrsz; i += chrsz)
  202. bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
  203. return bin;
  204. }
  205.  
  206. /*
  207. * Convert an array of little-endian words to a string
  208. */
  209. function binl2str(bin)
  210. {
  211. var str = "";
  212. var mask = (1 << chrsz) - 1;
  213. for(var i = 0; i < bin.length * 32; i += chrsz)
  214. str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
  215. return str;
  216. }
  217.  
  218. /*
  219. * Convert an array of little-endian words to a hex string.
  220. */
  221. function binl2hex(binarray)
  222. {
  223. var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
  224. var str = "";
  225. for(var i = 0; i < binarray.length * 4; i++)
  226. {
  227. str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
  228. hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
  229. }
  230. return str;
  231. }
  232.  
  233. /*
  234. * Convert an array of little-endian words to a base-64 string
  235. */
  236. function binl2b64(binarray)
  237. {
  238. var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
  239. var str = "";
  240. for(var i = 0; i < binarray.length * 4; i += 3)
  241. {
  242. var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
  243. | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
  244. | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
  245. for(var j = 0; j < 4; j++)
  246. {
  247. if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
  248. else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
  249. }
  250. }
  251. return str;
  252. }