src/tizen/hashes/rmd160.js

Wed, 31 Jul 2013 19:48:00 +0200

author
Michael Schloh von Bennewitz <michael@schloh.com>
date
Wed, 31 Jul 2013 19:48:00 +0200
changeset 14
d1b294812560
permissions
-rw-r--r--

Introduce port to the Tizen OS.

michael@14 1 /* A JavaScript implementation of RIPEMD-160, as specified at
michael@14 2 *
michael@14 3 * http://www.esat.kuleuven.ac.be/~cosicart/pdf/AB-9601/
michael@14 4 *
michael@14 5 * This is pretty much a straight translation of the pseudocode, which is
michael@14 6 * shorter than the reference version which has loops unrolled, but is
michael@14 7 * also somewhat slower.
michael@14 8 *
michael@14 9 * More information about RIPEMD-160 can be found at
michael@14 10 *
michael@14 11 * http://www.esat.kuleuven.ac.be/~bosselae/ripemd160.html
michael@14 12 *
michael@14 13 * Copyright (c) 2004, Jeremy Lin. Written 2004/02/29.
michael@14 14 *
michael@14 15 * You may use this code under the terms of the BSD-style jsotp license:
michael@14 16 *
michael@14 17 * http://www.ocf.berkeley.edu/~jjlin/jsotp/license.html
michael@14 18 *
michael@14 19 * The utility functions and general framework are borrowed from Paul Johnston's
michael@14 20 * MD4/MD5/SHA-1 JavaScript implementations (http://pajhome.org.uk/crypt/md5), so
michael@14 21 *
michael@14 22 * Portions copyright (c) 1999-2002, Paul Johnston.
michael@14 23 */
michael@14 24
michael@14 25 /*
michael@14 26 * Configurable variables. You may need to tweak these to be compatible with
michael@14 27 * the server-side, but the defaults work in most cases.
michael@14 28 */
michael@14 29 var hexcase = 0; /* hex output format. 0 - lowercase; 1 - uppercase */
michael@14 30 var b64pad = ""; /* base-64 pad character. "=" for strict RFC compliance */
michael@14 31 var chrsz = 8; /* bits per input character. 8 - ASCII; 16 - Unicode */
michael@14 32
michael@14 33 /*
michael@14 34 * These are the functions you'll usually want to call
michael@14 35 * They take string arguments and return either hex or base-64 encoded strings
michael@14 36 */
michael@14 37 function hexrmd160(s){return binl2hex(corermd160(str2binl(s),s.length * chrsz));}
michael@14 38 function b64rmd160(s){return binl2b64(corermd160(str2binl(s),s.length * chrsz));}
michael@14 39 function strrmd160(s){return binl2str(corermd160(str2binl(s),s.length * chrsz));}
michael@14 40 function hexhmacrmd160(key, data){ return binl2hex(corehmacrmd160(key, data));}
michael@14 41 function b64hmacrmd160(key, data){ return binl2b64(corehmacrmd160(key, data));}
michael@14 42 function strhmacrmd160(key, data){ return binl2str(corehmacrmd160(key, data));}
michael@14 43
michael@14 44 /*
michael@14 45 * Perform a simple self-test to see if the VM is working
michael@14 46 */
michael@14 47 function rmd160vmtest()
michael@14 48 {
michael@14 49 return hexrmd160("abc") == "8eb208f7e05d987a9b044a8e98c6b087f15a0bfc";
michael@14 50 }
michael@14 51
michael@14 52 /*
michael@14 53 * Calculate the RMD-160 of an array of big-endian words, and a bit length
michael@14 54 */
michael@14 55 function corermd160(x, len)
michael@14 56 {
michael@14 57 /* append padding */
michael@14 58 x[len >> 5] |= 0x80 << (len % 32);
michael@14 59 x[(((len + 64) >>> 9) << 4) + 14] = len;
michael@14 60
michael@14 61 var h0 = 0x67452301;
michael@14 62 var h1 = 0xefcdab89;
michael@14 63 var h2 = 0x98badcfe;
michael@14 64 var h3 = 0x10325476;
michael@14 65 var h4 = 0xc3d2e1f0;
michael@14 66
michael@14 67 for (var i = 0; i < x.length; i += 16) {
michael@14 68 var T;
michael@14 69 var A1 = h0, B1 = h1, C1 = h2, D1 = h3, E1 = h4;
michael@14 70 var A2 = h0, B2 = h1, C2 = h2, D2 = h3, E2 = h4;
michael@14 71 for (var j = 0; j <= 79; ++j) {
michael@14 72 T = safeadd(A1, rmd160f(j, B1, C1, D1));
michael@14 73 T = safeadd(T, x[i + rmd160r1[j]]);
michael@14 74 T = safeadd(T, rmd160K1(j));
michael@14 75 T = safeadd(rol(T, rmd160s1[j]), E1);
michael@14 76 A1 = E1; E1 = D1; D1 = rol(C1, 10); C1 = B1; B1 = T;
michael@14 77 T = safeadd(A2, rmd160f(79-j, B2, C2, D2));
michael@14 78 T = safeadd(T, x[i + rmd160r2[j]]);
michael@14 79 T = safeadd(T, rmd160K2(j));
michael@14 80 T = safeadd(rol(T, rmd160s2[j]), E2);
michael@14 81 A2 = E2; E2 = D2; D2 = rol(C2, 10); C2 = B2; B2 = T;
michael@14 82 }
michael@14 83 T = safeadd(h1, safeadd(C1, D2));
michael@14 84 h1 = safeadd(h2, safeadd(D1, E2));
michael@14 85 h2 = safeadd(h3, safeadd(E1, A2));
michael@14 86 h3 = safeadd(h4, safeadd(A1, B2));
michael@14 87 h4 = safeadd(h0, safeadd(B1, C2));
michael@14 88 h0 = T;
michael@14 89 }
michael@14 90 return [h0, h1, h2, h3, h4];
michael@14 91 }
michael@14 92
michael@14 93 function rmd160f(j, x, y, z)
michael@14 94 {
michael@14 95 return ( 0 <= j && j <= 15) ? (x ^ y ^ z) :
michael@14 96 (16 <= j && j <= 31) ? (x & y) | (~x & z) :
michael@14 97 (32 <= j && j <= 47) ? (x | ~y) ^ z :
michael@14 98 (48 <= j && j <= 63) ? (x & z) | (y & ~z) :
michael@14 99 (64 <= j && j <= 79) ? x ^ (y | ~z) :
michael@14 100 "rmd160f: j out of range";
michael@14 101 }
michael@14 102
michael@14 103 function rmd160K1(j)
michael@14 104 {
michael@14 105 return ( 0 <= j && j <= 15) ? 0x00000000 :
michael@14 106 (16 <= j && j <= 31) ? 0x5a827999 :
michael@14 107 (32 <= j && j <= 47) ? 0x6ed9eba1 :
michael@14 108 (48 <= j && j <= 63) ? 0x8f1bbcdc :
michael@14 109 (64 <= j && j <= 79) ? 0xa953fd4e :
michael@14 110 "rmd160K1: j out of range";
michael@14 111 }
michael@14 112
michael@14 113 function rmd160K2(j)
michael@14 114 {
michael@14 115 return ( 0 <= j && j <= 15) ? 0x50a28be6 :
michael@14 116 (16 <= j && j <= 31) ? 0x5c4dd124 :
michael@14 117 (32 <= j && j <= 47) ? 0x6d703ef3 :
michael@14 118 (48 <= j && j <= 63) ? 0x7a6d76e9 :
michael@14 119 (64 <= j && j <= 79) ? 0x00000000 :
michael@14 120 "rmd160K2: j out of range";
michael@14 121 }
michael@14 122
michael@14 123 var rmd160r1 = [
michael@14 124 0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15,
michael@14 125 7, 4, 13, 1, 10, 6, 15, 3, 12, 0, 9, 5, 2, 14, 11, 8,
michael@14 126 3, 10, 14, 4, 9, 15, 8, 1, 2, 7, 0, 6, 13, 11, 5, 12,
michael@14 127 1, 9, 11, 10, 0, 8, 12, 4, 13, 3, 7, 15, 14, 5, 6, 2,
michael@14 128 4, 0, 5, 9, 7, 12, 2, 10, 14, 1, 3, 8, 11, 6, 15, 13
michael@14 129 ];
michael@14 130 var rmd160r2 = [
michael@14 131 5, 14, 7, 0, 9, 2, 11, 4, 13, 6, 15, 8, 1, 10, 3, 12,
michael@14 132 6, 11, 3, 7, 0, 13, 5, 10, 14, 15, 8, 12, 4, 9, 1, 2,
michael@14 133 15, 5, 1, 3, 7, 14, 6, 9, 11, 8, 12, 2, 10, 0, 4, 13,
michael@14 134 8, 6, 4, 1, 3, 11, 15, 0, 5, 12, 2, 13, 9, 7, 10, 14,
michael@14 135 12, 15, 10, 4, 1, 5, 8, 7, 6, 2, 13, 14, 0, 3, 9, 11
michael@14 136 ];
michael@14 137 var rmd160s1 = [
michael@14 138 11, 14, 15, 12, 5, 8, 7, 9, 11, 13, 14, 15, 6, 7, 9, 8,
michael@14 139 7, 6, 8, 13, 11, 9, 7, 15, 7, 12, 15, 9, 11, 7, 13, 12,
michael@14 140 11, 13, 6, 7, 14, 9, 13, 15, 14, 8, 13, 6, 5, 12, 7, 5,
michael@14 141 11, 12, 14, 15, 14, 15, 9, 8, 9, 14, 5, 6, 8, 6, 5, 12,
michael@14 142 9, 15, 5, 11, 6, 8, 13, 12, 5, 12, 13, 14, 11, 8, 5, 6
michael@14 143 ];
michael@14 144 var rmd160s2 = [
michael@14 145 8, 9, 9, 11, 13, 15, 15, 5, 7, 7, 8, 11, 14, 14, 12, 6,
michael@14 146 9, 13, 15, 7, 12, 8, 9, 11, 7, 7, 12, 7, 6, 15, 13, 11,
michael@14 147 9, 7, 15, 11, 8, 6, 6, 14, 12, 13, 5, 14, 13, 13, 7, 5,
michael@14 148 15, 5, 8, 11, 14, 14, 6, 14, 6, 9, 12, 9, 12, 5, 15, 8,
michael@14 149 8, 5, 12, 9, 12, 5, 14, 6, 8, 13, 6, 5, 15, 13, 11, 11
michael@14 150 ];
michael@14 151
michael@14 152 /*
michael@14 153 * Calculate the HMAC-RMD160 of a key and some data
michael@14 154 */
michael@14 155 function corehmacrmd160(key, data)
michael@14 156 {
michael@14 157 var bkey = str2binl(key);
michael@14 158 if(bkey.length > 16) bkey = corermd160(bkey, key.length * chrsz);
michael@14 159
michael@14 160 var ipad = Array(16), opad = Array(16);
michael@14 161 for(var i = 0; i < 16; i++)
michael@14 162 {
michael@14 163 ipad[i] = bkey[i] ^ 0x36363636;
michael@14 164 opad[i] = bkey[i] ^ 0x5C5C5C5C;
michael@14 165 }
michael@14 166
michael@14 167 var hash = corermd160(ipad.concat(str2binl(data)), 512 + data.length * chrsz);
michael@14 168 return corermd160(opad.concat(hash), 512 + 160);
michael@14 169 }
michael@14 170
michael@14 171 /*
michael@14 172 * Add integers, wrapping at 2^32. This uses 16-bit operations internally
michael@14 173 * to work around bugs in some JS interpreters.
michael@14 174 */
michael@14 175 function safeadd(x, y)
michael@14 176 {
michael@14 177 var lsw = (x & 0xFFFF) + (y & 0xFFFF);
michael@14 178 var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
michael@14 179 return (msw << 16) | (lsw & 0xFFFF);
michael@14 180 }
michael@14 181
michael@14 182 /*
michael@14 183 * Bitwise rotate a 32-bit number to the left.
michael@14 184 */
michael@14 185 function rol(num, cnt)
michael@14 186 {
michael@14 187 return (num << cnt) | (num >>> (32 - cnt));
michael@14 188 }
michael@14 189
michael@14 190 /*
michael@14 191 * Convert a string to an array of little-endian words
michael@14 192 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored.
michael@14 193 */
michael@14 194 function str2binl(str)
michael@14 195 {
michael@14 196 var bin = Array();
michael@14 197 var mask = (1 << chrsz) - 1;
michael@14 198 for(var i = 0; i < str.length * chrsz; i += chrsz)
michael@14 199 bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32);
michael@14 200 return bin;
michael@14 201 }
michael@14 202
michael@14 203 /*
michael@14 204 * Convert an array of little-endian words to a string
michael@14 205 */
michael@14 206 function binl2str(bin)
michael@14 207 {
michael@14 208 var str = "";
michael@14 209 var mask = (1 << chrsz) - 1;
michael@14 210 for(var i = 0; i < bin.length * 32; i += chrsz)
michael@14 211 str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask);
michael@14 212 return str;
michael@14 213 }
michael@14 214
michael@14 215 /*
michael@14 216 * Convert an array of little-endian words to a hex string.
michael@14 217 */
michael@14 218 function binl2hex(binarray)
michael@14 219 {
michael@14 220 var hextab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
michael@14 221 var str = "";
michael@14 222 for(var i = 0; i < binarray.length * 4; i++)
michael@14 223 {
michael@14 224 str += hextab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) +
michael@14 225 hextab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF);
michael@14 226 }
michael@14 227 return str;
michael@14 228 }
michael@14 229
michael@14 230 /*
michael@14 231 * Convert an array of little-endian words to a base-64 string
michael@14 232 */
michael@14 233 function binl2b64(binarray)
michael@14 234 {
michael@14 235 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
michael@14 236 var str = "";
michael@14 237 for(var i = 0; i < binarray.length * 4; i += 3)
michael@14 238 {
michael@14 239 var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16)
michael@14 240 | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 )
michael@14 241 | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF);
michael@14 242 for(var j = 0; j < 4; j++)
michael@14 243 {
michael@14 244 if(i * 8 + j * 6 > binarray.length * 32) str += b64pad;
michael@14 245 else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F);
michael@14 246 }
michael@14 247 }
michael@14 248 return str;
michael@14 249 }

mercurial