Mercurial > boosterpack

annotate logintets/md5.js @ 6:4246c7ef6487 boosterpack

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
[svn r8] bug fix -- holos need to be one int three compared to rares
author robert
date Tue, 08 Sep 2009 17:20:52 -0400
parents 477258d09353
children
rev   line source
robert@0 1 /*
robert@0 2 * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message
robert@0 3 * Digest Algorithm, as defined in RFC 1321.
robert@0 4 * Version 2.1 Copyright (C) Paul Johnston 1999 - 2002.
robert@0 5 * Other contributors: Greg Holt, Andrew Kepert, Ydnar, Lostinet
robert@0 6 * Distributed under the BSD License
robert@0 7 * See http://pajhome.org.uk/crypt/md5 for more info.
robert@0 8 */
robert@0 9
robert@0 10 /*
robert@0 11 * Configurable variables. You may need to tweak these to be compatible with
robert@0 12 * the server-side, but the defaults work in most cases.
robert@0 13 */
robert@0 14 var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
robert@0 15 var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
robert@0 16 var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
robert@0 17
robert@0 18 /*
robert@0 19 * These are the functions you'll usually want to call
robert@0 20 * They take string arguments and return either hex or base-64 encoded strings
robert@0 21 */
robert@0 22 function hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));}
robert@0 23 function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));}
robert@0 24 function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));}
robert@0 25 function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); }
robert@0 26 function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); }
robert@0 27 function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); }
robert@0 28
robert@0 29 /*
robert@0 30 * Perform a simple self-test to see if the VM is working
robert@0 31 */
robert@0 32 function md5_vm_test()
robert@0 33 {
robert@0 34 return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";
robert@0 35 }
robert@0 36
robert@0 37 /*
robert@0 38 * Calculate the MD5 of an array of little-endian words, and a bit length
robert@0 39 */
robert@0 40 function core_md5(x, len)
robert@0 41 {
robert@0 42 /* append padding */
robert@0 43 x[len >> 5] |= 0x80 << ((len) % 32);
robert@0 44 x[(((len + 64) >>> 9) << 4) + 14] = len;
robert@0 45
robert@0 46 var a = 1732584193;
robert@0 47 var b = -271733879;
robert@0 48 var c = -1732584194;
robert@0 49 var d = 271733878;
robert@0 50
robert@0 51 for(var i = 0; i < x.length; i += 16)
robert@0 52 {
robert@0 53 var olda = a;
robert@0 54 var oldb = b;
robert@0 55 var oldc = c;
robert@0 56 var oldd = d;
robert@0 57
robert@0 58 a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);
robert@0 59 d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);
robert@0 60 c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819);
robert@0 61 b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);
robert@0 62 a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);
robert@0 63 d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426);
robert@0 64 c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);
robert@0 65 b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);
robert@0 66 a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416);
robert@0 67 d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);
robert@0 68 c = md5_ff(c, d, a, b, x[i+10], 17, -42063);
robert@0 69 b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);
robert@0 70 a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682);
robert@0 71 d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);
robert@0 72 c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);
robert@0 73 b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329);
robert@0 74
robert@0 75 a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);
robert@0 76 d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);
robert@0 77 c = md5_gg(c, d, a, b, x[i+11], 14, 643717713);
robert@0 78 b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);
robert@0 79 a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);
robert@0 80 d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083);
robert@0 81 c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);
robert@0 82 b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);
robert@0 83 a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438);
robert@0 84 d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);
robert@0 85 c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);
robert@0 86 b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501);
robert@0 87 a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);
robert@0 88 d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);
robert@0 89 c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473);
robert@0 90 b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);
robert@0 91
robert@0 92 a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);
robert@0 93 d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);
robert@0 94 c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562);
robert@0 95 b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);
robert@0 96 a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);
robert@0 97 d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353);
robert@0 98 c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);
robert@0 99 b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);
robert@0 100 a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174);
robert@0 101 d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);
robert@0 102 c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);
robert@0 103 b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189);
robert@0 104 a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);
robert@0 105 d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);
robert@0 106 c = md5_hh(c, d, a, b, x[i+15], 16, 530742520);
robert@0 107 b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);
robert@0 108
robert@0 109 a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);
robert@0 110 d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415);
robert@0 111 c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);
robert@0 112 b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);
robert@0 113 a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571);
robert@0 114 d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);
robert@0 115 c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);
robert@0 116 b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);
robert@0 117 a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359);
robert@0 118 d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);
robert@0 119 c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);
robert@0 120 b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649);
robert@0 121 a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);
robert@0 122 d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);
robert@0 123 c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259);
robert@0 124 b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);
robert@0 125
robert@0 126 a = safe_add(a, olda);
robert@0 127 b = safe_add(b, oldb);
robert@0 128 c = safe_add(c, oldc);
robert@0 129 d = safe_add(d, oldd);
robert@0 130 }
robert@0 131 return Array(a, b, c, d);
robert@0 132
robert@0 133 }
robert@0 134
robert@0 135 /*
robert@0 136 * These functions implement the four basic operations the algorithm uses.
robert@0 137 */
robert@0 138 function md5_cmn(q, a, b, x, s, t)
robert@0 139 {
robert@0 140 return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);
robert@0 141 }
robert@0 142 function md5_ff(a, b, c, d, x, s, t)
robert@0 143 {
robert@0 144 return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);
robert@0 145 }
robert@0 146 function md5_gg(a, b, c, d, x, s, t)
robert@0 147 {
robert@0 148 return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);
robert@0 149 }
robert@0 150 function md5_hh(a, b, c, d, x, s, t)
robert@0 151 {
robert@0 152 return md5_cmn(b ^ c ^ d, a, b, x, s, t);
robert@0 153 }
robert@0 154 function md5_ii(a, b, c, d, x, s, t)
robert@0 155 {
robert@0 156 return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);
robert@0 157 }
robert@0 158
robert@0 159 /*
robert@0 160 * Calculate the HMAC-MD5, of a key and some data
robert@0 161 */
robert@0 162 function core_hmac_md5(key, data)
robert@0 163 {
robert@0 164 var bkey = str2binl(key);
robert@0 165 if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz);
robert@0 166
robert@0 167 var ipad = Array(16), opad = Array(16);
robert@0 168 for(var i = 0; i < 16; i++)
robert@0 169 {
robert@0 170 ipad[i] = bkey[i] ^ 0x36363636;
robert@0 171 opad[i] = bkey[i] ^ 0x5C5C5C5C;
robert@0 172 }
robert@0 173
robert@0 174 var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
robert@0 175 return core_md5(opad.concat(hash), 512 + 128);
robert@0 176 }
robert@0 177
robert@0 178 /*
robert@0 179 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
robert@0 180 * to work around bugs in some JS interpreters.
robert@0 181 */
robert@0 182 function safe_add(x, y)
robert@0 183 {
robert@0 184 var lsw = (x & 0xFFFF) + (y & 0xFFFF);
robert@0 185 var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
robert@0 186 return (msw << 16) | (lsw & 0xFFFF);
robert@0 187 }
robert@0 188
robert@0 189 /*
robert@0 190 * Bitwise rotate a 32-bit number to the left.
robert@0 191 */
robert@0 192 function bit_rol(num, cnt)
robert@0 193 {
robert@0 194 return (num << cnt) | (num >>> (32 - cnt));
robert@0 195 }
robert@0 196
robert@0 197 /*
robert@0 198 * Convert a string to an array of little-endian words
robert@0 199 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
robert@0 200 */
robert@0 201 function str2binl(str)
robert@0 202 {
robert@0 203 var bin = Array();
robert@0 204 var mask = (1 << chrsz) - 1;
robert@0 205 for(var i = 0; i < str.length * chrsz; i += chrsz)
robert@0 206 bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
robert@0 207 return bin;
robert@0 208 }
robert@0 209
robert@0 210 /*
robert@0 211 * Convert an array of little-endian words to a string
robert@0 212 */
robert@0 213 function binl2str(bin)
robert@0 214 {
robert@0 215 var str = "";
robert@0 216 var mask = (1 << chrsz) - 1;
robert@0 217 for(var i = 0; i < bin.length * 32; i += chrsz)
robert@0 218 str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
robert@0 219 return str;
robert@0 220 }
robert@0 221
robert@0 222 /*
robert@0 223 * Convert an array of little-endian words to a hex string.
robert@0 224 */
robert@0 225 function binl2hex(binarray)
robert@0 226 {
robert@0 227 var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
robert@0 228 var str = "";
robert@0 229 for(var i = 0; i < binarray.length * 4; i++)
robert@0 230 {
robert@0 231 str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
robert@0 232 hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
robert@0 233 }
robert@0 234 return str;
robert@0 235 }
robert@0 236
robert@0 237 /*
robert@0 238 * Convert an array of little-endian words to a base-64 string
robert@0 239 */
robert@0 240 function binl2b64(binarray)
robert@0 241 {
robert@0 242 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
robert@0 243 var str = "";
robert@0 244 for(var i = 0; i < binarray.length * 4; i += 3)
robert@0 245 {
robert@0 246 var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
robert@0 247 | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
robert@0 248 | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
robert@0 249 for(var j = 0; j < 4; j++)
robert@0 250 {
robert@0 251 if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
robert@0 252 else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
robert@0 253 }
robert@0 254 }
robert@0 255 return str;
robert@0 256 }