// NetVision JS - Crypto Utils // (c) 2006-2010 unix-world.org // v.8.1 // r.100114 // CONTAINS: // * UTF-8 :: encode / decode // * Base64 :: encode / decode // * MD5 / SHA1 :: encode //======================================= // CLASS :: UTF-8 :: encode / decode //======================================= var UTF8_Class = new function() { // CLASS START // PUBLIC :: UTF-8 :: encode this.encode = function(string) { var utftext = ""; string = string.replace(/\r\n/g,"\n"); for (var n = 0; n < string.length; n++) { var c = string.charCodeAt(n); if (c < 128) { utftext += String.fromCharCode(c); } else if((c > 127) && (c < 2048)) { utftext += String.fromCharCode((c >> 6) | 192); utftext += String.fromCharCode((c & 63) | 128); } else { utftext += String.fromCharCode((c >> 12) | 224); utftext += String.fromCharCode(((c >> 6) & 63) | 128); utftext += String.fromCharCode((c & 63) | 128); } //end if else } //end for return utftext; } //END FUNCTION //== // PUBLIC :: UTF-8 :: decode this.decode = function(utftext) { var string = ""; var i = 0; var c = c1 = c2 = 0; while ( i < utftext.length ) { c = utftext.charCodeAt(i); if (c < 128) { string += String.fromCharCode(c); i++; } else if((c > 191) && (c < 224)) { c2 = utftext.charCodeAt(i+1); string += String.fromCharCode(((c & 31) << 6) | (c2 & 63)); i += 2; } else { c2 = utftext.charCodeAt(i+1); c3 = utftext.charCodeAt(i+2); string += String.fromCharCode(((c & 15) << 12) | ((c2 & 63) << 6) | (c3 & 63)); i += 3; } //end if else } //end while return string; } //END FUNCTION } //END CLASS //======================================= //======================================= //======================================= // CLASS :: BASE64 :: encode / decode //======================================= var Base64_Class = new function() { // START CLASS // PUBLIC :: BASE64 :: encode this.encode = function(s) { if(base64_core_enc('BASE64 :: JavaScript :: Checksum') == 'QkFTRTY0IDo6IEphdmFTY3JpcHQgOjogQ2hlY2tzdW0=') { return base64_core_enc(s); } else { alert('ERROR: Client JS-VM is NOT COMPATIBLE with Strong Cryptography (B64-Encode) !'); exit(1); } //end if else } //END FUNCTION // PUBLIC :: BASE64 :: decode this.decode = function(s) { if(base64_core_dec('QkFTRTY0IDo6IEphdmFTY3JpcHQgOjogQ2hlY2tzdW0=') == 'BASE64 :: JavaScript :: Checksum') { return base64_core_dec(s); } else { alert('ERROR: Client JS-VM is NOT COMPATIBLE with Strong Cryptography (B64-Decode) !'); exit(1); // die } //end if else } //END FUNCTION //== PRIVATES BASE64 // PRIVATE :: BASE64 :: encode var base64_core_enc = function(input) { //-- encoder var keyStr = base64_key(); var output = ""; var chr1, chr2, chr3; var enc1, enc2, enc3, enc4; var i = 0; //-- do { //-- chr1 = input.charCodeAt(i++); chr2 = input.charCodeAt(i++); chr3 = input.charCodeAt(i++); //-- enc1 = chr1 >> 2; enc2 = ((chr1 & 3) << 4) | (chr2 >> 4); enc3 = ((chr2 & 15) << 2) | (chr3 >> 6); enc4 = chr3 & 63; //-- if (isNaN(chr2)) { enc3 = enc4 = 64; } else if (isNaN(chr3)) { enc4 = 64; } //end if //-- output = output + keyStr.charAt(enc1) + keyStr.charAt(enc2) + keyStr.charAt(enc3) + keyStr.charAt(enc4); //-- } while (i < input.length); //-- return output; //-- } //END FUNCTION // PRIVATE :: BASE64 :: decode var base64_core_dec = function(input) { //-- decoder var keyStr = base64_key(); var output = ""; var chr1, chr2, chr3; var enc1, enc2, enc3, enc4; var i = 0; //-- input = input.replace(/[^A-Za-z0-9\+\/\=]/g, ""); // remove all characters that are not A-Z, a-z, 0-9, +, /, or = //-- do { //-- enc1 = keyStr.indexOf(input.charAt(i++)); enc2 = keyStr.indexOf(input.charAt(i++)); enc3 = keyStr.indexOf(input.charAt(i++)); enc4 = keyStr.indexOf(input.charAt(i++)); //-- chr1 = (enc1 << 2) | (enc2 >> 4); chr2 = ((enc2 & 15) << 4) | (enc3 >> 2); chr3 = ((enc3 & 3) << 6) | enc4; //-- output = output + String.fromCharCode(chr1); //-- if (enc3 != 64) { output = output + String.fromCharCode(chr2); } //end if //-- if (enc4 != 64) { output = output + String.fromCharCode(chr3); } //end if //-- } while (i < input.length); //-- return output; //-- } //END FUNCTION //== // PRIVATE :: BASE64 :: key var base64_key = function() { return "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/="; } //END FUNCTION } //END CLASS //======================================= //======================================= //======================================= // CLASS :: MD5 / SHA1 :: encode //======================================= var SecureHash_Class = new function() { // START CLASS //== PUBLIC MD5 this.md5_crypt = function(s) { if(md5_hex('MD5 :: JavaScript :: Checksum') == '9acf2d72569d39edc9daa30225da5d6e') { return md5_hex(s); } else { alert('WARNING: Client VM is INCOMPATIBLE with Crypto (MD5) !'); exit(1); // die } //end if else } //END FUNCTION //== PUBLIC SHA1 this.sha1_crypt = function(s) { if(sha1_hex('SHA1 :: JavaScript :: Checksum') == '961ba073567e571d451f16ead332d5c9864dc8ca') { return sha1_hex(s); } else { alert('WARNING: Client VM is INCOMPATIBLE with Crypto (SHA1) !'); exit(1); // die } //end if else } //END FUNCTION //== PRIVATES MD5 // PRIVATE :: MD5 :: encrypt (hex) var md5_hex = function(s) { return crypt_binl2hex(md5_core(crypt_str2binl(s), s.length * crypt_chrsz())); } //END FUNCTION // PRIVATE :: MD5 :: core var md5_core = function(x, len) { // append padding x[len >> 5] |= 0x80 << ((len) % 32); x[(((len + 64) >>> 9) << 4) + 14] = len; var a = 1732584193; var b = -271733879; var c = -1732584194; var d = 271733878; for(var i = 0; i < x.length; i += 16) { //-- var olda = a; var oldb = b; var oldc = c; var oldd = d; //-- a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); c = md5_ff(c, d, a, b, x[i+10], 17, -42063); b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329); //-- a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734); //-- a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); c = md5_hh(c, d, a, b, x[i+15], 16, 530742520); b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651); //-- a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551); //-- a = crypt_safe_add(a, olda); b = crypt_safe_add(b, oldb); c = crypt_safe_add(c, oldc); d = crypt_safe_add(d, oldd); //-- } //end for return Array(a, b, c, d); } //END FUNCTION // PRIVATE :: MD5 :: basic operation 0 for the md5 algorithm var md5_cmn = function(q, a, b, x, s, t) { return crypt_safe_add(crypt_bit_rol(crypt_safe_add(crypt_safe_add(a, q), crypt_safe_add(x, t)), s),b); } //END FUNCTION // PRIVATE :: MD5 :: basic operation 1 for the md5 algorithm var md5_ff = function(a, b, c, d, x, s, t) { return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t); } //END FUNCTION // PRIVATE :: MD5 :: basic operation 2 for the md5 algorithm var md5_gg = function(a, b, c, d, x, s, t) { return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t); } //END FUNCTION // PRIVATE :: MD5 :: basic operation 3 for the md5 algorithm var md5_hh = function(a, b, c, d, x, s, t) { return md5_cmn(b ^ c ^ d, a, b, x, s, t); } //END FUNCTION // PRIVATE :: MD5 :: basic operation 4 for the md5 algorithm var md5_ii = function(a, b, c, d, x, s, t) { return md5_cmn(c ^ (b | (~d)), a, b, x, s, t); } //END FUNCTION //== PRIVATES SHA1 // PRIVATE :: SHA1 :: encrypt (hex) var sha1_hex = function(s){ return crypt_binb2hex(sha1_core(crypt_str2binb(s),s.length * crypt_chrsz())); } //END FUNCTION // PRIVATE :: SHA1 :: core var sha1_core = function(x, len) { // append padding x[len >> 5] |= 0x80 << (24 - len % 32); x[((len + 64 >> 9) << 4) + 15] = len; var w = Array(80); var a = 1732584193; var b = -271733879; var c = -1732584194; var d = 271733878; var e = -1009589776; for(var i = 0; i < x.length; i += 16) { //-- var olda = a; var oldb = b; var oldc = c; var oldd = d; var olde = e; //-- for(var j = 0; j < 80; j++) { if(j < 16) { w[j] = x[i + j]; } else { w[j] = crypt_bit_rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1); } //end if else //-- var t = crypt_safe_add(crypt_safe_add(crypt_bit_rol(a, 5), sha1_ft(j, b, c, d)), crypt_safe_add(crypt_safe_add(e, w[j]), sha1_kt(j))); //-- e = d; d = c; c = crypt_bit_rol(b, 30); b = a; a = t; //-- } //end for //-- a = crypt_safe_add(a, olda); b = crypt_safe_add(b, oldb); c = crypt_safe_add(c, oldc); d = crypt_safe_add(d, oldd); e = crypt_safe_add(e, olde); } //end for return Array(a, b, c, d, e); } //END FUNCTION // PRIVATE :: SHA1 :: basic operation 0 for the sha1 algorithm var sha1_ft = function(t, b, c, d) { if(t < 20) { return (b & c) | ((~b) & d); } //end if if(t < 40) { return b ^ c ^ d; } //end if if(t < 60) { return (b & c) | (b & d) | (c & d); } //end if return b ^ c ^ d; } //END FUNCTION // PRIVATE :: SHA1 :: basic operation 1 for the sha1 algorithm var sha1_kt = function(t) { return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514 ; } //END FUNCTION //== PRIVATES CRYPTO // PRIVATE :: CRYPTO :: this function acts as a setting for chrsz var crypt_chrsz = function() { var chrsz = 8; // bits per input character. 8 - ASCII; 16 - Unicode (sync with the other functions) return chrsz ; } //END FUNCTION // PRIVATE :: CRYPTO :: this function acts as a setting for hexcase var crypt_hexcase = function() { var hexcase = 0; // hex output format. 0 - lowercase; 1 - uppercase return hexcase ; } //END FUNCTION // PRIVATE :: CRYPTO :: Add integers, wrapping at 2^32. This uses 16-bit operations internally to work around bugs in some JS interpreters. var crypt_safe_add = function(x, y) { var lsw = (x & 0xFFFF) + (y & 0xFFFF); var msw = (x >> 16) + (y >> 16) + (lsw >> 16); return (msw << 16) | (lsw & 0xFFFF); } //END FUNCTION // PRIVATE :: CRYPTO :: Bitwise rotate a 32-bit number to the left. var crypt_bit_rol = function(num, cnt) { return (num << cnt) | (num >>> (32 - cnt)); } //END FUNCTION // PRIVATE :: CRYPTO :: Convert a string to an Array of little-endian words. If chrsz is ASCII, characters >255 have their hi-byte silently ignored. var crypt_str2binl = function(str) { var bin = Array(); var mask = (1 << crypt_chrsz()) - 1; for(var i = 0; i < str.length * crypt_chrsz(); i += crypt_chrsz()) { bin[i>>5] |= (str.charCodeAt(i / crypt_chrsz()) & mask) << (i%32); } //end for return bin; } //END FUNCTION // PRIVATE :: CRYPTO :: Convert an Array of little-endian words to a string var crypt_binl2str = function(bin) { var str = ""; var mask = (1 << crypt_chrsz()) - 1; for(var i = 0; i < bin.length * 32; i += crypt_chrsz()) { str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask); } //end for return str; } //END FUNCTION // PRIVATE :: CRYPTO :: Convert an Array of little-endian words to a hex string. var crypt_binl2hex = function(binarray) { var tmp_hexcase = 0 + crypt_hexcase(); var hex_tab = tmp_hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) + hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF); } //end for return str; } //END FUNCTION // PRIVATE :: CRYPTO :: Convert an 8-bit or 16-bit string to an Array of big-endian words var crypt_str2binb = function(str) { var bin = Array(); var mask = (1 << crypt_chrsz()) - 1; for(var i = 0; i < str.length * crypt_chrsz(); i += crypt_chrsz()) { bin[i>>5] |= (str.charCodeAt(i / crypt_chrsz()) & mask) << (32 - crypt_chrsz() - i%32); } //end for return bin; } //END FUNCTION // PRIVATE :: CRYPTO :: Convert an Array of big-endian words to a string var crypt_binb2str = function(bin) { var str = ""; var mask = (1 << crypt_chrsz()) - 1; for(var i = 0; i < bin.length * 32; i += crypt_chrsz()) { str += String.fromCharCode((bin[i>>5] >>> (32 - crypt_chrsz() - i%32)) & mask); } //end for return str; } //END FUNCTION // PRIVATE :: CRYPTO :: Convert an Array of big-endian words to a hex string. var crypt_binb2hex = function(binarray) { var tmp_hexcase = 0 + crypt_hexcase(); var hex_tab = tmp_hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; var str = ""; for(var i = 0; i < binarray.length * 4; i++) { str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) + hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF); } //end for return str; } //END FUNCTION } //END CLASS //======================================= //======================================= // #END