xpz2018
4 years ago
5 changed files with 7 additions and 208 deletions
Split View
Diff Options
-
2libs/md5.min.js
-
1pages/home/password/index.js
-
3pages/mall/fragment/index.js
-
4pages/moment/fragment/index.js
-
205utils/md5.js
@ -0,0 +1,2 @@ |
|||
!function(n){"use strict";function d(n,t){var r=(65535&n)+(65535&t);return(n>>16)+(t>>16)+(r>>16)<<16|65535&r}function f(n,t,r,e,o,u){return d((c=d(d(t,n),d(e,u)))<<(f=o)|c>>>32-f,r);var c,f}function l(n,t,r,e,o,u,c){return f(t&r|~t&e,n,t,o,u,c)}function v(n,t,r,e,o,u,c){return f(t&e|r&~e,n,t,o,u,c)}function g(n,t,r,e,o,u,c){return f(t^r^e,n,t,o,u,c)}function m(n,t,r,e,o,u,c){return f(r^(t|~e),n,t,o,u,c)}function i(n,t){var r,e,o,u;n[t>>5]|=128<<t%32,n[14+(t+64>>>9<<4)]=t;for(var c=1732584193,f=-271733879,i=-1732584194,a=271733878,h=0;h<n.length;h+=16)c=l(r=c,e=f,o=i,u=a,n[h],7,-680876936),a=l(a,c,f,i,n[h+1],12,-389564586),i=l(i,a,c,f,n[h+2],17,606105819),f=l(f,i,a,c,n[h+3],22,-1044525330),c=l(c,f,i,a,n[h+4],7,-176418897),a=l(a,c,f,i,n[h+5],12,1200080426),i=l(i,a,c,f,n[h+6],17,-1473231341),f=l(f,i,a,c,n[h+7],22,-45705983),c=l(c,f,i,a,n[h+8],7,1770035416),a=l(a,c,f,i,n[h+9],12,-1958414417),i=l(i,a,c,f,n[h+10],17,-42063),f=l(f,i,a,c,n[h+11],22,-1990404162),c=l(c,f,i,a,n[h+12],7,1804603682),a=l(a,c,f,i,n[h+13],12,-40341101),i=l(i,a,c,f,n[h+14],17,-1502002290),c=v(c,f=l(f,i,a,c,n[h+15],22,1236535329),i,a,n[h+1],5,-165796510),a=v(a,c,f,i,n[h+6],9,-1069501632),i=v(i,a,c,f,n[h+11],14,643717713),f=v(f,i,a,c,n[h],20,-373897302),c=v(c,f,i,a,n[h+5],5,-701558691),a=v(a,c,f,i,n[h+10],9,38016083),i=v(i,a,c,f,n[h+15],14,-660478335),f=v(f,i,a,c,n[h+4],20,-405537848),c=v(c,f,i,a,n[h+9],5,568446438),a=v(a,c,f,i,n[h+14],9,-1019803690),i=v(i,a,c,f,n[h+3],14,-187363961),f=v(f,i,a,c,n[h+8],20,1163531501),c=v(c,f,i,a,n[h+13],5,-1444681467),a=v(a,c,f,i,n[h+2],9,-51403784),i=v(i,a,c,f,n[h+7],14,1735328473),c=g(c,f=v(f,i,a,c,n[h+12],20,-1926607734),i,a,n[h+5],4,-378558),a=g(a,c,f,i,n[h+8],11,-2022574463),i=g(i,a,c,f,n[h+11],16,1839030562),f=g(f,i,a,c,n[h+14],23,-35309556),c=g(c,f,i,a,n[h+1],4,-1530992060),a=g(a,c,f,i,n[h+4],11,1272893353),i=g(i,a,c,f,n[h+7],16,-155497632),f=g(f,i,a,c,n[h+10],23,-1094730640),c=g(c,f,i,a,n[h+13],4,681279174),a=g(a,c,f,i,n[h],11,-358537222),i=g(i,a,c,f,n[h+3],16,-722521979),f=g(f,i,a,c,n[h+6],23,76029189),c=g(c,f,i,a,n[h+9],4,-640364487),a=g(a,c,f,i,n[h+12],11,-421815835),i=g(i,a,c,f,n[h+15],16,530742520),c=m(c,f=g(f,i,a,c,n[h+2],23,-995338651),i,a,n[h],6,-198630844),a=m(a,c,f,i,n[h+7],10,1126891415),i=m(i,a,c,f,n[h+14],15,-1416354905),f=m(f,i,a,c,n[h+5],21,-57434055),c=m(c,f,i,a,n[h+12],6,1700485571),a=m(a,c,f,i,n[h+3],10,-1894986606),i=m(i,a,c,f,n[h+10],15,-1051523),f=m(f,i,a,c,n[h+1],21,-2054922799),c=m(c,f,i,a,n[h+8],6,1873313359),a=m(a,c,f,i,n[h+15],10,-30611744),i=m(i,a,c,f,n[h+6],15,-1560198380),f=m(f,i,a,c,n[h+13],21,1309151649),c=m(c,f,i,a,n[h+4],6,-145523070),a=m(a,c,f,i,n[h+11],10,-1120210379),i=m(i,a,c,f,n[h+2],15,718787259),f=m(f,i,a,c,n[h+9],21,-343485551),c=d(c,r),f=d(f,e),i=d(i,o),a=d(a,u);return[c,f,i,a]}function a(n){for(var t="",r=32*n.length,e=0;e<r;e+=8)t+=String.fromCharCode(n[e>>5]>>>e%32&255);return t}function h(n){var t=[];for(t[(n.length>>2)-1]=void 0,e=0;e<t.length;e+=1)t[e]=0;for(var r=8*n.length,e=0;e<r;e+=8)t[e>>5]|=(255&n.charCodeAt(e/8))<<e%32;return t}function e(n){for(var t,r="0123456789abcdef",e="",o=0;o<n.length;o+=1)t=n.charCodeAt(o),e+=r.charAt(t>>>4&15)+r.charAt(15&t);return e}function r(n){return unescape(encodeURIComponent(n))}function o(n){return a(i(h(t=r(n)),8*t.length));var t}function u(n,t){return function(n,t){var r,e,o=h(n),u=[],c=[];for(u[15]=c[15]=void 0,16<o.length&&(o=i(o,8*n.length)),r=0;r<16;r+=1)u[r]=909522486^o[r],c[r]=1549556828^o[r];return e=i(u.concat(h(t)),512+8*t.length),a(i(c.concat(e),640))}(r(n),r(t))}function t(n,t,r){return t?r?u(t,n):e(u(t,n)):r?o(n):e(o(n))}"function"==typeof define&&define.amd?define(function(){return t}):"object"==typeof module&&module.exports?module.exports=t:n.md5=t}(this); |
|||
//# sourceMappingURL=md5.min.js.map
|
|||
@ -1,205 +0,0 @@ |
|||
/* |
|||
* A JavaScript implementation of the RSA Data Security, Inc. MD5 Message |
|||
* Digest Algorithm, as defined in RFC 1321. |
|||
* Version 1.1 Copyright (C) Paul Johnston 1999 - 2002. |
|||
* Code also contributed by Greg Holt |
|||
* See http://pajhome.org.uk/site/legal.html for details.
|
|||
*/ |
|||
|
|||
/* |
|||
* Add integers, wrapping at 2^32. This uses 16-bit operations internally |
|||
* to work around bugs in some JS interpreters. |
|||
*/ |
|||
function safe_add(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)) |
|||
} |
|||
|
|||
/* |
|||
* These functions implement the four basic operations the algorithm uses. |
|||
*/ |
|||
function cmn(q, a, b, x, s, t) { |
|||
return safe_add(rol(safe_add(safe_add(a, q), safe_add(x, t)), s), b) |
|||
} |
|||
function ff(a, b, c, d, x, s, t) { |
|||
return cmn((b & c) | ((~b) & d), a, b, x, s, t) |
|||
} |
|||
function gg(a, b, c, d, x, s, t) { |
|||
return cmn((b & d) | (c & (~d)), a, b, x, s, t) |
|||
} |
|||
function hh(a, b, c, d, x, s, t) { |
|||
return cmn(b ^ c ^ d, a, b, x, s, t) |
|||
} |
|||
function ii(a, b, c, d, x, s, t) { |
|||
return cmn(c ^ (b | (~d)), a, b, x, s, t) |
|||
} |
|||
|
|||
/* |
|||
* Calculate the MD5 of an array of little-endian words, producing an array |
|||
* of little-endian words. |
|||
*/ |
|||
function coreMD5(x) { |
|||
var a = 1732584193 |
|||
var b = -271733879 |
|||
var c = -1732584194 |
|||
var d = 271733878 |
|||
|
|||
for (var i = 0; i < x.length; i += 16) { |
|||
var olda = a |
|||
var oldb = b |
|||
var oldc = c |
|||
var oldd = d |
|||
|
|||
a = ff(a, b, c, d, x[i + 0], 7, -680876936) |
|||
d = ff(d, a, b, c, x[i + 1], 12, -389564586) |
|||
c = ff(c, d, a, b, x[i + 2], 17, 606105819) |
|||
b = ff(b, c, d, a, x[i + 3], 22, -1044525330) |
|||
a = ff(a, b, c, d, x[i + 4], 7, -176418897) |
|||
d = ff(d, a, b, c, x[i + 5], 12, 1200080426) |
|||
c = ff(c, d, a, b, x[i + 6], 17, -1473231341) |
|||
b = ff(b, c, d, a, x[i + 7], 22, -45705983) |
|||
a = ff(a, b, c, d, x[i + 8], 7, 1770035416) |
|||
d = ff(d, a, b, c, x[i + 9], 12, -1958414417) |
|||
c = ff(c, d, a, b, x[i + 10], 17, -42063) |
|||
b = ff(b, c, d, a, x[i + 11], 22, -1990404162) |
|||
a = ff(a, b, c, d, x[i + 12], 7, 1804603682) |
|||
d = ff(d, a, b, c, x[i + 13], 12, -40341101) |
|||
c = ff(c, d, a, b, x[i + 14], 17, -1502002290) |
|||
b = ff(b, c, d, a, x[i + 15], 22, 1236535329) |
|||
|
|||
a = gg(a, b, c, d, x[i + 1], 5, -165796510) |
|||
d = gg(d, a, b, c, x[i + 6], 9, -1069501632) |
|||
c = gg(c, d, a, b, x[i + 11], 14, 643717713) |
|||
b = gg(b, c, d, a, x[i + 0], 20, -373897302) |
|||
a = gg(a, b, c, d, x[i + 5], 5, -701558691) |
|||
d = gg(d, a, b, c, x[i + 10], 9, 38016083) |
|||
c = gg(c, d, a, b, x[i + 15], 14, -660478335) |
|||
b = gg(b, c, d, a, x[i + 4], 20, -405537848) |
|||
a = gg(a, b, c, d, x[i + 9], 5, 568446438) |
|||
d = gg(d, a, b, c, x[i + 14], 9, -1019803690) |
|||
c = gg(c, d, a, b, x[i + 3], 14, -187363961) |
|||
b = gg(b, c, d, a, x[i + 8], 20, 1163531501) |
|||
a = gg(a, b, c, d, x[i + 13], 5, -1444681467) |
|||
d = gg(d, a, b, c, x[i + 2], 9, -51403784) |
|||
c = gg(c, d, a, b, x[i + 7], 14, 1735328473) |
|||
b = gg(b, c, d, a, x[i + 12], 20, -1926607734) |
|||
|
|||
a = hh(a, b, c, d, x[i + 5], 4, -378558) |
|||
d = hh(d, a, b, c, x[i + 8], 11, -2022574463) |
|||
c = hh(c, d, a, b, x[i + 11], 16, 1839030562) |
|||
b = hh(b, c, d, a, x[i + 14], 23, -35309556) |
|||
a = hh(a, b, c, d, x[i + 1], 4, -1530992060) |
|||
d = hh(d, a, b, c, x[i + 4], 11, 1272893353) |
|||
c = hh(c, d, a, b, x[i + 7], 16, -155497632) |
|||
b = hh(b, c, d, a, x[i + 10], 23, -1094730640) |
|||
a = hh(a, b, c, d, x[i + 13], 4, 681279174) |
|||
d = hh(d, a, b, c, x[i + 0], 11, -358537222) |
|||
c = hh(c, d, a, b, x[i + 3], 16, -722521979) |
|||
b = hh(b, c, d, a, x[i + 6], 23, 76029189) |
|||
a = hh(a, b, c, d, x[i + 9], 4, -640364487) |
|||
d = hh(d, a, b, c, x[i + 12], 11, -421815835) |
|||
c = hh(c, d, a, b, x[i + 15], 16, 530742520) |
|||
b = hh(b, c, d, a, x[i + 2], 23, -995338651) |
|||
|
|||
a = ii(a, b, c, d, x[i + 0], 6, -198630844) |
|||
d = ii(d, a, b, c, x[i + 7], 10, 1126891415) |
|||
c = ii(c, d, a, b, x[i + 14], 15, -1416354905) |
|||
b = ii(b, c, d, a, x[i + 5], 21, -57434055) |
|||
a = ii(a, b, c, d, x[i + 12], 6, 1700485571) |
|||
d = ii(d, a, b, c, x[i + 3], 10, -1894986606) |
|||
c = ii(c, d, a, b, x[i + 10], 15, -1051523) |
|||
b = ii(b, c, d, a, x[i + 1], 21, -2054922799) |
|||
a = ii(a, b, c, d, x[i + 8], 6, 1873313359) |
|||
d = ii(d, a, b, c, x[i + 15], 10, -30611744) |
|||
c = ii(c, d, a, b, x[i + 6], 15, -1560198380) |
|||
b = ii(b, c, d, a, x[i + 13], 21, 1309151649) |
|||
a = ii(a, b, c, d, x[i + 4], 6, -145523070) |
|||
d = ii(d, a, b, c, x[i + 11], 10, -1120210379) |
|||
c = ii(c, d, a, b, x[i + 2], 15, 718787259) |
|||
b = ii(b, c, d, a, x[i + 9], 21, -343485551) |
|||
|
|||
a = safe_add(a, olda) |
|||
b = safe_add(b, oldb) |
|||
c = safe_add(c, oldc) |
|||
d = safe_add(d, oldd) |
|||
} |
|||
return [a, b, c, d] |
|||
} |
|||
|
|||
/* |
|||
* Convert an array of little-endian words to a hex string. |
|||
*/ |
|||
function binl2hex(binarray) { |
|||
var hex_tab = "0123456789abcdef" |
|||
var str = "" |
|||
for (var i = 0; i < binarray.length * 4; i++) { |
|||
str += hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8 + 4)) & 0xF) + |
|||
hex_tab.charAt((binarray[i >> 2] >> ((i % 4) * 8)) & 0xF) |
|||
} |
|||
return str |
|||
} |
|||
|
|||
/* |
|||
* Convert an array of little-endian words to a base64 encoded string. |
|||
*/ |
|||
function binl2b64(binarray) { |
|||
var tab = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/" |
|||
var str = "" |
|||
for (var i = 0; i < binarray.length * 32; i += 6) { |
|||
str += tab.charAt(((binarray[i >> 5] << (i % 32)) & 0x3F) | |
|||
((binarray[i >> 5 + 1] >> (32 - i % 32)) & 0x3F)) |
|||
} |
|||
return str |
|||
} |
|||
|
|||
/* |
|||
* Convert an 8-bit character string to a sequence of 16-word blocks, stored |
|||
* as an array, and append appropriate padding for MD4/5 calculation. |
|||
* If any of the characters are >255, the high byte is silently ignored. |
|||
*/ |
|||
function str2binl(str) { |
|||
var nblk = ((str.length + 8) >> 6) + 1 // number of 16-word blocks
|
|||
var blks = new Array(nblk * 16) |
|||
for (var i = 0; i < nblk * 16; i++) blks[i] = 0 |
|||
for (var i = 0; i < str.length; i++) |
|||
blks[i >> 2] |= (str.charCodeAt(i) & 0xFF) << ((i % 4) * 8) |
|||
blks[i >> 2] |= 0x80 << ((i % 4) * 8) |
|||
blks[nblk * 16 - 2] = str.length * 8 |
|||
return blks |
|||
} |
|||
|
|||
/* |
|||
* Convert a wide-character string to a sequence of 16-word blocks, stored as |
|||
* an array, and append appropriate padding for MD4/5 calculation. |
|||
*/ |
|||
function strw2binl(str) { |
|||
var nblk = ((str.length + 4) >> 5) + 1 // number of 16-word blocks
|
|||
var blks = new Array(nblk * 16) |
|||
for (var i = 0; i < nblk * 16; i++) blks[i] = 0 |
|||
for (var i = 0; i < str.length; i++) |
|||
blks[i >> 1] |= str.charCodeAt(i) << ((i % 2) * 16) |
|||
blks[i >> 1] |= 0x80 << ((i % 2) * 16) |
|||
blks[nblk * 16 - 2] = str.length * 16 |
|||
return blks |
|||
} |
|||
|
|||
/* |
|||
* External interface |
|||
*/ |
|||
function hexMD5(str) { return binl2hex(coreMD5(str2binl(str))) } |
|||
function hexMD5w(str) { return binl2hex(coreMD5(strw2binl(str))) } |
|||
function b64MD5(str) { return binl2b64(coreMD5(str2binl(str))) } |
|||
function b64MD5w(str) { return binl2b64(coreMD5(strw2binl(str))) } |
|||
/* Backward compatibility */ |
|||
function calcMD5(str) { return binl2hex(coreMD5(str2binl(str))) } |
|||
module.exports = { |
|||
hexMD5: hexMD5 |
|||
} |
|||
Write
Preview
Loading…
Cancel
Save