htdocs/md5.js

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