michael@0: /* A JavaScript implementation of RIPEMD-160, as specified at
michael@0:  *
michael@0:  *   http://www.esat.kuleuven.ac.be/~cosicart/pdf/AB-9601/
michael@0:  *
michael@0:  * This is pretty much a straight translation of the pseudocode, which is
michael@0:  * shorter than the reference version which has loops unrolled, but is
michael@0:  * also somewhat slower.
michael@0:  *
michael@0:  * More information about RIPEMD-160 can be found at
michael@0:  *
michael@0:  *   http://www.esat.kuleuven.ac.be/~bosselae/ripemd160.html
michael@0:  *
michael@0:  * Copyright (c) 2004, Jeremy Lin. Written 2004/02/29.
michael@0:  *
michael@0:  * You may use this code under the terms of the BSD-style jsotp license:
michael@0:  *
michael@0:  *   http://www.ocf.berkeley.edu/~jjlin/jsotp/license.html
michael@0:  *
michael@0:  * The utility functions and general framework are borrowed from Paul Johnston's
michael@0:  * MD4/MD5/SHA-1 JavaScript implementations (http://pajhome.org.uk/crypt/md5), so
michael@0:  *
michael@0:  * Portions copyright (c) 1999-2002, Paul Johnston.
michael@0:  */
michael@0: 
michael@0: /*
michael@0:  * Configurable variables. You may need to tweak these to be compatible with
michael@0:  * the server-side, but the defaults work in most cases.
michael@0:  */
michael@0: var hexcase = 0;  /* hex output format. 0 - lowercase; 1 - uppercase        */
michael@0: var b64pad  = ""; /* base-64 pad character. "=" for strict RFC compliance   */
michael@0: var chrsz   = 8;  /* bits per input character. 8 - ASCII; 16 - Unicode      */
michael@0: 
michael@0: /*
michael@0:  * These are the functions you'll usually want to call
michael@0:  * They take string arguments and return either hex or base-64 encoded strings
michael@0:  */
michael@0: function hexrmd160(s){return binl2hex(corermd160(str2binl(s),s.length * chrsz));}
michael@0: function b64rmd160(s){return binl2b64(corermd160(str2binl(s),s.length * chrsz));}
michael@0: function strrmd160(s){return binl2str(corermd160(str2binl(s),s.length * chrsz));}
michael@0: function hexhmacrmd160(key, data){ return binl2hex(corehmacrmd160(key, data));}
michael@0: function b64hmacrmd160(key, data){ return binl2b64(corehmacrmd160(key, data));}
michael@0: function strhmacrmd160(key, data){ return binl2str(corehmacrmd160(key, data));}
michael@0: 
michael@0: /*
michael@0:  * Perform a simple self-test to see if the VM is working
michael@0:  */
michael@0: function rmd160vmtest()
michael@0: {
michael@0:   return hexrmd160("abc") == "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc";
michael@0: }
michael@0: 
michael@0: /*
michael@0:  * Calculate the RMD-160 of an array of big-endian words, and a bit length
michael@0:  */
michael@0: function corermd160(x, len)
michael@0: {
michael@0:   /* append padding */
michael@0:   x[len >> 5] |= 0x80 << (len % 32);
michael@0:   x[(((len + 64) >>> 9) << 4) + 14] = len;
michael@0: 
michael@0:   var h0 = 0x67452301;
michael@0:   var h1 = 0xefcdab89;
michael@0:   var h2 = 0x98badcfe;
michael@0:   var h3 = 0x10325476;
michael@0:   var h4 = 0xc3d2e1f0;
michael@0: 
michael@0:   for (var i = 0; i < x.length; i += 16) {
michael@0:     var T;
michael@0:     var A1 = h0, B1 = h1, C1 = h2, D1 = h3, E1 = h4;
michael@0:     var A2 = h0, B2 = h1, C2 = h2, D2 = h3, E2 = h4;
michael@0:     for (var j = 0; j <= 79; ++j) {
michael@0:       T = safeadd(A1, rmd160f(j, B1, C1, D1));
michael@0:       T = safeadd(T, x[i + rmd160r1[j]]);
michael@0:       T = safeadd(T, rmd160K1(j));
michael@0:       T = safeadd(rol(T, rmd160s1[j]), E1);
michael@0:       A1 = E1; E1 = D1; D1 = rol(C1, 10); C1 = B1; B1 = T;
michael@0:       T = safeadd(A2, rmd160f(79-j, B2, C2, D2));
michael@0:       T = safeadd(T, x[i + rmd160r2[j]]);
michael@0:       T = safeadd(T, rmd160K2(j));
michael@0:       T = safeadd(rol(T, rmd160s2[j]), E2);
michael@0:       A2 = E2; E2 = D2; D2 = rol(C2, 10); C2 = B2; B2 = T;
michael@0:     }
michael@0:     T = safeadd(h1, safeadd(C1, D2));
michael@0:     h1 = safeadd(h2, safeadd(D1, E2));
michael@0:     h2 = safeadd(h3, safeadd(E1, A2));
michael@0:     h3 = safeadd(h4, safeadd(A1, B2));
michael@0:     h4 = safeadd(h0, safeadd(B1, C2));
michael@0:     h0 = T;
michael@0:   }
michael@0:   return [h0, h1, h2, h3, h4];
michael@0: }
michael@0: 
michael@0: function rmd160f(j, x, y, z)
michael@0: {
michael@0:   return ( 0 <= j && j <= 15) ? (x ^ y ^ z) :
michael@0:          (16 <= j && j <= 31) ? (x & y) | (~x & z) :
michael@0:          (32 <= j && j <= 47) ? (x | ~y) ^ z :
michael@0:          (48 <= j && j <= 63) ? (x & z) | (y & ~z) :
michael@0:          (64 <= j && j <= 79) ? x ^ (y | ~z) :
michael@0:          "rmd160f: j out of range";
michael@0: }
michael@0: 
michael@0: function rmd160K1(j)
michael@0: {
michael@0:   return ( 0 <= j && j <= 15) ? 0x00000000 :
michael@0:          (16 <= j && j <= 31) ? 0x5a827999 :
michael@0:          (32 <= j && j <= 47) ? 0x6ed9eba1 :
michael@0:          (48 <= j && j <= 63) ? 0x8f1bbcdc :
michael@0:          (64 <= j && j <= 79) ? 0xa953fd4e :
michael@0:          "rmd160K1: j out of range";
michael@0: }
michael@0: 
michael@0: function rmd160K2(j)
michael@0: {
michael@0:   return ( 0 <= j && j <= 15) ? 0x50a28be6 :
michael@0:          (16 <= j && j <= 31) ? 0x5c4dd124 :
michael@0:          (32 <= j && j <= 47) ? 0x6d703ef3 :
michael@0:          (48 <= j && j <= 63) ? 0x7a6d76e9 :
michael@0:          (64 <= j && j <= 79) ? 0x00000000 :
michael@0:          "rmd160K2: j out of range";
michael@0: }
michael@0: 
michael@0: var rmd160r1 = [
michael@0:    0,  1,  2,  3,  4,  5,  6,  7,  8,  9, 10, 11, 12, 13, 14, 15,
michael@0:    7,  4, 13,  1, 10,  6, 15,  3, 12,  0,  9,  5,  2, 14, 11,  8,
michael@0:    3, 10, 14,  4,  9, 15,  8,  1,  2,  7,  0,  6, 13, 11,  5, 12,
michael@0:    1,  9, 11, 10,  0,  8, 12,  4, 13,  3,  7, 15, 14,  5,  6,  2,
michael@0:    4,  0,  5,  9,  7, 12,  2, 10, 14,  1,  3,  8, 11,  6, 15, 13
michael@0: ];
michael@0: var rmd160r2 = [
michael@0:    5, 14,  7,  0,  9,  2, 11,  4, 13,  6, 15,  8,  1, 10,  3, 12,
michael@0:    6, 11,  3,  7,  0, 13,  5, 10, 14, 15,  8, 12,  4,  9,  1,  2,
michael@0:   15,  5,  1,  3,  7, 14,  6,  9, 11,  8, 12,  2, 10,  0,  4, 13,
michael@0:    8,  6,  4,  1,  3, 11, 15,  0,  5, 12,  2, 13,  9,  7, 10, 14,
michael@0:   12, 15, 10,  4,  1,  5,  8,  7,  6,  2, 13, 14,  0,  3,  9, 11
michael@0: ];
michael@0: var rmd160s1 = [
michael@0:   11, 14, 15, 12,  5,  8,  7,  9, 11, 13, 14, 15,  6,  7,  9,  8,
michael@0:    7,  6,  8, 13, 11,  9,  7, 15,  7, 12, 15,  9, 11,  7, 13, 12,
michael@0:   11, 13,  6,  7, 14,  9, 13, 15, 14,  8, 13,  6,  5, 12,  7,  5,
michael@0:   11, 12, 14, 15, 14, 15,  9,  8,  9, 14,  5,  6,  8,  6,  5, 12,
michael@0:    9, 15,  5, 11,  6,  8, 13, 12,  5, 12, 13, 14, 11,  8,  5,  6
michael@0: ];
michael@0: var rmd160s2 = [
michael@0:    8,  9,  9, 11, 13, 15, 15,  5,  7,  7,  8, 11, 14, 14, 12,  6,
michael@0:    9, 13, 15,  7, 12,  8,  9, 11,  7,  7, 12,  7,  6, 15, 13, 11,
michael@0:    9,  7, 15, 11,  8,  6,  6, 14, 12, 13,  5, 14, 13, 13,  7,  5,
michael@0:   15,  5,  8, 11, 14, 14,  6, 14,  6,  9, 12,  9, 12,  5, 15,  8,
michael@0:    8,  5, 12,  9, 12,  5, 14,  6,  8, 13,  6,  5, 15, 13, 11, 11
michael@0: ];
michael@0: 
michael@0: /*
michael@0:  * Calculate the HMAC-RMD160 of a key and some data
michael@0:  */
michael@0: function corehmacrmd160(key, data)
michael@0: {
michael@0:   var bkey = str2binl(key);
michael@0:   if(bkey.length > 16) bkey = corermd160(bkey, key.length * chrsz);
michael@0: 
michael@0:   var ipad = Array(16), opad = Array(16);
michael@0:   for(var i = 0; i < 16; i++) 
michael@0:   {
michael@0:     ipad[i] = bkey[i] ^ 0x36363636;
michael@0:     opad[i] = bkey[i] ^ 0x5C5C5C5C;
michael@0:   }
michael@0: 
michael@0:   var hash = corermd160(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
michael@0:   return corermd160(opad.concat(hash), 512 + 160);
michael@0: }
michael@0: 
michael@0: /*
michael@0:  * Add integers, wrapping at 2^32. This uses 16-bit operations internally
michael@0:  * to work around bugs in some JS interpreters.
michael@0:  */
michael@0: function safeadd(x, y)
michael@0: {
michael@0:   var lsw = (x & 0xFFFF) + (y & 0xFFFF);
michael@0:   var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
michael@0:   return (msw << 16) | (lsw & 0xFFFF);
michael@0: }
michael@0: 
michael@0: /*
michael@0:  * Bitwise rotate a 32-bit number to the left.
michael@0:  */
michael@0: function rol(num, cnt)
michael@0: {
michael@0:   return (num << cnt) | (num >>> (32 - cnt));
michael@0: }
michael@0: 
michael@0: /*
michael@0:  * Convert a string to an array of little-endian words
michael@0:  * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
michael@0:  */
michael@0: function str2binl(str)
michael@0: {
michael@0:   var bin = Array();
michael@0:   var mask = (1 << chrsz) - 1;
michael@0:   for(var i = 0; i < str.length * chrsz; i += chrsz)
michael@0:     bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
michael@0:   return bin;
michael@0: }
michael@0: 
michael@0: /*
michael@0:  * Convert an array of little-endian words to a string
michael@0:  */
michael@0: function binl2str(bin)
michael@0: {
michael@0:   var str = "";
michael@0:   var mask = (1 << chrsz) - 1;
michael@0:   for(var i = 0; i < bin.length * 32; i += chrsz)
michael@0:     str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
michael@0:   return str;
michael@0: }
michael@0: 
michael@0: /*
michael@0:  * Convert an array of little-endian words to a hex string.
michael@0:  */
michael@0: function binl2hex(binarray)
michael@0: {
michael@0:   var hextab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
michael@0:   var str = "";
michael@0:   for(var i = 0; i < binarray.length * 4; i++)
michael@0:   {
michael@0:     str += hextab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
michael@0:            hextab.charAt((binarray[i>>2] >> ((i%4)*8  )) & 0xF);
michael@0:   }
michael@0:   return str;
michael@0: }
michael@0: 
michael@0: /*
michael@0:  * Convert an array of little-endian words to a base-64 string
michael@0:  */
michael@0: function binl2b64(binarray)
michael@0: {
michael@0:   var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
michael@0:   var str = "";
michael@0:   for(var i = 0; i < binarray.length * 4; i += 3)
michael@0:   {
michael@0:     var triplet = (((binarray[i   >> 2] >> 8 * ( i   %4)) & 0xFF) << 16)
michael@0:                 | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
michael@0:                 |  ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
michael@0:     for(var j = 0; j < 4; j++)
michael@0:     {
michael@0:       if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
michael@0:       else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
michael@0:     }
michael@0:   }
michael@0:   return str;
michael@0: }