blocks|key|265215|text|我自己没有验证过这一点，但你可以看看这个JavaScript+implementation+of+Java's+String.hashCode()+method。看起来相当短小。|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|265216|使用此原型，您可以简单地对任何字符串调用.hashCode()，例如"some+string".hashCode()，并获得一个数值哈希码(更具体地说，是|style|CODE|265217|等效码)，如1395333309。|blockquote|265218|265219|265220|String.prototype.hashCode+=+function()+{
++++var+hash+=+0;
++++if+(this.length+==+0)+{
++++++++return+hash;
++++}
++++for+(var+i+=+0;+i+<+this.length;+i%2B%2B)+{
++++++++var+char+=+this.charCodeAt(i);
++++++++hash+=+((hash<<5)-hash)%2Bchar;
++++++++hash+=+hash+&+hash;+//+Convert+to+32bit+integer
++++}
++++return+hash;
}|code-block|syntax|javascript|265221|entityMap|0|LINK|mutability|MUTABLE|url|http://werxltd.com/wp/2010/05/13/javascript-implementation-of-javas-string-hashcode-method/^0|K|1O|0|0|K|B|Y|O|0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|Z|8|@]|9|@$A|10|B|11|1|12]]|C|$]]|$1|D|3|E|5|6|7|13|8|@$A|14|B|15|F|G]|$A|16|B|17|F|G]]|9|@]|C|$]]|$1|H|3|I|5|J|7|18|8|@]|9|@]|C|$]]|$1|K|3|-4|5|6|7|19|8|@]|9|@]|C|$]]|$1|L|3|-4|5|6|7|1A|8|@]|9|@]|C|$]]|$1|M|3|N|5|O|7|1B|8|@]|9|@]|C|$P|Q]]|$1|R|3|-4|5|6|7|1C|8|@]|9|@]|C|$]]]|S|$T|$5|U|V|W|C|$X|Y]]]]

I didn't verify this myself, but you can look at this <a href="http://werxltd.com/wp/2010/05/13/javascript-implementation-of-javas-string-hashcode-method/" rel="noreferrer">JavaScript implementation of Java's String.hashCode() method</a>. Seems reasonably short.

<blockquote>
 With this prototype you can simply call <code>.hashCode()</code> on any string, e.g. <code>"some string".hashCode()</code>, and receive a numerical hash code (more specifically, a Java equivalent) such as 1395333309.
</blockquote>

<pre><code>String.prototype.hashCode = function() {
 var hash = 0;
 if (this.length == 0) {
 return hash;
 }
 for (var i = 0; i &lt; this.length; i++) {
 var char = this.charCodeAt(i);
 hash = ((hash&lt;&lt;5)-hash)+char;
 hash = hash &amp; hash; // Convert to 32bit integer
 }
 return hash;
}
</code></pre>

blocks|key|2963926|text|有许多用JS编写的散列函数的实现。例如：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|2963927|http://www.webtoolkit.info/javascript-sha1.html|offset|length|2963928|SHA-256：http://www.webtoolkit.info/javascript-sha256.html|unordered-list-item|2963929|
|2963930|MD5：http://www.webtoolkit.info/javascript-md5.html|2963931|
：|2963932|SHA-1|2963933|2963934|如果你不需要安全性，你也可以使用base64，它不是散列函数，没有固定的输出，可以由用户简单地解码，但看起来更轻量级，可以用于隐藏值：http://www.webtoolkit.info/javascript-base64.html|2963935|entityMap|0|LINK|mutability|MUTABLE|url|1|http://www.webtoolkit.info/javascript-sha256.html|2|http://www.webtoolkit.info/javascript-md5.html|3|http://www.webtoolkit.info/javascript-base64.html^0|0|0|1B|0|0|8|1D|1|0|0|4|1A|2|0|0|0|0|1V|1D|3|0^^$0|@$1|2|3|4|5|6|7|16|8|@]|9|@]|A|$]]|$1|B|3|C|5|6|7|17|8|@]|9|@$D|18|E|19|1|1A]]|A|$]]|$1|F|3|G|5|H|7|1B|8|@]|9|@$D|1C|E|1D|1|1E]]|A|$]]|$1|I|3|J|5|6|7|1F|8|@]|9|@]|A|$]]|$1|K|3|L|5|H|7|1G|8|@]|9|@$D|1H|E|1I|1|1J]]|A|$]]|$1|M|3|N|5|6|7|1K|8|@]|9|@]|A|$]]|$1|O|3|P|5|H|7|1L|8|@]|9|@]|A|$]]|$1|Q|3|-4|5|6|7|1M|8|@]|9|@]|A|$]]|$1|R|3|S|5|6|7|1N|8|@]|9|@$D|1O|E|1P|1|1Q]]|A|$]]|$1|T|3|-4|5|6|7|1R|8|@]|9|@]|A|$]]]|U|$V|$5|W|X|Y|A|$Z|C]]|10|$5|W|X|Y|A|$Z|11]]|12|$5|W|X|Y|A|$Z|13]]|14|$5|W|X|Y|A|$Z|15]]]]

