[Sommaire] [Imprimer]

   1  /*


   2   * A JavaScript implementation of the RSA Data Security, Inc. MD5 Message


   3   * Digest Algorithm, as defined in RFC 1321.


   4   * Version 2.2-alpha Copyright (C) Paul Johnston 1999 - 2005


   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  

  17  /*


  18   * These are the functions you'll usually want to call


  19   * They take string arguments and return either hex or base-64 encoded strings


  20   */

  21  function hex_md5(s)    { return rstr2hex(rstr_md5(str2rstr_utf8(s))); }

  22  function b64_md5(s)    { return rstr2b64(rstr_md5(str2rstr_utf8(s))); }

  23  function any_md5(s, e) { return rstr2any(rstr_md5(str2rstr_utf8(s)), e); }

  24  function hex_hmac_md5(k, d)

  25    { return rstr2hex(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }

  26  function b64_hmac_md5(k, d)

  27    { return rstr2b64(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d))); }

  28  function any_hmac_md5(k, d, e)

  29    { return rstr2any(rstr_hmac_md5(str2rstr_utf8(k), str2rstr_utf8(d)), e); }

  30  

  31  /*


  32   * Perform a simple self-test to see if the VM is working


  33   */

  34  function md5_vm_test()

  35  {

  36    return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72";

  37  }

  38  

  39  /*


  40   * Calculate the MD5 of a raw string


  41   */

  42  function rstr_md5(s)

  43  {

  44    return binl2rstr(binl_md5(rstr2binl(s), s.length * 8));

  45  }

  46  

  47  /*


  48   * Calculate the HMAC-MD5, of a key and some data (raw strings)


  49   */

  50  function rstr_hmac_md5(key, data)

  51  {

  52    var bkey = rstr2binl(key);

  53    if(bkey.length > 16) bkey = binl_md5(bkey, key.length * 8);

  54  

  55    var ipad = Array(16), opad = Array(16);

  56    for(var i = 0; i < 16; i++)

  57    {

  58      ipad[i] = bkey[i] ^ 0x36363636;

  59      opad[i] = bkey[i] ^ 0x5C5C5C5C;

  60    }

  61  

  62    var hash = binl_md5(ipad.concat(rstr2binl(data)), 512 + data.length * 8);

  63    return binl2rstr(binl_md5(opad.concat(hash), 512 + 128));

  64  }

  65  

  66  /*


  67   * Convert a raw string to a hex string


  68   */

  69  function rstr2hex(input)

  70  {

  71    var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";

  72    var output = "";

  73    var x;

  74    for(var i = 0; i < input.length; i++)

  75    {

  76      x = input.charCodeAt(i);

  77      output += hex_tab.charAt((x >>> 4) & 0x0F)

  78             +  hex_tab.charAt( x        & 0x0F);

  79    }

  80    return output;

  81  }

  82  

  83  /*


  84   * Convert a raw string to a base-64 string


  85   */

  86  function rstr2b64(input)

  87  {

  88    var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";

  89    var output = "";

  90    var len = input.length;

  91    for(var i = 0; i < len; i += 3)

  92    {

  93      var triplet = (input.charCodeAt(i) << 16)

  94                  | (i + 1 < len ? input.charCodeAt(i+1) << 8 : 0)

  95                  | (i + 2 < len ? input.charCodeAt(i+2)      : 0);

  96      for(var j = 0; j < 4; j++)

  97      {

  98        if(i * 8 + j * 6 > input.length * 8) output += b64pad;

  99        else output += tab.charAt((triplet >>> 6*(3-j)) & 0x3F);

 100      }

 101    }

 102    return output;

 103  }

 104  

 105  /*


 106   * Convert a raw string to an arbitrary string encoding


 107   */

 108  function rstr2any(input, encoding)

 109  {

 110    var divisor = encoding.length;

 111    var i, j, q, x, quotient;

 112  

 113    /* Convert to an array of 16-bit big-endian values, forming the dividend */


 114    var dividend = Array(Math.ceil(input.length / 2));

 115    for(i = 0; i < dividend.length; i++)

 116    {

 117      dividend[i] = (input.charCodeAt(i * 2) << 8) | input.charCodeAt(i * 2 + 1);

 118    }

 119  

 120    /*


 121     * Repeatedly perform a long division. The binary array forms the dividend,


 122     * the length of the encoding is the divisor. Once computed, the quotient


 123     * forms the dividend for the next step. All remainders are stored for later


 124     * use.


 125     */

 126    var full_length = Math.ceil(input.length * 8 /

 127                                      (Math.log(encoding.length) / Math.log(2)));

 128    var remainders = Array(full_length);

 129    for(j = 0; j < full_length; j++)

 130    {

 131      quotient = Array();

 132      x = 0;

 133      for(i = 0; i < dividend.length; i++)

 134      {

 135        x = (x << 16) + dividend[i];

 136        q = Math.floor(x / divisor);

 137        x -= q * divisor;

 138        if(quotient.length > 0 || q > 0)

 139          quotient[quotient.length] = q;

 140      }

 141      remainders[j] = x;

 142      dividend = quotient;

 143    }

 144  

 145    /* Convert the remainders to the output string */


 146    var output = "";

 147    for(i = remainders.length - 1; i >= 0; i--)

 148      output += encoding.charAt(remainders[i]);

 149  

 150    return output;

 151  }

 152  

 153  /*


 154   * Encode a string as utf-8.


 155   * For efficiency, this assumes the input is valid utf-16.


 156   */

 157  function str2rstr_utf8(input)

 158  {

 159    var output = "";

 160    var i = -1;

 161    var x, y;

 162  

 163    while(++i < input.length)

 164    {

 165      /* Decode utf-16 surrogate pairs */


 166      x = input.charCodeAt(i);

 167      y = i + 1 < input.length ? input.charCodeAt(i + 1) : 0;

 168      if(0xD800 <= x && x <= 0xDBFF && 0xDC00 <= y && y <= 0xDFFF)

 169      {

 170        x = 0x10000 + ((x & 0x03FF) << 10) + (y & 0x03FF);

 171        i++;

 172      }

 173  

 174      /* Encode output as utf-8 */


 175      if(x <= 0x7F)

 176        output += String.fromCharCode(x);

 177      else if(x <= 0x7FF)

 178        output += String.fromCharCode(0xC0 | ((x >>> 6 ) & 0x1F),

 179                                      0x80 | ( x         & 0x3F));

 180      else if(x <= 0xFFFF)

 181        output += String.fromCharCode(0xE0 | ((x >>> 12) & 0x0F),

 182                                      0x80 | ((x >>> 6 ) & 0x3F),

 183                                      0x80 | ( x         & 0x3F));

 184      else if(x <= 0x1FFFFF)

 185        output += String.fromCharCode(0xF0 | ((x >>> 18) & 0x07),

 186                                      0x80 | ((x >>> 12) & 0x3F),

 187                                      0x80 | ((x >>> 6 ) & 0x3F),

 188                                      0x80 | ( x         & 0x3F));

 189    }

 190    return output;

 191  }

 192  

 193  /*


 194   * Encode a string as utf-16


 195   */

 196  function str2rstr_utf16le(input)

 197  {

 198    var output = "";

 199    for(var i = 0; i < input.length; i++)

 200      output += String.fromCharCode( input.charCodeAt(i)        & 0xFF,

 201                                    (input.charCodeAt(i) >>> 8) & 0xFF);

 202    return output;

 203  }

 204  

 205  function str2rstr_utf16be(input)

 206  {

 207    var output = "";

 208    for(var i = 0; i < input.length; i++)

 209      output += String.fromCharCode((input.charCodeAt(i) >>> 8) & 0xFF,

 210                                     input.charCodeAt(i)        & 0xFF);

 211    return output;

 212  }

 213  

 214  /*


 215   * Convert a raw string to an array of little-endian words


 216   * Characters >255 have their high-byte silently ignored.


 217   */

 218  function rstr2binl(input)

 219  {

 220    var output = Array(input.length >> 2);

 221    for(var i = 0; i < output.length; i++)

 222      output[i] = 0;

 223    for(var i = 0; i < input.length * 8; i += 8)

 224      output[i>>5] |= (input.charCodeAt(i / 8) & 0xFF) << (i%32);

 225    return output;

 226  }

 227  

 228  /*


 229   * Convert an array of little-endian words to a string


 230   */

 231  function binl2rstr(input)

 232  {

 233    var output = "";

 234    for(var i = 0; i < input.length * 32; i += 8)

 235      output += String.fromCharCode((input[i>>5] >>> (i % 32)) & 0xFF);

 236    return output;

 237  }

 238  

 239  /*


 240   * Calculate the MD5 of an array of little-endian words, and a bit length.


 241   */

 242  function binl_md5(x, len)

 243  {

 244    /* append padding */


 245    x[len >> 5] |= 0x80 << ((len) % 32);

 246    x[(((len + 64) >>> 9) << 4) + 14] = len;

 247  

 248    var a =  1732584193;

 249    var b = -271733879;

 250    var c = -1732584194;

 251    var d =  271733878;

 252  

 253    for(var i = 0; i < x.length; i += 16)

 254    {

 255      var olda = a;

 256      var oldb = b;

 257      var oldc = c;

 258      var oldd = d;

 259  

 260      a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936);

 261      d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586);

 262      c = md5_ff(c, d, a, b, x[i+ 2], 17,  606105819);

 263      b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330);

 264      a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897);

 265      d = md5_ff(d, a, b, c, x[i+ 5], 12,  1200080426);

 266      c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341);

 267      b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983);

 268      a = md5_ff(a, b, c, d, x[i+ 8], 7 ,  1770035416);

 269      d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417);

 270      c = md5_ff(c, d, a, b, x[i+10], 17, -42063);

 271      b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162);

 272      a = md5_ff(a, b, c, d, x[i+12], 7 ,  1804603682);

 273      d = md5_ff(d, a, b, c, x[i+13], 12, -40341101);

 274      c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290);

 275      b = md5_ff(b, c, d, a, x[i+15], 22,  1236535329);

 276  

 277      a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510);

 278      d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632);

 279      c = md5_gg(c, d, a, b, x[i+11], 14,  643717713);

 280      b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302);

 281      a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691);

 282      d = md5_gg(d, a, b, c, x[i+10], 9 ,  38016083);

 283      c = md5_gg(c, d, a, b, x[i+15], 14, -660478335);

 284      b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848);

 285      a = md5_gg(a, b, c, d, x[i+ 9], 5 ,  568446438);

 286      d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690);

 287      c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961);

 288      b = md5_gg(b, c, d, a, x[i+ 8], 20,  1163531501);

 289      a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467);

 290      d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784);

 291      c = md5_gg(c, d, a, b, x[i+ 7], 14,  1735328473);

 292      b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734);

 293  

 294      a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558);

 295      d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463);

 296      c = md5_hh(c, d, a, b, x[i+11], 16,  1839030562);

 297      b = md5_hh(b, c, d, a, x[i+14], 23, -35309556);

 298      a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060);

 299      d = md5_hh(d, a, b, c, x[i+ 4], 11,  1272893353);

 300      c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632);

 301      b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640);

 302      a = md5_hh(a, b, c, d, x[i+13], 4 ,  681279174);

 303      d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222);

 304      c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979);

 305      b = md5_hh(b, c, d, a, x[i+ 6], 23,  76029189);

 306      a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487);

 307      d = md5_hh(d, a, b, c, x[i+12], 11, -421815835);

 308      c = md5_hh(c, d, a, b, x[i+15], 16,  530742520);

 309      b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651);

 310  

 311      a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844);

 312      d = md5_ii(d, a, b, c, x[i+ 7], 10,  1126891415);

 313      c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905);

 314      b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055);

 315      a = md5_ii(a, b, c, d, x[i+12], 6 ,  1700485571);

 316      d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606);

 317      c = md5_ii(c, d, a, b, x[i+10], 15, -1051523);

 318      b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799);

 319      a = md5_ii(a, b, c, d, x[i+ 8], 6 ,  1873313359);

 320      d = md5_ii(d, a, b, c, x[i+15], 10, -30611744);

 321      c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380);

 322      b = md5_ii(b, c, d, a, x[i+13], 21,  1309151649);

 323      a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070);

 324      d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379);

 325      c = md5_ii(c, d, a, b, x[i+ 2], 15,  718787259);

 326      b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551);

 327  

 328      a = safe_add(a, olda);

 329      b = safe_add(b, oldb);

 330      c = safe_add(c, oldc);

 331      d = safe_add(d, oldd);

 332    }

 333    return Array(a, b, c, d);

 334  }

 335  

 336  /*


 337   * These functions implement the four basic operations the algorithm uses.


 338   */

 339  function md5_cmn(q, a, b, x, s, t)

 340  {

 341    return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b);

 342  }

 343  function md5_ff(a, b, c, d, x, s, t)

 344  {

 345    return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t);

 346  }

 347  function md5_gg(a, b, c, d, x, s, t)

 348  {

 349    return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t);

 350  }

 351  function md5_hh(a, b, c, d, x, s, t)

 352  {

 353    return md5_cmn(b ^ c ^ d, a, b, x, s, t);

 354  }

 355  function md5_ii(a, b, c, d, x, s, t)

 356  {

 357    return md5_cmn(c ^ (b | (~d)), a, b, x, s, t);

 358  }

 359  

 360  /*


 361   * Add integers, wrapping at 2^32. This uses 16-bit operations internally


 362   * to work around bugs in some JS interpreters.


 363   */

 364  function safe_add(x, y)

 365  {

 366    var lsw = (x & 0xFFFF) + (y & 0xFFFF);

 367    var msw = (x >> 16) + (y >> 16) + (lsw >> 16);

 368    return (msw << 16) | (lsw & 0xFFFF);

 369  }

 370  

 371  /*


 372   * Bitwise rotate a 32-bit number to the left.


 373   */

 374  function bit_rol(num, cnt)

 375  {

 376    return (num << cnt) | (num >>> (32 - cnt));

 377  }