mirror of
https://github.com/emn178/js-md5.git
synced 2026-08-12 20:31:43 +08:00
Compare commits
| Author | SHA1 | Date | |
|---|---|---|---|
 Chen Yi-Cyuan
|
d1af3f6065 | ||
|
Chen Yi-Cyuan
|
41432a9660 | ||
|
Chen Yi-Cyuan
|
e36b8d13f7 | ||
|
Chen Yi-Cyuan
|
f0a2360989 | ||
|
Chen Yi-Cyuan
|
f5eb89ccb2 | ||
|
Chen Yi-Cyuan
|
5cf8fc9215 | ||
|
Chen Yi-Cyuan
|
96036975f7 | ||
|
emn178
|
dca3e8c59d | ||
|
Chen Yi-Cyuan
|
807a492830 | ||
|
Chen Yi-Cyuan
|
ca6b36b0ec | ||
|
Chen Yi-Cyuan
|
5bc2fd9a54 | ||
|
Chen Yi-Cyuan
|
316a103aa1 | ||
|
Chen Yi-Cyuan
|
d934165952 | ||
|
Chen Yi-Cyuan
|
ff56bdedc7 |
+5
-4
@@ -3,10 +3,11 @@ node_js:
|
||||
- "0.11"
|
||||
- "0.10"
|
||||
- "0.8"
|
||||
install:
|
||||
before_install:
|
||||
- npm install mocha -g
|
||||
- npm install coveralls -g
|
||||
- npm install mocha-lcov-reporter -g
|
||||
- npm install
|
||||
script:
|
||||
- npm run-script coveralls
|
||||
script: npm run-script coveralls
|
||||
branches:
|
||||
only:
|
||||
- master
|
||||
|
||||
@@ -1,3 +1,26 @@
|
||||
# v0.3.0 / 2015-03-07
|
||||
|
||||
* Support byte Array, Uint8Array and ArrayBuffer input.
|
||||
|
||||
# v0.2.2 / 2015-02-01
|
||||
|
||||
* Fixed bug when special length.
|
||||
* Improve performance for node.js.
|
||||
|
||||
# v0.2.1 / 2015-01-13
|
||||
|
||||
* Improve performance.
|
||||
|
||||
# v0.2.0 / 2015-01-12
|
||||
|
||||
* Remove ascii parameter.
|
||||
* Improve performance.
|
||||
|
||||
# v0.1.4 / 2015-01-11
|
||||
|
||||
* Improve performance.
|
||||
* Add test case.
|
||||
|
||||
# v0.1.3 / 2015-01-05
|
||||
|
||||
* Improve performance.
|
||||
|
||||
@@ -1,8 +1,8 @@
|
||||
# js-md5
|
||||
A simple MD5 hash function for JavaScript supports UTF-8 encoding.
|
||||
[](https://travis-ci.org/emn178/js-md5)
|
||||
[](https://coveralls.io/r/emn178/js-md5?branch=master)
|
||||
[](https://travis-ci.org/emn178/js-md5)
|
||||
[](https://coveralls.io/r/emn178/js-md5?branch=master)
|
||||
[](https://nodei.co/npm/js-md5/)
|
||||
A simple MD5 hash function for JavaScript supports UTF-8 encoding.
|
||||
|
||||
## Demo
|
||||
[MD5 Online](http://emn178.github.io/online-tools/md5.html)
|
||||
@@ -11,10 +11,10 @@ A simple MD5 hash function for JavaScript supports UTF-8 encoding.
|
||||
[Compress](https://raw.github.com/emn178/js-md5/master/build/md5.min.js)
|
||||
[Uncompress](https://raw.github.com/emn178/js-md5/master/src/md5.js)
|
||||
|
||||
## Install
|
||||
## Installation
|
||||
You can also install js-md5 by using Bower.
|
||||
|
||||
bower install js-md5
|
||||
bower install md5
|
||||
|
||||
For node.js, you can use this command to install:
|
||||
|
||||
@@ -30,26 +30,12 @@ If you use node.js, you should require the module first:
|
||||
md5 = require('js-md5');
|
||||
```
|
||||
|
||||
### Methods
|
||||
|
||||
#### md5(str, asciiOnly)
|
||||
|
||||
Hash string to md5, set asciiOnly to true for better performace if you ensure input is ascii.
|
||||
|
||||
##### *str: `String`*
|
||||
|
||||
String to hash.
|
||||
|
||||
##### *asciiOnly: `Boolean` (default: `false`)*
|
||||
|
||||
Specify the string encoding is ASCII.
|
||||
|
||||
## Example
|
||||
Code
|
||||
```JavaScript
|
||||
md5('');
|
||||
md5('The quick brown fox jumps over the lazy dog', true);
|
||||
md5('The quick brown fox jumps over the lazy dog.', true);
|
||||
md5('The quick brown fox jumps over the lazy dog');
|
||||
md5('The quick brown fox jumps over the lazy dog.');
|
||||
```
|
||||
Output
|
||||
|
||||
@@ -67,9 +53,21 @@ Output
|
||||
|
||||
a7bac2239fcdcb3a067903d8077c4a07
|
||||
|
||||
It also supports byte `Array`, `Uint8Array`, `ArrayBuffer` input:
|
||||
|
||||
Code
|
||||
```JavaScript
|
||||
md5([]);
|
||||
md5(new Uint8Array([]));
|
||||
```
|
||||
Output
|
||||
|
||||
d41d8cd98f00b204e9800998ecf8427e
|
||||
d41d8cd98f00b204e9800998ecf8427e
|
||||
|
||||
## Benchmark
|
||||
[ASCII](http://jsperf.com/md5-ascii/4)
|
||||
[UTF8](http://jsperf.com/md5-utf8/3)
|
||||
[UTF8](http://jsperf.com/md5-shootout/81)
|
||||
[ASCII](http://jsperf.com/md5-shootout/82)
|
||||
|
||||
## Extensions
|
||||
### jQuery
|
||||
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "js-md5",
|
||||
"version": "0.1.3",
|
||||
"version": "0.3.0",
|
||||
"main": ["build/md5.min.js"],
|
||||
"ignore": [
|
||||
"samples",
|
||||
|
||||
Vendored
+22
-10
@@ -1,10 +1,22 @@
|
||||
(function(m,v){var t="0123456789abcdef".split(""),u=function(h,l){var e,k=1732584193,n=4023233417,p=2562383102,q=271733878,b,d,a,c,g;if(!l&&/[^\x00-\x7F]/.test(h)){e=[];for(d=b=0;d<h.length;d++)a=h.charCodeAt(d),128>a?e[b++]=a:(2048>a?e[b++]=192|a>>6:(55296>a||57344<=a?e[b++]=224|a>>12:(a=65536+((a&1023)<<10|h.charCodeAt(++d)&1023),e[b++]=240|a>>18,e[b++]=128|a>>12&63),e[b++]=128|a>>6&63),e[b++]=128|a&63);b=e.length;d=(b+8>>6)+1<<4;a=[];for(c=0;c<d;++c)a[c]=0;for(c=0;c<b;++c)a[c>>2]|=e[c]<<((c&3)<<
|
||||
3);a[c>>2]|=128<<((c&3)<<3);a[d-2]=b<<3;e=a}else{e=h.length;b=(e+8>>6)+1<<4;d=[];for(a=0;a<b;++a)d[a]=0;for(a=0;a<e;++a)d[a>>2]|=h.charCodeAt(a)<<((a&3)<<3);d[a>>2]|=128<<((a&3)<<3);d[b-2]=e<<3;e=d}for(var f=0,m=e.length;f<m;f+=16)0===f?(b=e[f+0]-680876937,b=(b<<7|b>>>25)-271733879<<0,c=e[f+1]-117830708+(2004318071&b^-1732584194),c=(c<<12|c>>>20)+b<<0,a=e[f+2]-1126478375+((b^-271733879)&c^-271733879),a=(a<<17|a>>>15)+c<<0,d=e[f+3]-1316259209+((c^b)&a^b)):(b=k,d=n,a=p,c=q,b+=(c^d&(a^c))+e[f+0]-680876936,
|
||||
b=(b<<7|b>>>25)+d<<0,c+=(a^b&(d^a))+e[f+1]-389564586,c=(c<<12|c>>>20)+b<<0,a+=(d^c&(b^d))+e[f+2]+606105819,a=(a<<17|a>>>15)+c<<0,d+=(b^a&(c^b))+e[f+3]-1044525330),d=(d<<22|d>>>10)+a<<0,b+=(c^d&(a^c))+e[f+4]-176418897,b=(b<<7|b>>>25)+d<<0,c+=(a^b&(d^a))+e[f+5]+1200080426,c=(c<<12|c>>>20)+b<<0,a+=(d^c&(b^d))+e[f+6]-1473231341,a=(a<<17|a>>>15)+c<<0,d+=(b^a&(c^b))+e[f+7]-45705983,d=(d<<22|d>>>10)+a<<0,b+=(c^d&(a^c))+e[f+8]+1770035416,b=(b<<7|b>>>25)+d<<0,c+=(a^b&(d^a))+e[f+9]-1958414417,c=(c<<12|c>>>
|
||||
20)+b<<0,a+=(d^c&(b^d))+e[f+10]-42063,a=(a<<17|a>>>15)+c<<0,d+=(b^a&(c^b))+e[f+11]-1990404162,d=(d<<22|d>>>10)+a<<0,b+=(c^d&(a^c))+e[f+12]+1804603682,b=(b<<7|b>>>25)+d<<0,c+=(a^b&(d^a))+e[f+13]-40341101,c=(c<<12|c>>>20)+b<<0,a+=(d^c&(b^d))+e[f+14]-1502002290,a=(a<<17|a>>>15)+c<<0,d+=(b^a&(c^b))+e[f+15]+1236535329,d=(d<<22|d>>>10)+a<<0,b+=(a^c&(d^a))+e[f+1]-165796510,b=(b<<5|b>>>27)+d<<0,c+=(d^a&(b^d))+e[f+6]-1069501632,c=(c<<9|c>>>23)+b<<0,a+=(b^d&(c^b))+e[f+11]+643717713,a=(a<<14|a>>>18)+c<<0,d+=
|
||||
(c^b&(a^c))+e[f+0]-373897302,d=(d<<20|d>>>12)+a<<0,b+=(a^c&(d^a))+e[f+5]-701558691,b=(b<<5|b>>>27)+d<<0,c+=(d^a&(b^d))+e[f+10]+38016083,c=(c<<9|c>>>23)+b<<0,a+=(b^d&(c^b))+e[f+15]-660478335,a=(a<<14|a>>>18)+c<<0,d+=(c^b&(a^c))+e[f+4]-405537848,d=(d<<20|d>>>12)+a<<0,b+=(a^c&(d^a))+e[f+9]+568446438,b=(b<<5|b>>>27)+d<<0,c+=(d^a&(b^d))+e[f+14]-1019803690,c=(c<<9|c>>>23)+b<<0,a+=(b^d&(c^b))+e[f+3]-187363961,a=(a<<14|a>>>18)+c<<0,d+=(c^b&(a^c))+e[f+8]+1163531501,d=(d<<20|d>>>12)+a<<0,b+=(a^c&(d^a))+e[f+
|
||||
13]-1444681467,b=(b<<5|b>>>27)+d<<0,c+=(d^a&(b^d))+e[f+2]-51403784,c=(c<<9|c>>>23)+b<<0,a+=(b^d&(c^b))+e[f+7]+1735328473,a=(a<<14|a>>>18)+c<<0,d+=(c^b&(a^c))+e[f+12]-1926607734,d=(d<<20|d>>>12)+a<<0,g=d^a,b+=(g^c)+e[f+5]-378558,b=(b<<4|b>>>28)+d<<0,g=d^a,c+=(g^b)+e[f+8]-2022574463,c=(c<<11|c>>>21)+b<<0,g=c^b,a+=(g^d)+e[f+11]+1839030562,a=(a<<16|a>>>16)+c<<0,g=c^b,d+=(g^a)+e[f+14]-35309556,d=(d<<23|d>>>9)+a<<0,g=d^a,b+=(g^c)+e[f+1]-1530992060,b=(b<<4|b>>>28)+d<<0,g=d^a,c+=(g^b)+e[f+4]+1272893353,c=
|
||||
(c<<11|c>>>21)+b<<0,g=c^b,a+=(g^d)+e[f+7]-155497632,a=(a<<16|a>>>16)+c<<0,g=c^b,d+=(g^a)+e[f+10]-1094730640,d=(d<<23|d>>>9)+a<<0,g=d^a,b+=(g^c)+e[f+13]+681279174,b=(b<<4|b>>>28)+d<<0,g=d^a,c+=(g^b)+e[f+0]-358537222,c=(c<<11|c>>>21)+b<<0,g=c^b,a+=(g^d)+e[f+3]-722521979,a=(a<<16|a>>>16)+c<<0,g=c^b,d+=(g^a)+e[f+6]+76029189,d=(d<<23|d>>>9)+a<<0,g=d^a,b+=(g^c)+e[f+9]-640364487,b=(b<<4|b>>>28)+d<<0,g=d^a,c+=(g^b)+e[f+12]-421815835,c=(c<<11|c>>>21)+b<<0,g=c^b,a+=(g^d)+e[f+15]+530742520,a=(a<<16|a>>>16)+
|
||||
c<<0,g=c^b,d+=(g^a)+e[f+2]-995338651,d=(d<<23|d>>>9)+a<<0,b+=(a^(d|~c))+e[f+0]-198630844,b=(b<<6|b>>>26)+d<<0,c+=(d^(b|~a))+e[f+7]+1126891415,c=(c<<10|c>>>22)+b<<0,a+=(b^(c|~d))+e[f+14]-1416354905,a=(a<<15|a>>>17)+c<<0,d+=(c^(a|~b))+e[f+5]-57434055,d=(d<<21|d>>>11)+a<<0,b+=(a^(d|~c))+e[f+12]+1700485571,b=(b<<6|b>>>26)+d<<0,c+=(d^(b|~a))+e[f+3]-1894986606,c=(c<<10|c>>>22)+b<<0,a+=(b^(c|~d))+e[f+10]-1051523,a=(a<<15|a>>>17)+c<<0,d+=(c^(a|~b))+e[f+1]-2054922799,d=(d<<21|d>>>11)+a<<0,b+=(a^(d|~c))+e[f+
|
||||
8]+1873313359,b=(b<<6|b>>>26)+d<<0,c+=(d^(b|~a))+e[f+15]-30611744,c=(c<<10|c>>>22)+b<<0,a+=(b^(c|~d))+e[f+6]-1560198380,a=(a<<15|a>>>17)+c<<0,d+=(c^(a|~b))+e[f+13]+1309151649,d=(d<<21|d>>>11)+a<<0,b+=(a^(d|~c))+e[f+4]-145523070,b=(b<<6|b>>>26)+d<<0,c+=(d^(b|~a))+e[f+11]-1120210379,c=(c<<10|c>>>22)+b<<0,a+=(b^(c|~d))+e[f+2]+718787259,a=(a<<15|a>>>17)+c<<0,d+=(c^(a|~b))+e[f+9]-343485551,d=(d<<21|d>>>11)+a<<0,k=k+b<<0,n=n+d<<0,p=p+a<<0,q=q+c<<0;return r(k)+r(n)+r(p)+r(q)},r=function(h){for(var l="",
|
||||
e=0;4>e;e++)var k=e<<3,l=l+(t[h>>k+4&15]+t[h>>k&15]);return l};"undefined"!=typeof module?module.exports=u:m&&(m.md5=u)})(this);
|
||||
/*
|
||||
* js-md5 v0.3.0
|
||||
* https://github.com/emn178/js-md5
|
||||
*
|
||||
* Copyright 2014-2015, emn178@gmail.com
|
||||
*
|
||||
* Licensed under the MIT license:
|
||||
* http://www.opensource.org/licenses/MIT
|
||||
*/
|
||||
(function(q,F){var u="undefined"!=typeof module;u&&(q=global,q.JS_MD5_TEST&&(q.navigator={userAgent:"Firefox"}));var C=(q.JS_MD5_TEST||!u)&&-1!=navigator.userAgent.indexOf("Firefox"),y=!q.JS_MD5_TEST&&"undefined"!=typeof ArrayBuffer,f="0123456789abcdef".split(""),D=[128,32768,8388608,-2147483648],t=[0,8,16,24],e=[],r;if(y){var A=new ArrayBuffer(68);r=new Uint8Array(A);e=new Uint32Array(A)}var x=function(g){var q="string"!=typeof g;q&&g.constructor==ArrayBuffer&&(g=new Uint8Array(g));var k,l,m,n,b,
|
||||
a,d,c,h,u=!0,x=!1,p=0,v=0,z=0,w=g.length;e[16]=0;do{e[0]=e[16];e[16]=e[1]=e[2]=e[3]=e[4]=e[5]=e[6]=e[7]=e[8]=e[9]=e[10]=e[11]=e[12]=e[13]=e[14]=e[15]=0;if(q)if(y)for(a=v;p<w&&64>a;++p)r[a++]=g[p];else for(a=v;p<w&&64>a;++p)e[a>>2]|=g[p]<<t[a++&3];else if(y)for(a=v;p<w&&64>a;++p)b=g.charCodeAt(p),128>b?r[a++]=b:(2048>b?r[a++]=192|b>>6:(55296>b||57344<=b?r[a++]=224|b>>12:(b=65536+((b&1023)<<10|g.charCodeAt(++p)&1023),r[a++]=240|b>>18,r[a++]=128|b>>12&63),r[a++]=128|b>>6&63),r[a++]=128|b&63);else for(a=
|
||||
v;p<w&&64>a;++p)b=g.charCodeAt(p),128>b?e[a>>2]|=b<<t[a++&3]:(2048>b?e[a>>2]|=(192|b>>6)<<t[a++&3]:(55296>b||57344<=b?e[a>>2]|=(224|b>>12)<<t[a++&3]:(b=65536+((b&1023)<<10|g.charCodeAt(++p)&1023),e[a>>2]|=(240|b>>18)<<t[a++&3],e[a>>2]|=(128|b>>12&63)<<t[a++&3]),e[a>>2]|=(128|b>>6&63)<<t[a++&3]),e[a>>2]|=(128|b&63)<<t[a++&3]);z+=a-v;v=a-64;p==w&&(e[a>>2]|=D[a&3],++p);p>w&&56>a&&(e[14]=z<<3,x=!0);u?(b=e[0]-680876937,b=(b<<7|b>>>25)-271733879<<0,c=(-1732584194^b&2004318071)+e[1]-117830708,c=(c<<12|c>>>
|
||||
20)+b<<0,d=(-271733879^c&(b^-271733879))+e[2]-1126478375,d=(d<<17|d>>>15)+c<<0,a=(b^d&(c^b))+e[3]-1316259209):(b=k,a=l,d=m,c=n,b+=(c^a&(d^c))+e[0]-680876936,b=(b<<7|b>>>25)+a<<0,c+=(d^b&(a^d))+e[1]-389564586,c=(c<<12|c>>>20)+b<<0,d+=(a^c&(b^a))+e[2]+606105819,d=(d<<17|d>>>15)+c<<0,a+=(b^d&(c^b))+e[3]-1044525330);a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[4]-176418897;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[5]+1200080426;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[6]-1473231341;d=(d<<17|d>>>15)+c<<0;a+=(b^d&
|
||||
(c^b))+e[7]-45705983;a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[8]+1770035416;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[9]-1958414417;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[10]-42063;d=(d<<17|d>>>15)+c<<0;a+=(b^d&(c^b))+e[11]-1990404162;a=(a<<22|a>>>10)+d<<0;b+=(c^a&(d^c))+e[12]+1804603682;b=(b<<7|b>>>25)+a<<0;c+=(d^b&(a^d))+e[13]-40341101;c=(c<<12|c>>>20)+b<<0;d+=(a^c&(b^a))+e[14]-1502002290;d=(d<<17|d>>>15)+c<<0;a+=(b^d&(c^b))+e[15]+1236535329;a=(a<<22|a>>>10)+d<<0;b+=(d^c&(a^d))+e[1]-165796510;b=(b<<5|
|
||||
b>>>27)+a<<0;c+=(a^d&(b^a))+e[6]-1069501632;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[11]+643717713;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[0]-373897302;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[5]-701558691;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[10]+38016083;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[15]-660478335;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[4]-405537848;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[9]+568446438;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[14]-1019803690;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[3]-
|
||||
187363961;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[8]+1163531501;a=(a<<20|a>>>12)+d<<0;b+=(d^c&(a^d))+e[13]-1444681467;b=(b<<5|b>>>27)+a<<0;c+=(a^d&(b^a))+e[2]-51403784;c=(c<<9|c>>>23)+b<<0;d+=(b^a&(c^b))+e[7]+1735328473;d=(d<<14|d>>>18)+c<<0;a+=(c^b&(d^c))+e[12]-1926607734;a=(a<<20|a>>>12)+d<<0;h=a^d;b+=(h^c)+e[5]-378558;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[8]-2022574463;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[11]+1839030562;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[14]-35309556;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^
|
||||
c)+e[1]-1530992060;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[4]+1272893353;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[7]-155497632;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[10]-1094730640;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^c)+e[13]+681279174;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[0]-358537222;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[3]-722521979;d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[6]+76029189;a=(a<<23|a>>>9)+d<<0;h=a^d;b+=(h^c)+e[9]-640364487;b=(b<<4|b>>>28)+a<<0;c+=(h^b)+e[12]-421815835;c=(c<<11|c>>>21)+b<<0;h=c^b;d+=(h^a)+e[15]+530742520;
|
||||
d=(d<<16|d>>>16)+c<<0;a+=(h^d)+e[2]-995338651;a=(a<<23|a>>>9)+d<<0;b+=(d^(a|~c))+e[0]-198630844;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[7]+1126891415;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[14]-1416354905;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[5]-57434055;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[12]+1700485571;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[3]-1894986606;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[10]-1051523;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[1]-2054922799;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[8]+1873313359;
|
||||
b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[15]-30611744;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[6]-1560198380;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[13]+1309151649;a=(a<<21|a>>>11)+d<<0;b+=(d^(a|~c))+e[4]-145523070;b=(b<<6|b>>>26)+a<<0;c+=(a^(b|~d))+e[11]-1120210379;c=(c<<10|c>>>22)+b<<0;d+=(b^(c|~a))+e[2]+718787259;d=(d<<15|d>>>17)+c<<0;a+=(c^(d|~b))+e[9]-343485551;a=(a<<21|a>>>11)+d<<0;u?(k=b+1732584193<<0,l=a-271733879<<0,m=d-1732584194<<0,n=c+271733878<<0,u=!1):(k=k+b<<0,l=l+a<<0,m=m+d<<0,n=n+c<<0)}while(!x);
|
||||
return C?(g=f[k>>4&15]+f[k&15],g+=f[k>>12&15]+f[k>>8&15],g+=f[k>>20&15]+f[k>>16&15],g+=f[k>>28&15]+f[k>>24&15],g+=f[l>>4&15]+f[l&15],g+=f[l>>12&15]+f[l>>8&15],g+=f[l>>20&15]+f[l>>16&15],g+=f[l>>28&15]+f[l>>24&15],g+=f[m>>4&15]+f[m&15],g+=f[m>>12&15]+f[m>>8&15],g+=f[m>>20&15]+f[m>>16&15],g+=f[m>>28&15]+f[m>>24&15],g+=f[n>>4&15]+f[n&15],g+=f[n>>12&15]+f[n>>8&15],g+=f[n>>20&15]+f[n>>16&15],g+=f[n>>28&15]+f[n>>24&15]):f[k>>4&15]+f[k&15]+f[k>>12&15]+f[k>>8&15]+f[k>>20&15]+f[k>>16&15]+f[k>>28&15]+f[k>>
|
||||
24&15]+f[l>>4&15]+f[l&15]+f[l>>12&15]+f[l>>8&15]+f[l>>20&15]+f[l>>16&15]+f[l>>28&15]+f[l>>24&15]+f[m>>4&15]+f[m&15]+f[m>>12&15]+f[m>>8&15]+f[m>>20&15]+f[m>>16&15]+f[m>>28&15]+f[m>>24&15]+f[n>>4&15]+f[n&15]+f[n>>12&15]+f[n>>8&15]+f[n>>20&15]+f[n>>16&15]+f[n>>28&15]+f[n>>24&15]};if(!q.JS_MD5_TEST&&u){var B=require("crypto"),E=require("buffer").Buffer;module.exports=function(e){if("string"==typeof e)return 80>=e.length||183>=e.length&&!/[^\x00-\x7F]/.test(e)?x(e):B.createHash("md5").update(e,"utf8").digest("hex");
|
||||
e.constructor==ArrayBuffer&&(e=new Uint8Array(e));return 370>=e.length?x(e):B.createHash("md5").update(new E(e)).digest("hex")}}else q&&(q.md5=x)})(this);
|
||||
|
||||
+1
-1
@@ -1,6 +1,6 @@
|
||||
{
|
||||
"name": "js-md5",
|
||||
"version": "0.1.3",
|
||||
"version": "0.3.0",
|
||||
"description": "A simple MD5 hash function for JavaScript supports UTF-8 encoding.",
|
||||
"main": "src/md5.js",
|
||||
"devDependencies": {
|
||||
|
||||
+305
-230
@@ -1,5 +1,5 @@
|
||||
/*
|
||||
* js-md5 v0.1.3
|
||||
* js-md5 v0.3.0
|
||||
* https://github.com/emn178/js-md5
|
||||
*
|
||||
* Copyright 2014-2015, emn178@gmail.com
|
||||
@@ -10,256 +10,331 @@
|
||||
;(function(root, undefined) {
|
||||
'use strict';
|
||||
|
||||
var HEX_CHARS = '0123456789abcdef'.split('');
|
||||
|
||||
var md5 = function(message, asciiOnly) {
|
||||
var blocks, h0 = 0x67452301, h1 = 0xEFCDAB89, h2 = 0x98BADCFE, h3 = 0x10325476,
|
||||
a, b, c, d, bc, da;
|
||||
if(!asciiOnly && /[^\x00-\x7F]/.test(message)) {
|
||||
blocks = getBlocksFromUtf8(message);
|
||||
} else {
|
||||
blocks = getBlocksFromAscii(message);
|
||||
var NODE_JS = typeof(module) != 'undefined';
|
||||
if(NODE_JS) {
|
||||
root = global;
|
||||
if(root.JS_MD5_TEST) {
|
||||
root.navigator = { userAgent: 'Firefox'};
|
||||
}
|
||||
for(var i = 0, length = blocks.length;i < length;i += 16) {
|
||||
if(i === 0) {
|
||||
a = blocks[i + 0] - 680876937;
|
||||
a = ((a << 7 | a >>> 25) - 271733879) << 0;
|
||||
d = blocks[i + 1] - 117830708 + ((2004318071 & a) ^ -1732584194);
|
||||
d = ((d << 12 | d >>> 20) + a) << 0;
|
||||
c = blocks[i + 2] - 1126478375 + (((a ^ -271733879) & d) ^ -271733879);
|
||||
c = ((c << 17 | c >>> 15) + d) << 0;
|
||||
b = blocks[i + 3] - 1316259209 + (((d ^ a) & c) ^ a);
|
||||
b = ((b << 22 | b >>> 10) + c) << 0;
|
||||
}
|
||||
var FIREFOX = (root.JS_MD5_TEST || !NODE_JS) && navigator.userAgent.indexOf('Firefox') != -1;
|
||||
var ARRAY_BUFFER = !root.JS_MD5_TEST && typeof(ArrayBuffer) != 'undefined';
|
||||
var HEX_CHARS = '0123456789abcdef'.split('');
|
||||
var EXTRA = [128, 32768, 8388608, -2147483648];
|
||||
var SHIFT = [0, 8, 16, 24];
|
||||
|
||||
var blocks = [], buffer8;
|
||||
if(ARRAY_BUFFER) {
|
||||
var buffer = new ArrayBuffer(68);
|
||||
buffer8 = new Uint8Array(buffer);
|
||||
blocks = new Uint32Array(buffer);
|
||||
}
|
||||
|
||||
var md5 = function(message) {
|
||||
var notString = typeof(message) != 'string';
|
||||
if(notString && message.constructor == ArrayBuffer) {
|
||||
message = new Uint8Array(message);
|
||||
}
|
||||
|
||||
var h0, h1, h2, h3, a, b, c, d, bc, da, code, first = true, end = false,
|
||||
index = 0, i, start = 0, bytes = 0, length = message.length;
|
||||
blocks[16] = 0;
|
||||
do {
|
||||
blocks[0] = blocks[16];
|
||||
blocks[16] = blocks[1] = blocks[2] = blocks[3] =
|
||||
blocks[4] = blocks[5] = blocks[6] = blocks[7] =
|
||||
blocks[8] = blocks[9] = blocks[10] = blocks[11] =
|
||||
blocks[12] = blocks[13] = blocks[14] = blocks[15] = 0;
|
||||
if(notString) {
|
||||
if(ARRAY_BUFFER) {
|
||||
for (i = start;index < length && i < 64; ++index) {
|
||||
buffer8[i++] = message[index];
|
||||
}
|
||||
} else {
|
||||
for (i = start;index < length && i < 64; ++index) {
|
||||
blocks[i >> 2] |= message[index] << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
} else {
|
||||
if(ARRAY_BUFFER) {
|
||||
for (i = start;index < length && i < 64; ++index) {
|
||||
code = message.charCodeAt(index);
|
||||
if (code < 0x80) {
|
||||
buffer8[i++] = code;
|
||||
} else if (code < 0x800) {
|
||||
buffer8[i++] = 0xc0 | (code >> 6);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else if (code < 0xd800 || code >= 0xe000) {
|
||||
buffer8[i++] = 0xe0 | (code >> 12);
|
||||
buffer8[i++] = 0x80 | ((code >> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
buffer8[i++] = 0xf0 | (code >> 18);
|
||||
buffer8[i++] = 0x80 | ((code >> 12) & 0x3f);
|
||||
buffer8[i++] = 0x80 | ((code >> 6) & 0x3f);
|
||||
buffer8[i++] = 0x80 | (code & 0x3f);
|
||||
}
|
||||
}
|
||||
} else {
|
||||
for (i = start;index < length && i < 64; ++index) {
|
||||
code = message.charCodeAt(index);
|
||||
if (code < 0x80) {
|
||||
blocks[i >> 2] |= code << SHIFT[i++ & 3];
|
||||
} else if (code < 0x800) {
|
||||
blocks[i >> 2] |= (0xc0 | (code >> 6)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else if (code < 0xd800 || code >= 0xe000) {
|
||||
blocks[i >> 2] |= (0xe0 | (code >> 12)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
} else {
|
||||
code = 0x10000 + (((code & 0x3ff) << 10) | (message.charCodeAt(++index) & 0x3ff));
|
||||
blocks[i >> 2] |= (0xf0 | (code >> 18)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | ((code >> 12) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | ((code >> 6) & 0x3f)) << SHIFT[i++ & 3];
|
||||
blocks[i >> 2] |= (0x80 | (code & 0x3f)) << SHIFT[i++ & 3];
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
bytes += i - start;
|
||||
start = i - 64;
|
||||
if(index == length) {
|
||||
blocks[i >> 2] |= EXTRA[i & 3];
|
||||
++index;
|
||||
}
|
||||
if(index > length && i < 56) {
|
||||
blocks[14] = bytes << 3;
|
||||
end = true;
|
||||
}
|
||||
|
||||
if(first) {
|
||||
a = blocks[0] - 680876937;
|
||||
a = (a << 7 | a >>> 25) - 271733879 << 0;
|
||||
d = (-1732584194 ^ a & 2004318071) + blocks[1] - 117830708;
|
||||
d = (d << 12 | d >>> 20) + a << 0;
|
||||
c = (-271733879 ^ (d & (a ^ -271733879))) + blocks[2] - 1126478375;
|
||||
c = (c << 17 | c >>> 15) + d << 0;
|
||||
b = (a ^ (c & (d ^ a))) + blocks[3] - 1316259209;
|
||||
b = (b << 22 | b >>> 10) + c << 0;
|
||||
} else {
|
||||
a = h0;
|
||||
b = h1;
|
||||
c = h2;
|
||||
d = h3;
|
||||
a += (d ^ (b & (c ^ d))) + blocks[i + 0] - 680876936;
|
||||
a = ((a << 7 | a >>> 25) + b) << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[i + 1] - 389564586;
|
||||
d = ((d << 12 | d >>> 20) + a) << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[i + 2] + 606105819;
|
||||
c = ((c << 17 | c >>> 15) + d) << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[i + 3] - 1044525330;
|
||||
b = ((b << 22 | b >>> 10) + c) << 0;
|
||||
a += (d ^ (b & (c ^ d))) + blocks[0] - 680876936;
|
||||
a = (a << 7 | a >>> 25) + b << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[1] - 389564586;
|
||||
d = (d << 12 | d >>> 20) + a << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[2] + 606105819;
|
||||
c = (c << 17 | c >>> 15) + d << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[3] - 1044525330;
|
||||
b = (b << 22 | b >>> 10) + c << 0;
|
||||
}
|
||||
|
||||
a += (d ^ (b & (c ^ d))) + blocks[i + 4] - 176418897;
|
||||
a = ((a << 7 | a >>> 25) + b) << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[i + 5] + 1200080426;
|
||||
d = ((d << 12 | d >>> 20) + a) << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[i + 6] - 1473231341;
|
||||
c = ((c << 17 | c >>> 15) + d) << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[i + 7] - 45705983;
|
||||
b = ((b << 22 | b >>> 10) + c) << 0;
|
||||
a += (d ^ (b & (c ^ d))) + blocks[i + 8] + 1770035416;
|
||||
a = ((a << 7 | a >>> 25) + b) << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[i + 9] - 1958414417;
|
||||
d = ((d << 12 | d >>> 20) + a) << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[i + 10] - 42063;
|
||||
c = ((c << 17 | c >>> 15) + d) << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[i + 11] - 1990404162;
|
||||
b = ((b << 22 | b >>> 10) + c) << 0;
|
||||
a += (d ^ (b & (c ^ d))) + blocks[i + 12] + 1804603682;
|
||||
a = ((a << 7 | a >>> 25) + b) << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[i + 13] - 40341101;
|
||||
d = ((d << 12 | d >>> 20) + a) << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[i + 14] - 1502002290;
|
||||
c = ((c << 17 | c >>> 15) + d) << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[i + 15] + 1236535329;
|
||||
b = ((b << 22 | b >>> 10) + c) << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[i + 1] - 165796510;
|
||||
a = ((a << 5 | a >>> 27) + b) << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[i + 6] - 1069501632;
|
||||
d = ((d << 9 | d >>> 23) + a) << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[i + 11] + 643717713;
|
||||
c = ((c << 14 | c >>> 18) + d) << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[i + 0] - 373897302;
|
||||
b = ((b << 20 | b >>> 12) + c) << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[i + 5] - 701558691;
|
||||
a = ((a << 5 | a >>> 27) + b) << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[i + 10] + 38016083;
|
||||
d = ((d << 9 | d >>> 23) + a) << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[i + 15] - 660478335;
|
||||
c = ((c << 14 | c >>> 18) + d) << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[i + 4] - 405537848;
|
||||
b = ((b << 20 | b >>> 12) + c) << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[i + 9] + 568446438;
|
||||
a = ((a << 5 | a >>> 27) + b) << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[i + 14] - 1019803690;
|
||||
d = ((d << 9 | d >>> 23) + a) << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[i + 3] - 187363961;
|
||||
c = ((c << 14 | c >>> 18) + d) << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[i + 8] + 1163531501;
|
||||
b = ((b << 20 | b >>> 12) + c) << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[i + 13] - 1444681467;
|
||||
a = ((a << 5 | a >>> 27) + b) << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[i + 2] - 51403784;
|
||||
d = ((d << 9 | d >>> 23) + a) << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[i + 7] + 1735328473;
|
||||
c = ((c << 14 | c >>> 18) + d) << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[i + 12] - 1926607734;
|
||||
b = ((b << 20 | b >>> 12) + c) << 0;
|
||||
a += (d ^ (b & (c ^ d))) + blocks[4] - 176418897;
|
||||
a = (a << 7 | a >>> 25) + b << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[5] + 1200080426;
|
||||
d = (d << 12 | d >>> 20) + a << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[6] - 1473231341;
|
||||
c = (c << 17 | c >>> 15) + d << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[7] - 45705983;
|
||||
b = (b << 22 | b >>> 10) + c << 0;
|
||||
a += (d ^ (b & (c ^ d))) + blocks[8] + 1770035416;
|
||||
a = (a << 7 | a >>> 25) + b << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[9] - 1958414417;
|
||||
d = (d << 12 | d >>> 20) + a << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[10] - 42063;
|
||||
c = (c << 17 | c >>> 15) + d << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[11] - 1990404162;
|
||||
b = (b << 22 | b >>> 10) + c << 0;
|
||||
a += (d ^ (b & (c ^ d))) + blocks[12] + 1804603682;
|
||||
a = (a << 7 | a >>> 25) + b << 0;
|
||||
d += (c ^ (a & (b ^ c))) + blocks[13] - 40341101;
|
||||
d = (d << 12 | d >>> 20) + a << 0;
|
||||
c += (b ^ (d & (a ^ b))) + blocks[14] - 1502002290;
|
||||
c = (c << 17 | c >>> 15) + d << 0;
|
||||
b += (a ^ (c & (d ^ a))) + blocks[15] + 1236535329;
|
||||
b = (b << 22 | b >>> 10) + c << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[1] - 165796510;
|
||||
a = (a << 5 | a >>> 27) + b << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[6] - 1069501632;
|
||||
d = (d << 9 | d >>> 23) + a << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[11] + 643717713;
|
||||
c = (c << 14 | c >>> 18) + d << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[0] - 373897302;
|
||||
b = (b << 20 | b >>> 12) + c << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[5] - 701558691;
|
||||
a = (a << 5 | a >>> 27) + b << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[10] + 38016083;
|
||||
d = (d << 9 | d >>> 23) + a << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[15] - 660478335;
|
||||
c = (c << 14 | c >>> 18) + d << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[4] - 405537848;
|
||||
b = (b << 20 | b >>> 12) + c << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[9] + 568446438;
|
||||
a = (a << 5 | a >>> 27) + b << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[14] - 1019803690;
|
||||
d = (d << 9 | d >>> 23) + a << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[3] - 187363961;
|
||||
c = (c << 14 | c >>> 18) + d << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[8] + 1163531501;
|
||||
b = (b << 20 | b >>> 12) + c << 0;
|
||||
a += (c ^ (d & (b ^ c))) + blocks[13] - 1444681467;
|
||||
a = (a << 5 | a >>> 27) + b << 0;
|
||||
d += (b ^ (c & (a ^ b))) + blocks[2] - 51403784;
|
||||
d = (d << 9 | d >>> 23) + a << 0;
|
||||
c += (a ^ (b & (d ^ a))) + blocks[7] + 1735328473;
|
||||
c = (c << 14 | c >>> 18) + d << 0;
|
||||
b += (d ^ (a & (c ^ d))) + blocks[12] - 1926607734;
|
||||
b = (b << 20 | b >>> 12) + c << 0;
|
||||
bc = b ^ c;
|
||||
a += (bc ^ d) + blocks[i + 5] - 378558;
|
||||
a = ((a << 4 | a >>> 28) + b) << 0;
|
||||
a += (bc ^ d) + blocks[5] - 378558;
|
||||
a = (a << 4 | a >>> 28) + b << 0;
|
||||
d += (bc ^ a) + blocks[8] - 2022574463;
|
||||
d = (d << 11 | d >>> 21) + a << 0;
|
||||
da = d ^ a;
|
||||
c += (da ^ b) + blocks[11] + 1839030562;
|
||||
c = (c << 16 | c >>> 16) + d << 0;
|
||||
b += (da ^ c) + blocks[14] - 35309556;
|
||||
b = (b << 23 | b >>> 9) + c << 0;
|
||||
bc = b ^ c;
|
||||
d += (bc ^ a) + blocks[i + 8] - 2022574463;
|
||||
d = ((d << 11 | d >>> 21) + a) << 0;
|
||||
a += (bc ^ d) + blocks[1] - 1530992060;
|
||||
a = (a << 4 | a >>> 28) + b << 0;
|
||||
d += (bc ^ a) + blocks[4] + 1272893353;
|
||||
d = (d << 11 | d >>> 21) + a << 0;
|
||||
da = d ^ a;
|
||||
c += (da ^ b) + blocks[i + 11] + 1839030562;
|
||||
c = ((c << 16 | c >>> 16) + d) << 0;
|
||||
da = d ^ a;
|
||||
b += (da ^ c) + blocks[i + 14] - 35309556;
|
||||
b = ((b << 23 | b >>> 9) + c) << 0;
|
||||
c += (da ^ b) + blocks[7] - 155497632;
|
||||
c = (c << 16 | c >>> 16) + d << 0;
|
||||
b += (da ^ c) + blocks[10] - 1094730640;
|
||||
b = (b << 23 | b >>> 9) + c << 0;
|
||||
bc = b ^ c;
|
||||
a += (bc ^ d) + blocks[i + 1] - 1530992060;
|
||||
a = ((a << 4 | a >>> 28) + b) << 0;
|
||||
a += (bc ^ d) + blocks[13] + 681279174;
|
||||
a = (a << 4 | a >>> 28) + b << 0;
|
||||
d += (bc ^ a) + blocks[0] - 358537222;
|
||||
d = (d << 11 | d >>> 21) + a << 0;
|
||||
da = d ^ a;
|
||||
c += (da ^ b) + blocks[3] - 722521979;
|
||||
c = (c << 16 | c >>> 16) + d << 0;
|
||||
b += (da ^ c) + blocks[6] + 76029189;
|
||||
b = (b << 23 | b >>> 9) + c << 0;
|
||||
bc = b ^ c;
|
||||
d += (bc ^ a) + blocks[i + 4] + 1272893353;
|
||||
d = ((d << 11 | d >>> 21) + a) << 0;
|
||||
a += (bc ^ d) + blocks[9] - 640364487;
|
||||
a = (a << 4 | a >>> 28) + b << 0;
|
||||
d += (bc ^ a) + blocks[12] - 421815835;
|
||||
d = (d << 11 | d >>> 21) + a << 0;
|
||||
da = d ^ a;
|
||||
c += (da ^ b) + blocks[i + 7] - 155497632;
|
||||
c = ((c << 16 | c >>> 16) + d) << 0;
|
||||
da = d ^ a;
|
||||
b += (da ^ c) + blocks[i + 10] - 1094730640;
|
||||
b = ((b << 23 | b >>> 9) + c) << 0;
|
||||
bc = b ^ c;
|
||||
a += (bc ^ d) + blocks[i + 13] + 681279174;
|
||||
a = ((a << 4 | a >>> 28) + b) << 0;
|
||||
bc = b ^ c;
|
||||
d += (bc ^ a) + blocks[i + 0] - 358537222;
|
||||
d = ((d << 11 | d >>> 21) + a) << 0;
|
||||
da = d ^ a;
|
||||
c += (da ^ b) + blocks[i + 3] - 722521979;
|
||||
c = ((c << 16 | c >>> 16) + d) << 0;
|
||||
da = d ^ a;
|
||||
b += (da ^ c) + blocks[i + 6] + 76029189;
|
||||
b = ((b << 23 | b >>> 9) + c) << 0;
|
||||
bc = b ^ c;
|
||||
a += (bc ^ d) + blocks[i + 9] - 640364487;
|
||||
a = ((a << 4 | a >>> 28) + b) << 0;
|
||||
bc = b ^ c;
|
||||
d += (bc ^ a) + blocks[i + 12] - 421815835;
|
||||
d = ((d << 11 | d >>> 21) + a) << 0;
|
||||
da = d ^ a;
|
||||
c += (da ^ b) + blocks[i + 15] + 530742520;
|
||||
c = ((c << 16 | c >>> 16) + d) << 0;
|
||||
da = d ^ a;
|
||||
b += (da ^ c) + blocks[i + 2] - 995338651;
|
||||
b = ((b << 23 | b >>> 9) + c) << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[i + 0] - 198630844;
|
||||
a = ((a << 6 | a >>> 26) + b) << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[i + 7] + 1126891415;
|
||||
d = ((d << 10 | d >>> 22) + a) << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[i + 14] - 1416354905;
|
||||
c = ((c << 15 | c >>> 17) + d) << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[i + 5] - 57434055;
|
||||
b = ((b << 21 | b >>> 11) + c) << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[i + 12] + 1700485571;
|
||||
a = ((a << 6 | a >>> 26) + b) << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[i + 3] - 1894986606;
|
||||
d = ((d << 10 | d >>> 22) + a) << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[i + 10] - 1051523;
|
||||
c = ((c << 15 | c >>> 17) + d) << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[i + 1] - 2054922799;
|
||||
b = ((b << 21 | b >>> 11) + c) << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[i + 8] + 1873313359;
|
||||
a = ((a << 6 | a >>> 26) + b) << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[i + 15] - 30611744;
|
||||
d = ((d << 10 | d >>> 22) + a) << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[i + 6] - 1560198380;
|
||||
c = ((c << 15 | c >>> 17) + d) << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[i + 13] + 1309151649;
|
||||
b = ((b << 21 | b >>> 11) + c) << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[i + 4] - 145523070;
|
||||
a = ((a << 6 | a >>> 26) + b) << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[i + 11] - 1120210379;
|
||||
d = ((d << 10 | d >>> 22) + a) << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[i + 2] + 718787259;
|
||||
c = ((c << 15 | c >>> 17) + d) << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[i + 9] - 343485551;
|
||||
b = ((b << 21 | b >>> 11) + c) << 0;
|
||||
c += (da ^ b) + blocks[15] + 530742520;
|
||||
c = (c << 16 | c >>> 16) + d << 0;
|
||||
b += (da ^ c) + blocks[2] - 995338651;
|
||||
b = (b << 23 | b >>> 9) + c << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[0] - 198630844;
|
||||
a = (a << 6 | a >>> 26) + b << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[7] + 1126891415;
|
||||
d = (d << 10 | d >>> 22) + a << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[14] - 1416354905;
|
||||
c = (c << 15 | c >>> 17) + d << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[5] - 57434055;
|
||||
b = (b << 21 | b >>> 11) + c << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[12] + 1700485571;
|
||||
a = (a << 6 | a >>> 26) + b << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[3] - 1894986606;
|
||||
d = (d << 10 | d >>> 22) + a << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[10] - 1051523;
|
||||
c = (c << 15 | c >>> 17) + d << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[1] - 2054922799;
|
||||
b = (b << 21 | b >>> 11) + c << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[8] + 1873313359;
|
||||
a = (a << 6 | a >>> 26) + b << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[15] - 30611744;
|
||||
d = (d << 10 | d >>> 22) + a << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[6] - 1560198380;
|
||||
c = (c << 15 | c >>> 17) + d << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[13] + 1309151649;
|
||||
b = (b << 21 | b >>> 11) + c << 0;
|
||||
a += (c ^ (b | ~d)) + blocks[4] - 145523070;
|
||||
a = (a << 6 | a >>> 26) + b << 0;
|
||||
d += (b ^ (a | ~c)) + blocks[11] - 1120210379;
|
||||
d = (d << 10 | d >>> 22) + a << 0;
|
||||
c += (a ^ (d | ~b)) + blocks[2] + 718787259;
|
||||
c = (c << 15 | c >>> 17) + d << 0;
|
||||
b += (d ^ (c | ~a)) + blocks[9] - 343485551;
|
||||
b = (b << 21 | b >>> 11) + c << 0;
|
||||
|
||||
h0 = (h0 + a) << 0;
|
||||
h1 = (h1 + b) << 0;
|
||||
h2 = (h2 + c) << 0;
|
||||
h3 = (h3 + d) << 0;
|
||||
}
|
||||
|
||||
return toHexString(h0) + toHexString(h1) + toHexString(h2) + toHexString(h3);
|
||||
};
|
||||
|
||||
var toHexString = function(num) {
|
||||
var hex = '';
|
||||
for(var i = 0; i < 4; i++) {
|
||||
var offset = i << 3;
|
||||
hex += HEX_CHARS[(num >> (offset + 4)) & 0x0F] + HEX_CHARS[(num >> offset) & 0x0F];
|
||||
}
|
||||
return hex;
|
||||
};
|
||||
|
||||
var getBytesFromUtf8 = function(str) {
|
||||
var bytes = [], index = 0;
|
||||
for (var i = 0;i < str.length; i++) {
|
||||
var c = str.charCodeAt(i);
|
||||
if (c < 0x80) {
|
||||
bytes[index++] = c;
|
||||
} else if (c < 0x800) {
|
||||
bytes[index++] = 0xc0 | (c >> 6);
|
||||
bytes[index++] = 0x80 | (c & 0x3f);
|
||||
} else if (c < 0xd800 || c >= 0xe000) {
|
||||
bytes[index++] = 0xe0 | (c >> 12);
|
||||
bytes[index++] = 0x80 | ((c >> 6) & 0x3f);
|
||||
bytes[index++] = 0x80 | (c & 0x3f);
|
||||
if(first) {
|
||||
h0 = a + 1732584193 << 0;
|
||||
h1 = b - 271733879 << 0;
|
||||
h2 = c - 1732584194 << 0;
|
||||
h3 = d + 271733878 << 0;
|
||||
first = false;
|
||||
} else {
|
||||
c = 0x10000 + (((c & 0x3ff) << 10) | (str.charCodeAt(++i) & 0x3ff));
|
||||
bytes[index++] = 0xf0 | (c >> 18);
|
||||
bytes[index++] = 0x80 | ((c >> 12) & 0x3f);
|
||||
bytes[index++] = 0x80 | ((c >> 6) & 0x3f);
|
||||
bytes[index++] = 0x80 | (c & 0x3f);
|
||||
h0 = h0 + a << 0;
|
||||
h1 = h1 + b << 0;
|
||||
h2 = h2 + c << 0;
|
||||
h3 = h3 + d << 0;
|
||||
}
|
||||
} while(!end);
|
||||
|
||||
if(FIREFOX) {
|
||||
var hex = HEX_CHARS[(h0 >> 4) & 0x0F] + HEX_CHARS[h0 & 0x0F];
|
||||
hex += HEX_CHARS[(h0 >> 12) & 0x0F] + HEX_CHARS[(h0 >> 8) & 0x0F];
|
||||
hex += HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F];
|
||||
hex += HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F];
|
||||
hex += HEX_CHARS[(h1 >> 4) & 0x0F] + HEX_CHARS[h1 & 0x0F];
|
||||
hex += HEX_CHARS[(h1 >> 12) & 0x0F] + HEX_CHARS[(h1 >> 8) & 0x0F];
|
||||
hex += HEX_CHARS[(h1 >> 20) & 0x0F] + HEX_CHARS[(h1 >> 16) & 0x0F];
|
||||
hex += HEX_CHARS[(h1 >> 28) & 0x0F] + HEX_CHARS[(h1 >> 24) & 0x0F];
|
||||
hex += HEX_CHARS[(h2 >> 4) & 0x0F] + HEX_CHARS[h2 & 0x0F];
|
||||
hex += HEX_CHARS[(h2 >> 12) & 0x0F] + HEX_CHARS[(h2 >> 8) & 0x0F];
|
||||
hex += HEX_CHARS[(h2 >> 20) & 0x0F] + HEX_CHARS[(h2 >> 16) & 0x0F];
|
||||
hex += HEX_CHARS[(h2 >> 28) & 0x0F] + HEX_CHARS[(h2 >> 24) & 0x0F];
|
||||
hex += HEX_CHARS[(h3 >> 4) & 0x0F] + HEX_CHARS[h3 & 0x0F];
|
||||
hex += HEX_CHARS[(h3 >> 12) & 0x0F] + HEX_CHARS[(h3 >> 8) & 0x0F];
|
||||
hex += HEX_CHARS[(h3 >> 20) & 0x0F] + HEX_CHARS[(h3 >> 16) & 0x0F];
|
||||
hex += HEX_CHARS[(h3 >> 28) & 0x0F] + HEX_CHARS[(h3 >> 24) & 0x0F];
|
||||
return hex;
|
||||
} else {
|
||||
return HEX_CHARS[(h0 >> 4) & 0x0F] + HEX_CHARS[h0 & 0x0F] +
|
||||
HEX_CHARS[(h0 >> 12) & 0x0F] + HEX_CHARS[(h0 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h0 >> 20) & 0x0F] + HEX_CHARS[(h0 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h0 >> 28) & 0x0F] + HEX_CHARS[(h0 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 4) & 0x0F] + HEX_CHARS[h1 & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 12) & 0x0F] + HEX_CHARS[(h1 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 20) & 0x0F] + HEX_CHARS[(h1 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h1 >> 28) & 0x0F] + HEX_CHARS[(h1 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 4) & 0x0F] + HEX_CHARS[h2 & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 12) & 0x0F] + HEX_CHARS[(h2 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 20) & 0x0F] + HEX_CHARS[(h2 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h2 >> 28) & 0x0F] + HEX_CHARS[(h2 >> 24) & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 4) & 0x0F] + HEX_CHARS[h3 & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 12) & 0x0F] + HEX_CHARS[(h3 >> 8) & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 20) & 0x0F] + HEX_CHARS[(h3 >> 16) & 0x0F] +
|
||||
HEX_CHARS[(h3 >> 28) & 0x0F] + HEX_CHARS[(h3 >> 24) & 0x0F];
|
||||
}
|
||||
return bytes;
|
||||
};
|
||||
|
||||
var getBlocksFromAscii = function(message) {
|
||||
// a block is 32 bits(4 bytes), a chunk is 512 bits(64 bytes)
|
||||
var length = message.length;
|
||||
var chunkCount = ((length + 8) >> 6) + 1;
|
||||
var blockCount = chunkCount << 4; // chunkCount * 16
|
||||
var blocks = [], i;
|
||||
for(i = 0;i < blockCount;++i) {
|
||||
blocks[i] = 0;
|
||||
}
|
||||
for(i = 0;i < length;++i) {
|
||||
blocks[i >> 2] |= message.charCodeAt(i) << ((i & 3) << 3);
|
||||
}
|
||||
blocks[i >> 2] |= 0x80 << ((i & 3) << 3);
|
||||
blocks[blockCount - 2] = length << 3; // length * 8
|
||||
return blocks;
|
||||
};
|
||||
if(!root.JS_MD5_TEST && NODE_JS) {
|
||||
var crypto = require('crypto');
|
||||
var Buffer = require('buffer').Buffer;
|
||||
|
||||
var getBlocksFromUtf8 = function(message) {
|
||||
var bytes = getBytesFromUtf8(message);
|
||||
var length = bytes.length;
|
||||
var chunkCount = ((length + 8) >> 6) + 1;
|
||||
var blockCount = chunkCount << 4; // chunkCount * 16
|
||||
var blocks = [], i;
|
||||
for(i = 0;i < blockCount;++i) {
|
||||
blocks[i] = 0;
|
||||
}
|
||||
for(i = 0;i < length;++i) {
|
||||
blocks[i >> 2] |= bytes[i] << ((i & 3) << 3);
|
||||
}
|
||||
blocks[i >> 2] |= 0x80 << ((i & 3) << 3);
|
||||
blocks[blockCount - 2] = length << 3; // length * 8
|
||||
return blocks;
|
||||
};
|
||||
|
||||
if(typeof(module) != 'undefined') {
|
||||
module.exports = md5;
|
||||
module.exports = function(message) {
|
||||
if(typeof(message) == 'string') {
|
||||
if(message.length <= 80) {
|
||||
return md5(message);
|
||||
} else if(message.length <= 183 && !/[^\x00-\x7F]/.test(message)) {
|
||||
return md5(message);
|
||||
}
|
||||
return crypto.createHash('md5').update(message, 'utf8').digest('hex');
|
||||
}
|
||||
if(message.constructor == ArrayBuffer) {
|
||||
message = new Uint8Array(message);
|
||||
}
|
||||
if(message.length <= 370) {
|
||||
return md5(message);
|
||||
}
|
||||
return crypto.createHash('md5').update(new Buffer(message)).digest('hex');
|
||||
};
|
||||
} else if(root) {
|
||||
root.md5 = md5;
|
||||
}
|
||||
|
||||
@@ -1,3 +1,11 @@
|
||||
md5 = require('../src/md5.js');
|
||||
expect = require('expect.js');
|
||||
require('./test.js');
|
||||
|
||||
delete require.cache[require.resolve('../src/md5.js')]
|
||||
delete require.cache[require.resolve('./test.js')]
|
||||
md5 = null
|
||||
|
||||
JS_MD5_TEST = true;
|
||||
require('../src/md5.js');
|
||||
require('./test.js');
|
||||
|
||||
+62
-21
@@ -1,30 +1,71 @@
|
||||
describe('ascii', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('')).to.be('d41d8cd98f00b204e9800998ecf8427e');
|
||||
expect(md5('The quick brown fox jumps over the lazy dog')).to.be('9e107d9d372bb6826bd81d3542a419d6');
|
||||
expect(md5('The quick brown fox jumps over the lazy dog.')).to.be('e4d909c290d0fb1ca068ffaddf22cbd0');
|
||||
(function(md5) {
|
||||
describe('md5', function() {
|
||||
describe('ascii', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('')).to.be('d41d8cd98f00b204e9800998ecf8427e');
|
||||
expect(md5('The quick brown fox jumps over the lazy dog')).to.be('9e107d9d372bb6826bd81d3542a419d6');
|
||||
expect(md5('The quick brown fox jumps over the lazy dog.')).to.be('e4d909c290d0fb1ca068ffaddf22cbd0');
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('The MD5 message-digest algorithm is a widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number. MD5 has been utilized in a wide variety of cryptographic applications, and is also commonly used to verify data integrity.')).to.be('f63872ef7bc97a8a8eadba6f0881de53');
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('UTF8', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('中文')).to.be('a7bac2239fcdcb3a067903d8077c4a07');
|
||||
expect(md5('aécio')).to.be('ec3edbf3b05a449fc206a0138c739c3b');
|
||||
expect(md5('𠜎')).to.be('b90869aaf121210f6c563973fa855650');
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一')).to.be('edce615b179e6e29be23145b77ebbd61');
|
||||
expect(md5('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('ad36c9ab669a0ba9ce46d3ce9134de34');
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('special length', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('0123456780123456780123456780123456780123456780123456780')).to.be('a119de63e4b2398427da06dd780263b3');
|
||||
expect(md5('01234567801234567801234567801234567801234567801234567801')).to.be('ddafd84ebe63aebc4626b037a569d78b');
|
||||
expect(md5('0123456780123456780123456780123456780123456780123456780123456780')).to.be('9ea04d743618797ce464445b5785a630');
|
||||
expect(md5('01234567801234567801234567801234567801234567801234567801234567801234567')).to.be('658d914ae42c4938874b2e786ccda479');
|
||||
expect(md5('012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('a083a3710d685793f1f17988bfe3c175');
|
||||
expect(md5('012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678012345678')).to.be('2b21a843cfc31c8026a0d835bc91bc98');
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('The MD5 message-digest algorithm is a widely used cryptographic hash function producing a 128-bit (16-byte) hash value, typically expressed in text format as a 32 digit hexadecimal number. MD5 has been utilized in a wide variety of cryptographic applications, and is also commonly used to verify data integrity.')).to.be('f63872ef7bc97a8a8eadba6f0881de53');
|
||||
describe('Array', function() {
|
||||
describe('Array', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5([])).to.be('d41d8cd98f00b204e9800998ecf8427e');
|
||||
expect(md5([0])).to.be('93b885adfe0da089cdf634904fd59f71');
|
||||
expect(md5([84, 104, 101, 32, 113, 117, 105, 99, 107, 32, 98, 114, 111, 119, 110, 32, 102, 111, 120, 32, 106, 117, 109, 112, 115, 32, 111, 118, 101, 114, 32, 116, 104, 101, 32, 108, 97, 122, 121, 32, 100, 111, 103])).to.be('9e107d9d372bb6826bd81d3542a419d6');
|
||||
});
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('UTF8', function() {
|
||||
describe('less than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('中文')).to.be('a7bac2239fcdcb3a067903d8077c4a07');
|
||||
expect(md5('aécio')).to.be('ec3edbf3b05a449fc206a0138c739c3b');
|
||||
describe('Uint8Array', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5(new Uint8Array([]))).to.be('d41d8cd98f00b204e9800998ecf8427e');
|
||||
expect(md5(new Uint8Array(371))).to.be('58f494c2a0fb65332110fb62ae5c4a74');
|
||||
});
|
||||
});
|
||||
});
|
||||
|
||||
describe('more than 64 bytes', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5('訊息摘要演算法第五版（英語：Message-Digest Algorithm 5，縮寫為MD5），是當前電腦領域用於確保資訊傳輸完整一致而廣泛使用的雜湊演算法之一（又譯雜湊演算法、摘要演算法等），主流程式語言普遍已有MD5的實作。')).to.be('ad36c9ab669a0ba9ce46d3ce9134de34');
|
||||
describe('ArrayBuffer', function() {
|
||||
it('should be successful', function() {
|
||||
expect(md5(new ArrayBuffer(0))).to.be('d41d8cd98f00b204e9800998ecf8427e');
|
||||
expect(md5(new ArrayBuffer(1))).to.be('93b885adfe0da089cdf634904fd59f71');
|
||||
});
|
||||
});
|
||||
});
|
||||
});
|
||||
})(md5);
|
||||
|
||||
Reference in New Issue
Block a user