There are many realizations of hash functions written in JS. For example:

<ul>
<li>SHA-1: <a href="http://www.webtoolkit.info/javascript-sha1.html" rel="noreferrer">http://www.webtoolkit.info/javascript-sha1.html</a></li>
<li>SHA-256: <a href="http://www.webtoolkit.info/javascript-sha256.html" rel="noreferrer">http://www.webtoolkit.info/javascript-sha256.html</a></li>
<li>MD5: <a href="http://www.webtoolkit.info/javascript-md5.html" rel="noreferrer">http://www.webtoolkit.info/javascript-md5.html</a></li>
</ul>

If you don't need security, you can also use base64 which is not hash-function, has not fixed output and could be simply decoded by user, but looks more lightweight and could be used for hide values: <a href="http://www.webtoolkit.info/javascript-base64.html" rel="noreferrer">http://www.webtoolkit.info/javascript-base64.html</a>

blocks|key|268874|text|查看这些实现|type|unstyled|depth|inlineStyleRanges|entityRanges|data|268875|268876|http://www.movable-type.co.uk/scripts/sha1.html+(SHA-1+algorithm)|unordered-list-item|offset|length|268877|http://pajhome.org.uk/crypt/md5/+(针对SHA-1、MD5、HMAC等的实现)|268878|268879|entityMap|0|LINK|mutability|MUTABLE|url|http://www.movable-type.co.uk/scripts/sha1.html|1|http://pajhome.org.uk/crypt/md5/^0|0|0|0|1B|0|0|0|W|1|0|0^^$0|@$1|2|3|4|5|6|7|U|8|@]|9|@]|A|$]]|$1|B|3|-4|5|6|7|V|8|@]|9|@]|A|$]]|$1|C|3|D|5|E|7|W|8|@]|9|@$F|X|G|Y|1|Z]]|A|$]]|$1|H|3|I|5|E|7|10|8|@]|9|@$F|11|G|12|1|13]]|A|$]]|$1|J|3|-4|5|6|7|14|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|15|8|@]|9|@]|A|$]]]|L|$M|$5|N|O|P|A|$Q|R]]|S|$5|N|O|P|A|$Q|T]]]]

Check out these implementations

<ul>
<li><a href="http://www.movable-type.co.uk/scripts/sha1.html" rel="noreferrer">http://www.movable-type.co.uk/scripts/sha1.html</a> (SHA-1 algorithm)</li>
<li><a href="http://pajhome.org.uk/crypt/md5/" rel="noreferrer">http://pajhome.org.uk/crypt/md5/</a> (implementations for SHA-1, MD5, HMAC and others)</li>
</ul>

blocks|key|3177806|text|简单对象散列器：|type|unstyled|depth|inlineStyleRanges|entityRanges|data|3177807|(function+()+{
++++Number.prototype.toHex+=+function+()+{
++++++++var+ret+=+((this<0?0x8:0)%2B((this+>>+28)+&+0x7)).toString(16)+%2B+(this+&+0xfffffff).toString(16);
++++++++while+(ret.length+<+8)+ret+=+'0'%2Bret;
++++++++return+ret;
++++};
++++Object.hashCode+=+function+hashCode(o,+l)+{
++++++++l+=+l+%7C%7C+2;
++++++++var+i,+c,+r+=+[];
++++++++for+(i=0;+i<l;+i%2B%2B)
++++++++++++r.push(i*268803292);
++++++++function+stringify(o)+{
++++++++++++var+i,r;
++++++++++++if+(o+===+null)+return+'n';
++++++++++++if+(o+===+true)+return+'t';
++++++++++++if+(o+===+false)+return+'f';
++++++++++++if+(o+instanceof+Date)+return+'d:'%2B(0%2Bo);
++++++++++++i=typeof+o;
++++++++++++if+(i+===+'string')+return+'s:'%2Bo.replace(/([\\\\;])/g,'\\$1');
++++++++++++if+(i+===+'number')+return+'n:'%2Bo;
++++++++++++if+(o+instanceof+Function)+return+'m:'%2Bo.toString().replace(/([\\\\;])/g,'\\$1');
++++++++++++if+(o+instanceof+Array)+{
++++++++++++++++r=[];
++++++++++++++++for+(i=0;+i<o.length;+i%2B%2B)+
++++++++++++++++++++r.push(stringify(o[i]));
++++++++++++++++return+'a:'%2Br.join(';');
++++++++++++}
++++++++++++r=[];
++++++++++++for+(i+in+o)+{
++++++++++++++++r.push(i%2B':'%2Bstringify(o[i]))
++++++++++++}
++++++++++++return+'o:'%2Br.join(';');
++++++++}
++++++++o+=+stringify(o);
++++++++for+(i=0;+i<o.length;+i%2B%2B)+{
++++++++++++for+(c=0;+c<r.length;+c%2B%2B)+{
++++++++++++++++r[c]+=+(r[c]+<<+13)-(r[c]+>>+19);
++++++++++++++++r[c]+%2B=+o.charCodeAt(i)+<<+(r[c]+%25+24);
++++++++++++++++r[c]+=+r[c]+&+r[c];
++++++++++++}
++++++++}
++++++++for+(i=0;+i<r.length;+i%2B%2B)+{
++++++++++++r[i]+=+r[i].toHex();
++++++++}
++++++++return+r.join('');
++++}
}());|code-block|syntax|javascript|3177808|这里的核心是stringifier，它简单地将任何对象转换为唯一的字符串。然后，hashCode遍历该对象，将字符串化对象的字符散列在一起。|3177809|对于额外的点，导出stringifier并创建一个解析器。|3177810|entityMap^0|0|0|0|0^^$0|@$1|2|3|4|5|6|7|M|8|@]|9|@]|A|$]]|$1|B|3|C|5|D|7|N|8|@]|9|@]|A|$E|F]]|$1|G|3|H|5|6|7|O|8|@]|9|@]|A|$]]|$1|I|3|J|5|6|7|P|8|@]|9|@]|A|$]]|$1|K|3|-4|5|6|7|Q|8|@]|9|@]|A|$]]]|L|$]]

