document.write('
');
document.write('
');
document.write('<script language="javascript" type="text/javascript" runat="server">
');
document.write('/*
');
document.write(' * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined
');
document.write(' * in FIPS PUB 180-1
');
document.write(' * Version 2.1a Copyright Paul Johnston 2000 - 2002.
');
document.write(' * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
');
document.write(' * Distributed under the BSD License
');
document.write(' * See http://pajhome.org.uk/crypt/md5 for details.
');
document.write(' */
');
document.write('
');
document.write('/*
');
document.write(' * Configurable variables. You may need to tweak these to be compatible with
');
document.write(' * the server-side, but the defaults work in most cases.
');
document.write(' */
');
document.write('var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
');
document.write('var b64pad = "="; /* base-64 pad character. "=" for strict RFC compliance */
');
document.write('var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
');
document.write('
');
document.write('/*
');
document.write(' * These are the functions you\'ll usually want to call
');
document.write(' * They take string arguments and return either hex or base-64 encoded strings
');
document.write(' */
');
document.write('function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}
');
document.write('function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}
');
document.write('function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}
');
document.write('function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}
');
document.write('function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}
');
document.write('function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}
');
document.write('
');
document.write('/*
');
document.write(' * Perform a simple self-test to see if the VM is working
');
document.write(' */
');
document.write('function sha1_vm_test()
');
document.write('{
');
document.write(' return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Calculate the SHA-1 of an array of big-endian words, and a bit length
');
document.write(' */
');
document.write('function core_sha1(x, len)
');
document.write('{
');
document.write(' /* append padding */
');
document.write(' x[len >> 5] |= 0x80 << (24 - len % 32);
');
document.write(' x[((len + 64 >> 9) << 4) + 15] = len;
');
document.write('
');
document.write(' var w = Array(80);
');
document.write(' var a = 1732584193;
');
document.write(' var b = -271733879;
');
document.write(' var c = -1732584194;
');
document.write(' var d = 271733878;
');
document.write(' var e = -1009589776;
');
document.write('
');
document.write(' for(var i = 0; i < x.length; i += 16)
');
document.write(' {
');
document.write(' var olda = a;
');
document.write(' var oldb = b;
');
document.write(' var oldc = c;
');
document.write(' var oldd = d;
');
document.write(' var olde = e;
');
document.write('
');
document.write(' for(var j = 0; j < 80; j++)
');
document.write(' {
');
document.write(' if(j < 16) w[j] = x[i + j];
');
document.write(' else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);
');
document.write(' var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),
');
document.write(' safe_add(safe_add(e, w[j]), sha1_kt(j)));
');
document.write(' e = d;
');
document.write(' d = c;
');
document.write(' c = rol(b, 30);
');
document.write(' b = a;
');
document.write(' a = t;
');
document.write(' }
');
document.write('
');
document.write(' a = safe_add(a, olda);
');
document.write(' b = safe_add(b, oldb);
');
document.write(' c = safe_add(c, oldc);
');
document.write(' d = safe_add(d, oldd);
');
document.write(' e = safe_add(e, olde);
');
document.write(' }
');
document.write(' return Array(a, b, c, d, e);
');
document.write('
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Perform the appropriate triplet combination function for the current
');
document.write(' * iteration
');
document.write(' */
');
document.write('function sha1_ft(t, b, c, d)
');
document.write('{
');
document.write(' if(t < 20) return (b & c) | ((~b) & d);
');
document.write(' if(t < 40) return b ^ c ^ d;
');
document.write(' if(t < 60) return (b & c) | (b & d) | (c & d);
');
document.write(' return b ^ c ^ d;
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Determine the appropriate additive constant for the current iteration
');
document.write(' */
');
document.write('function sha1_kt(t)
');
document.write('{
');
document.write(' return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :
');
document.write(' (t < 60) ? -1894007588 : -899497514;
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Calculate the HMAC-SHA1 of a key and some data
');
document.write(' */
');
document.write('function core_hmac_sha1(key, data)
');
document.write('{
');
document.write(' var bkey = str2binb(key);
');
document.write(' if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);
');
document.write('
');
document.write(' var ipad = Array(16), opad = Array(16);
');
document.write(' for(var i = 0; i < 16; i++)
');
document.write(' {
');
document.write(' ipad[i] = bkey[i] ^ 0x36363636;
');
document.write(' opad[i] = bkey[i] ^ 0x5C5C5C5C;
');
document.write(' }
');
document.write('
');
document.write(' var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);
');
document.write(' return core_sha1(opad.concat(hash), 512 + 160);
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Add integers, wrapping at 2^32. This uses 16-bit operations internally
');
document.write(' * to work around bugs in some JS interpreters.
');
document.write(' */
');
document.write('function safe_add(x, y)
');
document.write('{
');
document.write(' var lsw = (x & 0xFFFF) + (y & 0xFFFF);
');
document.write(' var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
');
document.write(' return (msw << 16) | (lsw & 0xFFFF);
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Bitwise rotate a 32-bit number to the left.
');
document.write(' */
');
document.write('function rol(num, cnt)
');
document.write('{
');
document.write(' return (num << cnt) | (num >>> (32 - cnt));
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Convert an 8-bit or 16-bit string to an array of big-endian words
');
document.write(' * In 8-bit function, characters >255 have their hi-byte silently ignored.
');
document.write(' */
');
document.write('function str2binb(str)
');
document.write('{
');
document.write(' var bin = Array();
');
document.write(' var mask = (1 << chrsz) - 1;
');
document.write(' for(var i = 0; i < str.length * chrsz; i += chrsz)
');
document.write(' bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);
');
document.write(' return bin;
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Convert an array of big-endian words to a string
');
document.write(' */
');
document.write('function binb2str(bin)
');
document.write('{
');
document.write(' var str = "";
');
document.write(' var mask = (1 << chrsz) - 1;
');
document.write(' for(var i = 0; i < bin.length * 32; i += chrsz)
');
document.write(' str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);
');
document.write(' return str;
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Convert an array of big-endian words to a hex string.
');
document.write(' */
');
document.write('function binb2hex(binarray)
');
document.write('{
');
document.write(' var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
');
document.write(' var str = "";
');
document.write(' for(var i = 0; i < binarray.length * 4; i++)
');
document.write(' {
');
document.write(' str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +
');
document.write(' hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF);
');
document.write(' }
');
document.write(' return str;
');
document.write('}
');
document.write('
');
document.write('/*
');
document.write(' * Convert an array of big-endian words to a base-64 string
');
document.write(' */
');
document.write('function binb2b64(binarray)
');
document.write('{
');
document.write(' var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
');
document.write(' var str = "";
');
document.write(' for(var i = 0; i < binarray.length * 4; i += 3)
');
document.write(' {
');
document.write(' var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16)
');
document.write(' | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )
');
document.write(' | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);
');
document.write(' for(var j = 0; j < 4; j++)
');
document.write(' {
');
document.write(' if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
');
document.write(' else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
');
document.write(' }
');
document.write(' }
');
document.write(' return str;
');
document.write('}
');
document.write('</script>
');
document.write('
');
document.write('
');
document.write('
');