Sat, 03 Jan 2015 20:18:00 +0100
Conditionally enable double key logic according to:
private browsing mode or privacy.thirdparty.isolate preference and
implement in GetCookieStringCommon and FindCookie where it counts...
With some reservations of how to convince FindCookie users to test
condition and pass a nullptr when disabling double key logic.
michael@0 | 1 | <!DOCTYPE html> |
michael@0 | 2 | <head> |
michael@0 | 3 | <!-- |
michael@0 | 4 | Copyright (C) 2007 Apple Inc. All rights reserved. |
michael@0 | 5 | |
michael@0 | 6 | Redistribution and use in source and binary forms, with or without |
michael@0 | 7 | modification, are permitted provided that the following conditions |
michael@0 | 8 | are met: |
michael@0 | 9 | 1. Redistributions of source code must retain the above copyright |
michael@0 | 10 | notice, this list of conditions and the following disclaimer. |
michael@0 | 11 | 2. Redistributions in binary form must reproduce the above copyright |
michael@0 | 12 | notice, this list of conditions and the following disclaimer in the |
michael@0 | 13 | documentation and/or other materials provided with the distribution. |
michael@0 | 14 | |
michael@0 | 15 | THIS SOFTWARE IS PROVIDED BY APPLE COMPUTER, INC. ``AS IS'' AND ANY |
michael@0 | 16 | EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
michael@0 | 17 | IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
michael@0 | 18 | PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE COMPUTER, INC. OR |
michael@0 | 19 | CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
michael@0 | 20 | EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
michael@0 | 21 | PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
michael@0 | 22 | PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
michael@0 | 23 | OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
michael@0 | 24 | (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
michael@0 | 25 | OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
michael@0 | 26 | --> |
michael@0 | 27 | |
michael@0 | 28 | <title>SunSpider crypto-md5</title> |
michael@0 | 29 | |
michael@0 | 30 | </head> |
michael@0 | 31 | |
michael@0 | 32 | <body> |
michael@0 | 33 | <h3>crypto-md5</h3> |
michael@0 | 34 | <div id="console"> |
michael@0 | 35 | </div> |
michael@0 | 36 | |
michael@0 | 37 | <script> |
michael@0 | 38 | |
michael@0 | 39 | var _sunSpiderStartDate = new Date(); |
michael@0 | 40 | |
michael@0 | 41 | /* |
michael@0 | 42 | * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message |
michael@0 | 43 | * Digest Algorithm, as defined in RFC 1321. |
michael@0 | 44 | * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002. |
michael@0 | 45 | * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet |
michael@0 | 46 | * Distributed under the BSD License |
michael@0 | 47 | * See http://pajhome.org.uk/crypt/md5 for more info. |
michael@0 | 48 | */ |
michael@0 | 49 | |
michael@0 | 50 | /* |
michael@0 | 51 | * Configurable variables. You may need to tweak these to be compatible with |
michael@0 | 52 | * the server-side, but the defaults work in most cases. |
michael@0 | 53 | */ |
michael@0 | 54 | var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */ |
michael@0 | 55 | var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */ |
michael@0 | 56 | var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */ |
michael@0 | 57 | |
michael@0 | 58 | /* |
michael@0 | 59 | * These are the functions you'll usually want to call |
michael@0 | 60 | * They take string arguments and return either hex or base-64 encoded strings |
michael@0 | 61 | */ |
michael@0 | 62 | function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));} |
michael@0 | 63 | function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));} |
michael@0 | 64 | function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));} |
michael@0 | 65 | function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); } |
michael@0 | 66 | function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); } |
michael@0 | 67 | function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); } |
michael@0 | 68 | |
michael@0 | 69 | /* |
michael@0 | 70 | * Perform a simple self-test to see if the VM is working |
michael@0 | 71 | */ |
michael@0 | 72 | function md5_vm_test() |
michael@0 | 73 | { |
michael@0 | 74 | return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72"; |
michael@0 | 75 | } |
michael@0 | 76 | |
michael@0 | 77 | /* |
michael@0 | 78 | * Calculate the MD5 of an array of little-endian words, and a bit length |
michael@0 | 79 | */ |
michael@0 | 80 | function core_md5(x, len) |
michael@0 | 81 | { |
michael@0 | 82 | /* append padding */ |
michael@0 | 83 | x[len >> 5] |= 0x80 << ((len) % 32); |
michael@0 | 84 | x[(((len + 64) >>> 9) << 4) + 14] = len; |
michael@0 | 85 | |
michael@0 | 86 | var a = 1732584193; |
michael@0 | 87 | var b = -271733879; |
michael@0 | 88 | var c = -1732584194; |
michael@0 | 89 | var d = 271733878; |
michael@0 | 90 | |
michael@0 | 91 | for(var i = 0; i < x.length; i += 16) |
michael@0 | 92 | { |
michael@0 | 93 | var olda = a; |
michael@0 | 94 | var oldb = b; |
michael@0 | 95 | var oldc = c; |
michael@0 | 96 | var oldd = d; |
michael@0 | 97 | |
michael@0 | 98 | a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); |
michael@0 | 99 | d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); |
michael@0 | 100 | c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); |
michael@0 | 101 | b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); |
michael@0 | 102 | a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); |
michael@0 | 103 | d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); |
michael@0 | 104 | c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); |
michael@0 | 105 | b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); |
michael@0 | 106 | a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); |
michael@0 | 107 | d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); |
michael@0 | 108 | c = md5_ff(c, d, a, b, x[i+10], 17, -42063); |
michael@0 | 109 | b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); |
michael@0 | 110 | a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); |
michael@0 | 111 | d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); |
michael@0 | 112 | c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); |
michael@0 | 113 | b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329); |
michael@0 | 114 | |
michael@0 | 115 | a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); |
michael@0 | 116 | d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); |
michael@0 | 117 | c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); |
michael@0 | 118 | b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); |
michael@0 | 119 | a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); |
michael@0 | 120 | d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); |
michael@0 | 121 | c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); |
michael@0 | 122 | b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); |
michael@0 | 123 | a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); |
michael@0 | 124 | d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); |
michael@0 | 125 | c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); |
michael@0 | 126 | b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); |
michael@0 | 127 | a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); |
michael@0 | 128 | d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); |
michael@0 | 129 | c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); |
michael@0 | 130 | b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734); |
michael@0 | 131 | |
michael@0 | 132 | a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); |
michael@0 | 133 | d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); |
michael@0 | 134 | c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); |
michael@0 | 135 | b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); |
michael@0 | 136 | a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); |
michael@0 | 137 | d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); |
michael@0 | 138 | c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); |
michael@0 | 139 | b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); |
michael@0 | 140 | a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); |
michael@0 | 141 | d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); |
michael@0 | 142 | c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); |
michael@0 | 143 | b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); |
michael@0 | 144 | a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); |
michael@0 | 145 | d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); |
michael@0 | 146 | c = md5_hh(c, d, a, b, x[i+15], 16, 530742520); |
michael@0 | 147 | b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651); |
michael@0 | 148 | |
michael@0 | 149 | a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); |
michael@0 | 150 | d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); |
michael@0 | 151 | c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); |
michael@0 | 152 | b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); |
michael@0 | 153 | a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); |
michael@0 | 154 | d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); |
michael@0 | 155 | c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); |
michael@0 | 156 | b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); |
michael@0 | 157 | a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); |
michael@0 | 158 | d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); |
michael@0 | 159 | c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); |
michael@0 | 160 | b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); |
michael@0 | 161 | a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); |
michael@0 | 162 | d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); |
michael@0 | 163 | c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); |
michael@0 | 164 | b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551); |
michael@0 | 165 | |
michael@0 | 166 | a = safe_add(a, olda); |
michael@0 | 167 | b = safe_add(b, oldb); |
michael@0 | 168 | c = safe_add(c, oldc); |
michael@0 | 169 | d = safe_add(d, oldd); |
michael@0 | 170 | } |
michael@0 | 171 | return Array(a, b, c, d); |
michael@0 | 172 | |
michael@0 | 173 | } |
michael@0 | 174 | |
michael@0 | 175 | /* |
michael@0 | 176 | * These functions implement the four basic operations the algorithm uses. |
michael@0 | 177 | */ |
michael@0 | 178 | function md5_cmn(q, a, b, x, s, t) |
michael@0 | 179 | { |
michael@0 | 180 | return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b); |
michael@0 | 181 | } |
michael@0 | 182 | function md5_ff(a, b, c, d, x, s, t) |
michael@0 | 183 | { |
michael@0 | 184 | return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t); |
michael@0 | 185 | } |
michael@0 | 186 | function md5_gg(a, b, c, d, x, s, t) |
michael@0 | 187 | { |
michael@0 | 188 | return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t); |
michael@0 | 189 | } |
michael@0 | 190 | function md5_hh(a, b, c, d, x, s, t) |
michael@0 | 191 | { |
michael@0 | 192 | return md5_cmn(b ^ c ^ d, a, b, x, s, t); |
michael@0 | 193 | } |
michael@0 | 194 | function md5_ii(a, b, c, d, x, s, t) |
michael@0 | 195 | { |
michael@0 | 196 | return md5_cmn(c ^ (b | (~d)), a, b, x, s, t); |
michael@0 | 197 | } |
michael@0 | 198 | |
michael@0 | 199 | /* |
michael@0 | 200 | * Calculate the HMAC-MD5, of a key and some data |
michael@0 | 201 | */ |
michael@0 | 202 | function core_hmac_md5(key, data) |
michael@0 | 203 | { |
michael@0 | 204 | var bkey = str2binl(key); |
michael@0 | 205 | if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz); |
michael@0 | 206 | |
michael@0 | 207 | var ipad = Array(16), opad = Array(16); |
michael@0 | 208 | for(var i = 0; i < 16; i++) |
michael@0 | 209 | { |
michael@0 | 210 | ipad[i] = bkey[i] ^ 0x36363636; |
michael@0 | 211 | opad[i] = bkey[i] ^ 0x5C5C5C5C; |
michael@0 | 212 | } |
michael@0 | 213 | |
michael@0 | 214 | var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz); |
michael@0 | 215 | return core_md5(opad.concat(hash), 512 + 128); |
michael@0 | 216 | } |
michael@0 | 217 | |
michael@0 | 218 | /* |
michael@0 | 219 | * Add integers, wrapping at 2^32. This uses 16-bit operations internally |
michael@0 | 220 | * to work around bugs in some JS interpreters. |
michael@0 | 221 | */ |
michael@0 | 222 | function safe_add(x, y) |
michael@0 | 223 | { |
michael@0 | 224 | var lsw = (x & 0xFFFF) + (y & 0xFFFF); |
michael@0 | 225 | var msw = (x >> 16) + (y >> 16) + (lsw >> 16); |
michael@0 | 226 | return (msw << 16) | (lsw & 0xFFFF); |
michael@0 | 227 | } |
michael@0 | 228 | |
michael@0 | 229 | /* |
michael@0 | 230 | * Bitwise rotate a 32-bit number to the left. |
michael@0 | 231 | */ |
michael@0 | 232 | function bit_rol(num, cnt) |
michael@0 | 233 | { |
michael@0 | 234 | return (num << cnt) | (num >>> (32 - cnt)); |
michael@0 | 235 | } |
michael@0 | 236 | |
michael@0 | 237 | /* |
michael@0 | 238 | * Convert a string to an array of little-endian words |
michael@0 | 239 | * If chrsz is ASCII, characters >255 have their hi-byte silently ignored. |
michael@0 | 240 | */ |
michael@0 | 241 | function str2binl(str) |
michael@0 | 242 | { |
michael@0 | 243 | var bin = Array(); |
michael@0 | 244 | var mask = (1 << chrsz) - 1; |
michael@0 | 245 | for(var i = 0; i < str.length * chrsz; i += chrsz) |
michael@0 | 246 | bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32); |
michael@0 | 247 | return bin; |
michael@0 | 248 | } |
michael@0 | 249 | |
michael@0 | 250 | /* |
michael@0 | 251 | * Convert an array of little-endian words to a string |
michael@0 | 252 | */ |
michael@0 | 253 | function binl2str(bin) |
michael@0 | 254 | { |
michael@0 | 255 | var str = ""; |
michael@0 | 256 | var mask = (1 << chrsz) - 1; |
michael@0 | 257 | for(var i = 0; i < bin.length * 32; i += chrsz) |
michael@0 | 258 | str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask); |
michael@0 | 259 | return str; |
michael@0 | 260 | } |
michael@0 | 261 | |
michael@0 | 262 | /* |
michael@0 | 263 | * Convert an array of little-endian words to a hex string. |
michael@0 | 264 | */ |
michael@0 | 265 | function binl2hex(binarray) |
michael@0 | 266 | { |
michael@0 | 267 | var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; |
michael@0 | 268 | var str = ""; |
michael@0 | 269 | for(var i = 0; i < binarray.length * 4; i++) |
michael@0 | 270 | { |
michael@0 | 271 | str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) + |
michael@0 | 272 | hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF); |
michael@0 | 273 | } |
michael@0 | 274 | return str; |
michael@0 | 275 | } |
michael@0 | 276 | |
michael@0 | 277 | /* |
michael@0 | 278 | * Convert an array of little-endian words to a base-64 string |
michael@0 | 279 | */ |
michael@0 | 280 | function binl2b64(binarray) |
michael@0 | 281 | { |
michael@0 | 282 | var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; |
michael@0 | 283 | var str = ""; |
michael@0 | 284 | for(var i = 0; i < binarray.length * 4; i += 3) |
michael@0 | 285 | { |
michael@0 | 286 | var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16) |
michael@0 | 287 | | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 ) |
michael@0 | 288 | | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF); |
michael@0 | 289 | for(var j = 0; j < 4; j++) |
michael@0 | 290 | { |
michael@0 | 291 | if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; |
michael@0 | 292 | else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); |
michael@0 | 293 | } |
michael@0 | 294 | } |
michael@0 | 295 | return str; |
michael@0 | 296 | } |
michael@0 | 297 | |
michael@0 | 298 | var plainText = "Rebellious subjects, enemies to peace,\n\ |
michael@0 | 299 | Profaners of this neighbour-stained steel,--\n\ |
michael@0 | 300 | Will they not hear? What, ho! you men, you beasts,\n\ |
michael@0 | 301 | That quench the fire of your pernicious rage\n\ |
michael@0 | 302 | With purple fountains issuing from your veins,\n\ |
michael@0 | 303 | On pain of torture, from those bloody hands\n\ |
michael@0 | 304 | Throw your mistemper'd weapons to the ground,\n\ |
michael@0 | 305 | And hear the sentence of your moved prince.\n\ |
michael@0 | 306 | Three civil brawls, bred of an airy word,\n\ |
michael@0 | 307 | By thee, old Capulet, and Montague,\n\ |
michael@0 | 308 | Have thrice disturb'd the quiet of our streets,\n\ |
michael@0 | 309 | And made Verona's ancient citizens\n\ |
michael@0 | 310 | Cast by their grave beseeming ornaments,\n\ |
michael@0 | 311 | To wield old partisans, in hands as old,\n\ |
michael@0 | 312 | Canker'd with peace, to part your canker'd hate:\n\ |
michael@0 | 313 | If ever you disturb our streets again,\n\ |
michael@0 | 314 | Your lives shall pay the forfeit of the peace.\n\ |
michael@0 | 315 | For this time, all the rest depart away:\n\ |
michael@0 | 316 | You Capulet; shall go along with me:\n\ |
michael@0 | 317 | And, Montague, come you this afternoon,\n\ |
michael@0 | 318 | To know our further pleasure in this case,\n\ |
michael@0 | 319 | To old Free-town, our common judgment-place.\n\ |
michael@0 | 320 | Once more, on pain of death, all men depart." |
michael@0 | 321 | |
michael@0 | 322 | for (var i = 0; i <4; i++) { |
michael@0 | 323 | plainText += plainText; |
michael@0 | 324 | } |
michael@0 | 325 | |
michael@0 | 326 | var md5Output = hex_md5(plainText); |
michael@0 | 327 | |
michael@0 | 328 | |
michael@0 | 329 | var _sunSpiderInterval = new Date() - _sunSpiderStartDate; |
michael@0 | 330 | |
michael@0 | 331 | document.getElementById("console").innerHTML = _sunSpiderInterval; |
michael@0 | 332 | </script> |
michael@0 | 333 | |
michael@0 | 334 | |
michael@0 | 335 | </body> |
michael@0 | 336 | </html> |