Simple object hasher:

<pre><code>(function () {
 Number.prototype.toHex = function () {
 var ret = ((this&lt;0?0x8:0)+((this &gt;&gt; 28) &amp; 0x7)).toString(16) + (this &amp; 0xfffffff).toString(16);
 while (ret.length &lt; 8) ret = '0'+ret;
 return ret;
 };
 Object.hashCode = function hashCode(o, l) {
 l = l || 2;
 var i, c, r = [];
 for (i=0; i&lt;l; i++)
 r.push(i*268803292);
 function stringify(o) {
 var i,r;
 if (o === null) return 'n';
 if (o === true) return 't';
 if (o === false) return 'f';
 if (o instanceof Date) return 'd:'+(0+o);
 i=typeof o;
 if (i === 'string') return 's:'+o.replace(/([\\\\;])/g,'\\$1');
 if (i === 'number') return 'n:'+o;
 if (o instanceof Function) return 'm:'+o.toString().replace(/([\\\\;])/g,'\\$1');
 if (o instanceof Array) {
 r=[];
 for (i=0; i&lt;o.length; i++) 
 r.push(stringify(o[i]));
 return 'a:'+r.join(';');
 }
 r=[];
 for (i in o) {
 r.push(i+':'+stringify(o[i]))
 }
 return 'o:'+r.join(';');
 }
 o = stringify(o);
 for (i=0; i&lt;o.length; i++) {
 for (c=0; c&lt;r.length; c++) {
 r[c] = (r[c] &lt;&lt; 13)-(r[c] &gt;&gt; 19);
 r[c] += o.charCodeAt(i) &lt;&lt; (r[c] % 24);
 r[c] = r[c] &amp; r[c];
 }
 }
 for (i=0; i&lt;r.length; i++) {
 r[i] = r[i].toHex();
 }
 return r.join('');
 }
}());
</code></pre>

The meat here is the stringifier, which simply converts any object into a unique string. hashCode then runs over the object, hashing together the characters of the stringified object.

For extra points, export the stringifier and create a parser.

