--- /dev/null
+/*\r
+ * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message\r
+ * Digest Algorithm, as defined in RFC 1321.\r
+ * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.\r
+ * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\r
+ * Distributed under the BSD License\r
+ * See http://pajhome.org.uk/crypt/md5 for more info.\r
+ */\r
+\r
+/*\r
+ * Configurable variables. You may need to tweak these to be compatible with\r
+ * the server-side, but the defaults work in most cases.\r
+ */\r
+var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\r
+var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */\r
+var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */\r
+\r
+/*\r
+ * These are the functions you'll usually want to call\r
+ * They take string arguments and return either hex or base-64 encoded strings\r
+ */\r
+function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}\r
+function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}\r
+function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}\r
+function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }\r
+function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }\r
+function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }\r
+\r
+/*\r
+ * Perform a simple self-test to see if the VM is working\r
+ */\r
+function md5_vm_test()\r
+{\r
+ return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";\r
+}\r
+\r
+/*\r
+ * Calculate the MD5 of an array of little-endian words, and a bit length\r
+ */\r
+function core_md5(x, len)\r
+{\r
+ /* append padding */\r
+ x[len >> 5] |= 0x80 << ((len) % 32);\r
+ x[(((len + 64) >>> 9) << 4) + 14] = len;\r
+\r
+ var a = 1732584193;\r
+ var b = -271733879;\r
+ var c = -1732584194;\r
+ var d = 271733878;\r
+\r
+ for(var i = 0; i < x.length; i += 16)\r
+ {\r
+ var olda = a;\r
+ var oldb = b;\r
+ var oldc = c;\r
+ var oldd = d;\r
+\r
+ a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);\r
+ d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);\r
+ c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);\r
+ b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);\r
+ a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);\r
+ d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);\r
+ c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);\r
+ b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);\r
+ a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);\r
+ d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);\r
+ c = md5_ff(c, d, a, b, x[i+10], 17, -42063);\r
+ b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);\r
+ a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);\r
+ d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);\r
+ c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);\r
+ b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);\r
+\r
+ a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);\r
+ d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);\r
+ c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);\r
+ b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);\r
+ a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);\r
+ d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);\r
+ c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);\r
+ b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);\r
+ a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);\r
+ d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);\r
+ c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);\r
+ b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);\r
+ a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);\r
+ d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);\r
+ c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);\r
+ b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);\r
+\r
+ a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);\r
+ d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);\r
+ c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);\r
+ b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);\r
+ a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);\r
+ d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);\r
+ c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);\r
+ b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);\r
+ a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);\r
+ d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);\r
+ c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);\r
+ b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);\r
+ a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);\r
+ d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);\r
+ c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);\r
+ b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);\r
+\r
+ a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);\r
+ d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);\r
+ c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);\r
+ b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);\r
+ a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);\r
+ d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);\r
+ c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);\r
+ b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);\r
+ a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);\r
+ d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);\r
+ c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);\r
+ b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);\r
+ a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);\r
+ d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);\r
+ c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);\r
+ b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);\r
+\r
+ a = safe_add(a, olda);\r
+ b = safe_add(b, oldb);\r
+ c = safe_add(c, oldc);\r
+ d = safe_add(d, oldd);\r
+ }\r
+ return Array(a, b, c, d);\r
+\r
+}\r
+\r
+/*\r
+ * These functions implement the four basic operations the algorithm uses.\r
+ */\r
+function md5_cmn(q, a, b, x, s, t)\r
+{\r
+ return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);\r
+}\r
+function md5_ff(a, b, c, d, x, s, t)\r
+{\r
+ return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);\r
+}\r
+function md5_gg(a, b, c, d, x, s, t)\r
+{\r
+ return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);\r
+}\r
+function md5_hh(a, b, c, d, x, s, t)\r
+{\r
+ return md5_cmn(b ^ c ^ d, a, b, x, s, t);\r
+}\r
+function md5_ii(a, b, c, d, x, s, t)\r
+{\r
+ return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);\r
+}\r
+\r
+/*\r
+ * Calculate the HMAC-MD5, of a key and some data\r
+ */\r
+function core_hmac_md5(key, data)\r
+{\r
+ var bkey = str2binl(key);\r
+ if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);\r
+\r
+ var ipad = Array(16), opad = Array(16);\r
+ for(var i = 0; i < 16; i++)\r
+ {\r
+ ipad[i] = bkey[i] ^ 0x36363636;\r
+ opad[i] = bkey[i] ^ 0x5C5C5C5C;\r
+ }\r
+\r
+ var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);\r
+ return core_md5(opad.concat(hash), 512 + 128);\r
+}\r
+\r
+/*\r
+ * Add integers, wrapping at 2^32. This uses 16-bit operations internally\r
+ * to work around bugs in some JS interpreters.\r
+ */\r
+function safe_add(x, y)\r
+{\r
+ var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r
+ var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r
+ return (msw << 16) | (lsw & 0xFFFF);\r
+}\r
+\r
+/*\r
+ * Bitwise rotate a 32-bit number to the left.\r
+ */\r
+function bit_rol(num, cnt)\r
+{\r
+ return (num << cnt) | (num >>> (32 - cnt));\r
+}\r
+\r
+/*\r
+ * Convert a string to an array of little-endian words\r
+ * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.\r
+ */\r
+function str2binl(str)\r
+{\r
+ var bin = Array();\r
+ var mask = (1 << chrsz) - 1;\r
+ for(var i = 0; i < str.length * chrsz; i += chrsz)\r
+ bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);\r
+ return bin;\r
+}\r
+\r
+/*\r
+ * Convert an array of little-endian words to a string\r
+ */\r
+function binl2str(bin)\r
+{\r
+ var str = "";\r
+ var mask = (1 << chrsz) - 1;\r
+ for(var i = 0; i < bin.length * 32; i += chrsz)\r
+ str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);\r
+ return str;\r
+}\r
+\r
+/*\r
+ * Convert an array of little-endian words to a hex string.\r
+ */\r
+function binl2hex(binarray)\r
+{\r
+ var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";\r
+ var str = "";\r
+ for(var i = 0; i < binarray.length * 4; i++)\r
+ {\r
+ str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +\r
+ hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);\r
+ }\r
+ return str;\r
+}\r
+\r
+/*\r
+ * Convert an array of little-endian words to a base-64 string\r
+ */\r
+function binl2b64(binarray)\r
+{\r
+ var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";\r
+ var str = "";\r
+ for(var i = 0; i < binarray.length * 4; i += 3)\r
+ {\r
+ var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)\r
+ | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )\r
+ | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);\r
+ for(var j = 0; j < 4; j++)\r
+ {\r
+ if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;\r
+ else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);\r
+ }\r
+ }\r
+ return str;\r
+}\r
projects / euphorik.git / blobdiff