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