blocks|key|267513|text|//+Simple+but+unreliable+function+to+create+string+hash+by+Sergey.Shuchkin+[t]+gmail.com
//+alert(+strhash('http://www.w3schools.com/js/default.asp')+);+//+6mn6tf7st333r2q4o134o58888888888
function+strhash(+str+)+{
++++if+(str.length+%25+32+>+0)+str+%2B=+Array(33+-+str.length+%25+32).join("z");
++++var+hash+=+'',+bytes+=+[],+i+=+j+=+k+=+a+=+0,+dict+=+['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','1','2','3','4','5','6','7','8','9'];
++++for+(i+=+0;+i+<+str.length;+i%2B%2B+)+{
++++++++ch+=+str.charCodeAt(i);
++++++++bytes[j%2B%2B]+=+(ch+<+127)+?+ch+&+0xFF+:+127;
++++}
++++var+chunk_len+=+Math.ceil(bytes.length+/+32);+++
++++for+(i=0;+i<bytes.length;+i%2B%2B)+{
++++++++j+%2B=+bytes[i];
++++++++k%2B%2B;
++++++++if+((k+==+chunk_len)+%7C%7C+(i+==+bytes.length-1))+{
++++++++++++a+=+Math.floor(+j+/+k+);
++++++++++++if+(a+<+32)
++++++++++++++++hash+%2B=+'0';
++++++++++++else+if+(a+>+126)
++++++++++++++++hash+%2B=+'z';
++++++++++++else
++++++++++++++++hash+%2B=+dict[++Math.floor(+(a-32)+/+2.76)+];
++++++++++++j+=+k+=+0;
++++++++}
++++}
++++return+hash;
}|type|code-block|depth|inlineStyleRanges|entityRanges|data|syntax|javascript|267514|unstyled|entityMap^0|0^^$0|@$1|2|3|4|5|6|7|G|8|@]|9|@]|A|$B|C]]|$1|D|3|-4|5|E|7|H|8|@]|9|@]|A|$]]]|F|$]]

<pre><code>// Simple but unreliable function to create string hash by Sergey.Shuchkin [t] gmail.com
// alert( strhash('http://www.w3schools.com/js/default.asp') ); // 6mn6tf7st333r2q4o134o58888888888
function strhash( str ) {
 if (str.length % 32 &gt; 0) str += Array(33 - str.length % 32).join("z");
 var hash = '', bytes = [], i = j = k = a = 0, dict = ['a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','1','2','3','4','5','6','7','8','9'];
 for (i = 0; i &lt; str.length; i++ ) {
 ch = str.charCodeAt(i);
 bytes[j++] = (ch &lt; 127) ? ch &amp; 0xFF : 127;
 }
 var chunk_len = Math.ceil(bytes.length / 32); 
 for (i=0; i&lt;bytes.length; i++) {
 j += bytes[i];
 k++;
 if ((k == chunk_len) || (i == bytes.length-1)) {
 a = Math.floor( j / k );
 if (a &lt; 32)
 hash += '0';
 else if (a &gt; 126)
 hash += 'z';
 else
 hash += dict[ Math.floor( (a-32) / 2.76) ];
 j = k = 0;
 }
 }
 return hash;
}
</code></pre>

blocks|key|3177621|text|看看这个MD5+implementation+for+JavaScript。它的BSD许可并且非常容易使用。示例：|type|unstyled|depth|inlineStyleRanges|entityRanges|offset|length|data|3177622|md5+=+hex_md5("message+to+digest")|code-block|syntax|javascript|3177623|entityMap|0|LINK|mutability|MUTABLE|url|http://pajhome.org.uk/crypt/md5/^0|4|X|0|0|0^^$0|@$1|2|3|4|5|6|7|Q|8|@]|9|@$A|R|B|S|1|T]]|C|$]]|$1|D|3|E|5|F|7|U|8|@]|9|@]|C|$G|H]]|$1|I|3|-4|5|6|7|V|8|@]|9|@]|C|$]]]|J|$K|$5|L|M|N|C|$O|P]]]]

Check out this <a href="http://pajhome.org.uk/crypt/md5/" rel="nofollow">MD5 implementation for JavaScript</a>. Its BSD Licensed and really easy to use. Example:

<pre><code>md5 = hex_md5("message to digest")
</code></pre>

<blockquote>
 Possible Duplicate: 
 <a href="https://stackoverflow.com/questions/7616461/generate-a-hash-from-string-in-javascript-jquery">Generate a Hash from string in Javascript/jQuery</a> 
</blockquote>



Can anyone suggest a simple (i.e. tens of lines of code, not hundreds of lines) hash function written in (browser-compatible) JavaScript? Ideally I'd like something that, when passed a string as input, produces something similar to the 32 character hexadecimal string that's the typical output of MD5, SHA1, etc. It doesn't have to be cryptographically secure, just reasonably resistant to collisions. (My initial use case is URLs, but I'll probably want to use it on other strings in the future.)

Simple (non-secure) hash function for JavaScript?

哈希函数

 可能重复：有没有人能建议一个用(浏览器兼容的) JavaScript编写的简单的(即几十行代码，而不是几百行)哈希函数？理想情况下，我希望当传递一个字符串作为输入时，产生类似于32个字符的十六进制字符串的东西，这是MD5，SHA1等的典型输出。它不必是密码安全的，只需合理地抵抗冲突。(我最初的用例是URL，但将来我可能希望在其他字符串上使用它。)

问JavaScript的简单(不安全)哈希函数？
EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问JavaScript的简单(不安全)哈希函数？EN

回答 6

Stack Overflow用户

Stack Overflow用户

Stack Overflow用户

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问JavaScript的简单(不安全)哈希函数？
EN