1.区别
Hash，一般翻译做"散列"，也有直接音译为"哈希"的，就是把任意长度的输入，变换成固定长度的输出，该输出就是散列值。这种转换是一种压缩映射，也就是，散列值的空间通常远小于输入的空间，不同的输入可能会散列成相同的输出，而不可能从散列值来唯一的确定输入值。简单的说就是一种将任意长度的消息压缩到某一固定长度的消息摘要的函数。
MD5与SHA1都是Hash算法，MD5输出是128位的，SHA1输出是160位的，MD5比SHA1快，SHA1比MD5强度高。
Hash是一种特殊的算法，MD5就是其中常用的一种。它的算法的特征是不可逆性，并且才计算的时候所有的数据都参与了运算，其中任何一个数据变化了都会导致计算出来的Hash值完全不同，所以通常用来校验数据是否正确或用作身份验证。常见的，论坛里面用户的密码是经过MD5等Hash算法算出来的Hash值进行保存的。
2.sha1
调用：
hex_sha1("abc")
js源码：
1 /*sha1 2 * A JavaScript implementation of the Secure Hash Algorithm, SHA-1, as defined 3 * in FIPS PUB 180-1 4 * Version 2.1a Copyright Paul Johnston 2000 - 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 details. 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 hex_sha1(s){return binb2hex(core_sha1(str2binb(s),s.length * chrsz));} 23 function b64_sha1(s){return binb2b64(core_sha1(str2binb(s),s.length * chrsz));} 24 function str_sha1(s){return binb2str(core_sha1(str2binb(s),s.length * chrsz));} 25 function hex_hmac_sha1(key, data){ return binb2hex(core_hmac_sha1(key, data));} 26 function b64_hmac_sha1(key, data){ return binb2b64(core_hmac_sha1(key, data));} 27 function str_hmac_sha1(key, data){ return binb2str(core_hmac_sha1(key, data));} 28 29 /* 30 * Perform a simple self-test to see if the VM is working 31 */ 32 function sha1_vm_test() 33 { 34 return hex_sha1("abc") == "a9993e364706816aba3e25717850c26c9cd0d89d"; 35 } 36 37 /* 38 * Calculate the SHA-1 of an array of big-endian words, and a bit length 39 */ 40 function core_sha1(x, len) 41 { 42 /* append padding */ 43 x[len >> 5] |= 0x80 << (24 - len % 32); 44 x[((len + 64 >> 9) << 4) + 15] = len; 45 46 var w = Array(80); 47 var a = 1732584193; 48 var b = -271733879; 49 var c = -1732584194; 50 var d = 271733878; 51 var e = -1009589776; 52 53 for(var i = 0; i < x.length; i += 16) 54 { 55 var olda = a; 56 var oldb = b; 57 var oldc = c; 58 var oldd = d; 59 var olde = e; 60 61 for(var j = 0; j < 80; j++) 62 { 63 if(j < 16) w[j] = x[i + j]; 64 else w[j] = rol(w[j-3] ^ w[j-8] ^ w[j-14] ^ w[j-16], 1); 65 var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), 66 safe_add(safe_add(e, w[j]), sha1_kt(j))); 67 e = d; 68 d = c; 69 c = rol(b, 30); 70 b = a; 71 a = t; 72 } 73 74 a = safe_add(a, olda); 75 b = safe_add(b, oldb); 76 c = safe_add(c, oldc); 77 d = safe_add(d, oldd); 78 e = safe_add(e, olde); 79 } 80 return Array(a, b, c, d, e); 81 82 } 83 84 /* 85 * Perform the appropriate triplet combination function for the current 86 * iteration 87 */ 88 function sha1_ft(t, b, c, d) 89 { 90 if(t < 20) return (b & c) | ((~b) & d); 91 if(t < 40) return b ^ c ^ d; 92 if(t < 60) return (b & c) | (b & d) | (c & d); 93 return b ^ c ^ d; 94 } 95 96 /* 97 * Determine the appropriate additive constant for the current iteration 98 */ 99 function sha1_kt(t) 100 { 101 return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : 102 (t < 60) ? -1894007588 : -899497514; 103 } 104 105 /* 106 * Calculate the HMAC-SHA1 of a key and some data 107 */ 108 function core_hmac_sha1(key, data) 109 { 110 var bkey = str2binb(key); 111 if(bkey.length > 16) bkey = core_sha1(bkey, key.length * chrsz); 112 113 var ipad = Array(16), opad = Array(16); 114 for(var i = 0; i < 16; i++) 115 { 116 ipad[i] = bkey[i] ^ 0x36363636; 117 opad[i] = bkey[i] ^ 0x5C5C5C5C; 118 } 119 120 var hash = core_sha1(ipad.concat(str2binb(data)), 512 + data.length * chrsz); 121 return core_sha1(opad.concat(hash), 512 + 160); 122 } 123 124 /* 125 * Add integers, wrapping at 2^32. This uses 16-bit operations internally 126 * to work around bugs in some JS interpreters. 127 */ 128 function safe_add(x, y) 129 { 130 var lsw = (x & 0xFFFF) + (y & 0xFFFF); 131 var msw = (x >> 16) + (y >> 16) + (lsw >> 16); 132 return (msw << 16) | (lsw & 0xFFFF); 133 } 134 135 /* 136 * Bitwise rotate a 32-bit number to the left. 137 */ 138 function rol(num, cnt) 139 { 140 return (num << cnt) | (num >>> (32 - cnt)); 141 } 142 143 /* 144 * Convert an 8-bit or 16-bit string to an array of big-endian words 145 * In 8-bit function, characters >255 have their hi-byte silently ignored. 146 */ 147 function str2binb(str) 148 { 149 var bin = Array(); 150 var mask = (1 << chrsz) - 1; 151 for(var i = 0; i < str.length * chrsz; i += chrsz) 152 bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i%32); 153 return bin; 154 } 155 156 /* 157 * Convert an array of big-endian words to a string 158 */ 159 function binb2str(bin) 160 { 161 var str = ""; 162 var mask = (1 << chrsz) - 1; 163 for(var i = 0; i < bin.length * 32; i += chrsz) 164 str += String.fromCharCode((bin[i>>5] >>> (32 - chrsz - i%32)) & mask); 165 return str; 166 } 167 168 /* 169 * Convert an array of big-endian words to a hex string. 170 */ 171 function binb2hex(binarray) 172 { 173 var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; 174 var str = ""; 175 for(var i = 0; i < binarray.length * 4; i++) 176 { 177 str += hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8+4)) & 0xF) + 178 hex_tab.charAt((binarray[i>>2] >> ((3 - i%4)*8 )) & 0xF); 179 } 180 return str; 181 } 182 183 /* 184 * Convert an array of big-endian words to a base-64 string 185 */ 186 function binb2b64(binarray) 187 { 188 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; 189 var str = ""; 190 for(var i = 0; i < binarray.length * 4; i += 3) 191 { 192 var triplet = (((binarray[i >> 2] >> 8 * (3 - i %4)) & 0xFF) << 16) 193 | (((binarray[i+1 >> 2] >> 8 * (3 - (i+1)%4)) & 0xFF) << 8 ) 194 | ((binarray[i+2 >> 2] >> 8 * (3 - (i+2)%4)) & 0xFF); 195 for(var j = 0; j < 4; j++) 196 { 197 if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; 198 else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); 199 } 200 } 201 return str; 202 }
3.md5
js调用：
hex_md5("abc")
js源码：
1 /*md5 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 hex_md5(s){ return binl2hex(core_md5(str2binl(s), s.length * chrsz));} 23 function b64_md5(s){ return binl2b64(core_md5(str2binl(s), s.length * chrsz));} 24 function str_md5(s){ return binl2str(core_md5(str2binl(s), s.length * chrsz));} 25 function hex_hmac_md5(key, data) { return binl2hex(core_hmac_md5(key, data)); } 26 function b64_hmac_md5(key, data) { return binl2b64(core_hmac_md5(key, data)); } 27 function str_hmac_md5(key, data) { return binl2str(core_hmac_md5(key, data)); } 28 29 /* 30 * Perform a simple self-test to see if the VM is working 31 */ 32 function md5_vm_test() 33 { 34 return hex_md5("abc") == "900150983cd24fb0d6963f7d28e17f72"; 35 } 36 37 /* 38 * Calculate the MD5 of an array of little-endian words, and a bit length 39 */ 40 function core_md5(x, len) 41 { 42 /* append padding */ 43 x[len >> 5] |= 0x80 << ((len) % 32); 44 x[(((len + 64) >>> 9) << 4) + 14] = len; 45 46 var a = 1732584193; 47 var b = -271733879; 48 var c = -1732584194; 49 var d = 271733878; 50 51 for(var i = 0; i < x.length; i += 16) 52 { 53 var olda = a; 54 var oldb = b; 55 var oldc = c; 56 var oldd = d; 57 58 a = md5_ff(a, b, c, d, x[i+ 0], 7 , -680876936); 59 d = md5_ff(d, a, b, c, x[i+ 1], 12, -389564586); 60 c = md5_ff(c, d, a, b, x[i+ 2], 17, 606105819); 61 b = md5_ff(b, c, d, a, x[i+ 3], 22, -1044525330); 62 a = md5_ff(a, b, c, d, x[i+ 4], 7 , -176418897); 63 d = md5_ff(d, a, b, c, x[i+ 5], 12, 1200080426); 64 c = md5_ff(c, d, a, b, x[i+ 6], 17, -1473231341); 65 b = md5_ff(b, c, d, a, x[i+ 7], 22, -45705983); 66 a = md5_ff(a, b, c, d, x[i+ 8], 7 , 1770035416); 67 d = md5_ff(d, a, b, c, x[i+ 9], 12, -1958414417); 68 c = md5_ff(c, d, a, b, x[i+10], 17, -42063); 69 b = md5_ff(b, c, d, a, x[i+11], 22, -1990404162); 70 a = md5_ff(a, b, c, d, x[i+12], 7 , 1804603682); 71 d = md5_ff(d, a, b, c, x[i+13], 12, -40341101); 72 c = md5_ff(c, d, a, b, x[i+14], 17, -1502002290); 73 b = md5_ff(b, c, d, a, x[i+15], 22, 1236535329); 74 75 a = md5_gg(a, b, c, d, x[i+ 1], 5 , -165796510); 76 d = md5_gg(d, a, b, c, x[i+ 6], 9 , -1069501632); 77 c = md5_gg(c, d, a, b, x[i+11], 14, 643717713); 78 b = md5_gg(b, c, d, a, x[i+ 0], 20, -373897302); 79 a = md5_gg(a, b, c, d, x[i+ 5], 5 , -701558691); 80 d = md5_gg(d, a, b, c, x[i+10], 9 , 38016083); 81 c = md5_gg(c, d, a, b, x[i+15], 14, -660478335); 82 b = md5_gg(b, c, d, a, x[i+ 4], 20, -405537848); 83 a = md5_gg(a, b, c, d, x[i+ 9], 5 , 568446438); 84 d = md5_gg(d, a, b, c, x[i+14], 9 , -1019803690); 85 c = md5_gg(c, d, a, b, x[i+ 3], 14, -187363961); 86 b = md5_gg(b, c, d, a, x[i+ 8], 20, 1163531501); 87 a = md5_gg(a, b, c, d, x[i+13], 5 , -1444681467); 88 d = md5_gg(d, a, b, c, x[i+ 2], 9 , -51403784); 89 c = md5_gg(c, d, a, b, x[i+ 7], 14, 1735328473); 90 b = md5_gg(b, c, d, a, x[i+12], 20, -1926607734); 91 92 a = md5_hh(a, b, c, d, x[i+ 5], 4 , -378558); 93 d = md5_hh(d, a, b, c, x[i+ 8], 11, -2022574463); 94 c = md5_hh(c, d, a, b, x[i+11], 16, 1839030562); 95 b = md5_hh(b, c, d, a, x[i+14], 23, -35309556); 96 a = md5_hh(a, b, c, d, x[i+ 1], 4 , -1530992060); 97 d = md5_hh(d, a, b, c, x[i+ 4], 11, 1272893353); 98 c = md5_hh(c, d, a, b, x[i+ 7], 16, -155497632); 99 b = md5_hh(b, c, d, a, x[i+10], 23, -1094730640); 100 a = md5_hh(a, b, c, d, x[i+13], 4 , 681279174); 101 d = md5_hh(d, a, b, c, x[i+ 0], 11, -358537222); 102 c = md5_hh(c, d, a, b, x[i+ 3], 16, -722521979); 103 b = md5_hh(b, c, d, a, x[i+ 6], 23, 76029189); 104 a = md5_hh(a, b, c, d, x[i+ 9], 4 , -640364487); 105 d = md5_hh(d, a, b, c, x[i+12], 11, -421815835); 106 c = md5_hh(c, d, a, b, x[i+15], 16, 530742520); 107 b = md5_hh(b, c, d, a, x[i+ 2], 23, -995338651); 108 109 a = md5_ii(a, b, c, d, x[i+ 0], 6 , -198630844); 110 d = md5_ii(d, a, b, c, x[i+ 7], 10, 1126891415); 111 c = md5_ii(c, d, a, b, x[i+14], 15, -1416354905); 112 b = md5_ii(b, c, d, a, x[i+ 5], 21, -57434055); 113 a = md5_ii(a, b, c, d, x[i+12], 6 , 1700485571); 114 d = md5_ii(d, a, b, c, x[i+ 3], 10, -1894986606); 115 c = md5_ii(c, d, a, b, x[i+10], 15, -1051523); 116 b = md5_ii(b, c, d, a, x[i+ 1], 21, -2054922799); 117 a = md5_ii(a, b, c, d, x[i+ 8], 6 , 1873313359); 118 d = md5_ii(d, a, b, c, x[i+15], 10, -30611744); 119 c = md5_ii(c, d, a, b, x[i+ 6], 15, -1560198380); 120 b = md5_ii(b, c, d, a, x[i+13], 21, 1309151649); 121 a = md5_ii(a, b, c, d, x[i+ 4], 6 , -145523070); 122 d = md5_ii(d, a, b, c, x[i+11], 10, -1120210379); 123 c = md5_ii(c, d, a, b, x[i+ 2], 15, 718787259); 124 b = md5_ii(b, c, d, a, x[i+ 9], 21, -343485551); 125 126 a = safe_add(a, olda); 127 b = safe_add(b, oldb); 128 c = safe_add(c, oldc); 129 d = safe_add(d, oldd); 130 } 131 return Array(a, b, c, d); 132 133 } 134 135 /* 136 * These functions implement the four basic operations the algorithm uses. 137 */ 138 function md5_cmn(q, a, b, x, s, t) 139 { 140 return safe_add(bit_rol(safe_add(safe_add(a, q), safe_add(x, t)), s),b); 141 } 142 function md5_ff(a, b, c, d, x, s, t) 143 { 144 return md5_cmn((b & c) | ((~b) & d), a, b, x, s, t); 145 } 146 function md5_gg(a, b, c, d, x, s, t) 147 { 148 return md5_cmn((b & d) | (c & (~d)), a, b, x, s, t); 149 } 150 function md5_hh(a, b, c, d, x, s, t) 151 { 152 return md5_cmn(b ^ c ^ d, a, b, x, s, t); 153 } 154 function md5_ii(a, b, c, d, x, s, t) 155 { 156 return md5_cmn(c ^ (b | (~d)), a, b, x, s, t); 157 } 158 159 /* 160 * Calculate the HMAC-MD5, of a key and some data 161 */ 162 function core_hmac_md5(key, data) 163 { 164 var bkey = str2binl(key); 165 if(bkey.length > 16) bkey = core_md5(bkey, key.length * chrsz); 166 167 var ipad = Array(16), opad = Array(16); 168 for(var i = 0; i < 16; i++) 169 { 170 ipad[i] = bkey[i] ^ 0x36363636; 171 opad[i] = bkey[i] ^ 0x5C5C5C5C; 172 } 173 174 var hash = core_md5(ipad.concat(str2binl(data)), 512 + data.length * chrsz); 175 return core_md5(opad.concat(hash), 512 + 128); 176 } 177 178 /* 179 * Add integers, wrapping at 2^32. This uses 16-bit operations internally 180 * to work around bugs in some JS interpreters. 181 */ 182 function safe_add(x, y) 183 { 184 var lsw = (x & 0xFFFF) + (y & 0xFFFF); 185 var msw = (x >> 16) + (y >> 16) + (lsw >> 16); 186 return (msw << 16) | (lsw & 0xFFFF); 187 } 188 189 /* 190 * Bitwise rotate a 32-bit number to the left. 191 */ 192 function bit_rol(num, cnt) 193 { 194 return (num << cnt) | (num >>> (32 - cnt)); 195 } 196 197 /* 198 * Convert a string to an array of little-endian words 199 * If chrsz is ASCII, characters >255 have their hi-byte silently ignored. 200 */ 201 function str2binl(str) 202 { 203 var bin = Array(); 204 var mask = (1 << chrsz) - 1; 205 for(var i = 0; i < str.length * chrsz; i += chrsz) 206 bin[i>>5] |= (str.charCodeAt(i / chrsz) & mask) << (i%32); 207 return bin; 208 } 209 210 /* 211 * Convert an array of little-endian words to a string 212 */ 213 function binl2str(bin) 214 { 215 var str = ""; 216 var mask = (1 << chrsz) - 1; 217 for(var i = 0; i < bin.length * 32; i += chrsz) 218 str += String.fromCharCode((bin[i>>5] >>> (i % 32)) & mask); 219 return str; 220 } 221 222 /* 223 * Convert an array of little-endian words to a hex string. 224 */ 225 function binl2hex(binarray) 226 { 227 var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef"; 228 var str = ""; 229 for(var i = 0; i < binarray.length * 4; i++) 230 { 231 str += hex_tab.charAt((binarray[i>>2] >> ((i%4)*8+4)) & 0xF) + 232 hex_tab.charAt((binarray[i>>2] >> ((i%4)*8 )) & 0xF); 233 } 234 return str; 235 } 236 237 /* 238 * Convert an array of little-endian words to a base-64 string 239 */ 240 function binl2b64(binarray) 241 { 242 var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/"; 243 var str = ""; 244 for(var i = 0; i < binarray.length * 4; i += 3) 245 { 246 var triplet = (((binarray[i >> 2] >> 8 * ( i %4)) & 0xFF) << 16) 247 | (((binarray[i+1 >> 2] >> 8 * ((i+1)%4)) & 0xFF) << 8 ) 248 | ((binarray[i+2 >> 2] >> 8 * ((i+2)%4)) & 0xFF); 249 for(var j = 0; j < 4; j++) 250 { 251 if(i * 8 + j * 6 > binarray.length * 32) str += b64pad; 252 else str += tab.charAt((triplet >> 6*(3-j)) & 0x3F); 253 } 254 } 255 return str; 256 }