| 1 | /*\r |
| 2 | * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined\r |
| 3 | * in FIPS PUB 180-1\r |
| 4 | * Version 2.1a Copyright Paul Johnston 2000 - 2002.\r |
| 5 | * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet\r |
| 6 | * Distributed under the BSD License\r |
| 7 | * See http://pajhome.org.uk/crypt/md5 for details.\r |
| 8 | */\r |
| 9 | \r |
| 10 | /*\r |
| 11 | * Configurable variables. You may need to tweak these to be compatible with\r |
| 12 | * the server-side, but the defaults work in most cases.\r |
| 13 | */\r |
| 14 | var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */\r |
| 15 | var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */\r |
| 16 | var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */\r |
| 17 | \r |
| 18 | /*\r |
| 19 | * These are the functions you'll usually want to call\r |
| 20 | * They take string arguments and return either hex or base-64 encoded strings\r |
| 21 | */\r |
| 22 | function hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));}\r |
| 23 | function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));}\r |
| 24 | function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));}\r |
| 25 | function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));}\r |
| 26 | function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));}\r |
| 27 | function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));}\r |
| 28 | \r |
| 29 | /*\r |
| 30 | * Perform a simple self-test to see if the VM is working\r |
| 31 | */\r |
| 32 | function sha1_vm_test()\r |
| 33 | {\r |
| 34 | return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d";\r |
| 35 | }\r |
| 36 | \r |
| 37 | /*\r |
| 38 | * Calculate the SHA-1 of an array of big-endian words, and a bit length\r |
| 39 | */\r |
| 40 | function core_sha1(x, len)\r |
| 41 | {\r |
| 42 | /* append padding */\r |
| 43 | x[len >> 5] |= 0x80 << (24 - len % 32);\r |
| 44 | x[((len + 64 >> 9) << 4) + 15] = len;\r |
| 45 | \r |
| 46 | var w = Array(80);\r |
| 47 | var a = 1732584193;\r |
| 48 | var b = -271733879;\r |
| 49 | var c = -1732584194;\r |
| 50 | var d = 271733878;\r |
| 51 | var e = -1009589776;\r |
| 52 | \r |
| 53 | for(var i = 0; i < x.length; i += 16)\r |
| 54 | {\r |
| 55 | var olda = a;\r |
| 56 | var oldb = b;\r |
| 57 | var oldc = c;\r |
| 58 | var oldd = d;\r |
| 59 | var olde = e;\r |
| 60 | \r |
| 61 | for(var j = 0; j < 80; j++)\r |
| 62 | {\r |
| 63 | if(j < 16) w[j] = x[i + j];\r |
| 64 | else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1);\r |
| 65 | var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)),\r |
| 66 | safe_add(safe_add(e, w[j]), sha1_kt(j)));\r |
| 67 | e = d;\r |
| 68 | d = c;\r |
| 69 | c = rol(b, 30);\r |
| 70 | b = a;\r |
| 71 | a = t;\r |
| 72 | }\r |
| 73 | \r |
| 74 | a = safe_add(a, olda);\r |
| 75 | b = safe_add(b, oldb);\r |
| 76 | c = safe_add(c, oldc);\r |
| 77 | d = safe_add(d, oldd);\r |
| 78 | e = safe_add(e, olde);\r |
| 79 | }\r |
| 80 | return Array(a, b, c, d, e);\r |
| 81 | \r |
| 82 | }\r |
| 83 | \r |
| 84 | /*\r |
| 85 | * Perform the appropriate triplet combination function for the current\r |
| 86 | * iteration\r |
| 87 | */\r |
| 88 | function sha1_ft(t, b, c, d)\r |
| 89 | {\r |
| 90 | if(t < 20) return (b & c) | ((~b) & d);\r |
| 91 | if(t < 40) return b ^ c ^ d;\r |
| 92 | if(t < 60) return (b & c) | (b & d) | (c & d);\r |
| 93 | return b ^ c ^ d;\r |
| 94 | }\r |
| 95 | \r |
| 96 | /*\r |
| 97 | * Determine the appropriate additive constant for the current iteration\r |
| 98 | */\r |
| 99 | function sha1_kt(t)\r |
| 100 | {\r |
| 101 | return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 :\r |
| 102 | (t < 60) ? -1894007588 : -899497514;\r |
| 103 | }\r |
| 104 | \r |
| 105 | /*\r |
| 106 | * Calculate the HMAC-SHA1 of a key and some data\r |
| 107 | */\r |
| 108 | function core_hmac_sha1(key, data)\r |
| 109 | {\r |
| 110 | var bkey = str2binb(key);\r |
| 111 | if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz);\r |
| 112 | \r |
| 113 | var ipad = Array(16), opad = Array(16);\r |
| 114 | for(var i = 0; i < 16; i++)\r |
| 115 | {\r |
| 116 | ipad[i] = bkey[i] ^ 0x36363636;\r |
| 117 | opad[i] = bkey[i] ^ 0x5C5C5C5C;\r |
| 118 | }\r |
| 119 | \r |
| 120 | var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz);\r |
| 121 | return core_sha1(opad.concat(hash), 512 + 160);\r |
| 122 | }\r |
| 123 | \r |
| 124 | /*\r |
| 125 | * Add integers, wrapping at 2^32. This uses 16-bit operations internally\r |
| 126 | * to work around bugs in some JS interpreters.\r |
| 127 | */\r |
| 128 | function safe_add(x, y)\r |
| 129 | {\r |
| 130 | var lsw = (x & 0xFFFF) + (y & 0xFFFF);\r |
| 131 | var msw = (x >> 16) + (y >> 16) + (lsw >> 16);\r |
| 132 | return (msw << 16) | (lsw & 0xFFFF);\r |
| 133 | }\r |
| 134 | \r |
| 135 | /*\r |
| 136 | * Bitwise rotate a 32-bit number to the left.\r |
| 137 | */\r |
| 138 | function rol(num, cnt)\r |
| 139 | {\r |
| 140 | return (num << cnt) | (num >>> (32 - cnt));\r |
| 141 | }\r |
| 142 | \r |
| 143 | /*\r |
| 144 | * Convert an 8-bit or 16-bit string to an array of big-endian words\r |
| 145 | * In 8-bit function, characters >255 have their hi-byte silently ignored.\r |
| 146 | */\r |
| 147 | function str2binb(str)\r |
| 148 | {\r |
| 149 | var bin = Array();\r |
| 150 | var mask = (1 << chrsz) - 1;\r |
| 151 | for(var i = 0; i < str.length * chrsz; i += chrsz)\r |
| 152 | bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32);\r |
| 153 | return bin;\r |
| 154 | }\r |
| 155 | \r |
| 156 | /*\r |
| 157 | * Convert an array of big-endian words to a string\r |
| 158 | */\r |
| 159 | function binb2str(bin)\r |
| 160 | {\r |
| 161 | var str = "";\r |
| 162 | var mask = (1 << chrsz) - 1;\r |
| 163 | for(var i = 0; i < bin.length * 32; i += chrsz)\r |
| 164 | str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask);\r |
| 165 | return str;\r |
| 166 | }\r |
| 167 | \r |
| 168 | /*\r |
| 169 | * Convert an array of big-endian words to a hex string.\r |
| 170 | */\r |
| 171 | function binb2hex(binarray)\r |
| 172 | {\r |
| 173 | var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";\r |
| 174 | var str = "";\r |
| 175 | for(var i = 0; i < binarray.length * 4; i++)\r |
| 176 | {\r |
| 177 | str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) +\r |
| 178 | hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF);\r |
| 179 | }\r |
| 180 | return str;\r |
| 181 | }\r |
| 182 | \r |
| 183 | /*\r |
| 184 | * Convert an array of big-endian words to a base-64 string\r |
| 185 | */\r |
| 186 | function binb2b64(binarray)\r |
| 187 | {\r |
| 188 | var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";\r |
| 189 | var str = "";\r |
| 190 | for(var i = 0; i < binarray.length * 4; i += 3)\r |
| 191 | {\r |
| 192 | var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16)\r |
| 193 | | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 )\r |
| 194 | | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF);\r |
| 195 | for(var j = 0; j < 4; j++)\r |
| 196 | {\r |
| 197 | if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;\r |
| 198 | else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);\r |
| 199 | }\r |
| 200 | }\r |
| 201 | return str;\r |
| 202 | }\r |