Du kannst nicht mehr als 25 Themen auswählen Themen müssen entweder mit einem Buchstaben oder einer Ziffer beginnen. Sie können Bindestriche („-“) enthalten und bis zu 35 Zeichen lang sein.
 
 
 
 
 
 

280 Zeilen
10 KiB

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