开启辅助访问 切换到宽版

精易论坛

 找回密码
 注册

QQ登录

只需一步,快速开始

用微信号发送消息登录论坛

新人指南 邀请好友注册 - 我关注人的新帖 教你赚取精币 - 每日签到


求职/招聘- 论坛接单- 开发者大厅

论坛版规 总版规 - 建议/投诉 - 应聘版主 - 精华帖总集 积分说明 - 禁言标准 - 有奖举报

查看: 2080|回复: 9
收起左侧

[易语言纯源码] 中关村JS解密

[复制链接]
结帖率:0% (0/2)
发表于 2019-4-21 01:19:23 | 显示全部楼层 |阅读模式   江苏省镇江市
分享源码
界面截图:
是否带模块: -
备注说明: -
采用(密码+“zol”)取MD5加密方式
  
var CryptoJS = CryptoJS ||
function (o, q) {
var l = {},
m = l.lib = {},
n = m.Base = function () {
function a () {}
return {
extend: function (e) {
a.prototype = this;
var c = new a;
e && c.mixIn (e);
c.$super = this;
return c
},
create: function () {
var a = this.extend ();
a.init.apply (a, arguments);
return a
},
init: function () {},
mixIn: function (a) {
for (var c in a) a.hasOwnProperty (c) && (this[c] = a[c]);
a.hasOwnProperty ("toString") && (this.toString = a.toString)
},
clone: function () {
return this.$super.extend (this)
}
}
} (),
j = m.WordArray = n.extend ({
init: function (a, e) {
a = this.words = a || [];
this.sigBytes = e != q ? e: 4 * a.length
},
toString: function (a) {
return (a || r).stringify (this)
},
concat: function (a) {
var e = this.words,
c = a.words,
d = this.sigBytes,
a = a.sigBytes;
this.clamp ();
if (d % 4) for (var b = 0; b < a; b++) e[d + b >>> 2] |= (c[b >>> 2] >>> 24 - 8 * (b % 4) & 255) << 24 - 8 * ( (d + b) % 4);
else if (65535 < c.length) for (b = 0; b < a; b += 4) e[d + b >>> 2] = c[b >>> 2];
else e.push.apply (e, c);
this.sigBytes += a;
return this
},
clamp: function () {
var a = this.words,
e = this.sigBytes;
a[e >>> 2] &= 4294967295 << 32 - 8 * (e % 4);
a.length = o.ceil (e / 4)
},
clone: function () {
var a = n.clone.call (this);
a.words = this.words.slice (0);
return a
},
random: function (a) {
for (var e = [], c = 0; c < a; c += 4) e.push (4294967296 * o.random () | 0);
return j.create (e, a)
}
}),
k = l.enc = {},
r = k.Hex = {
stringify: function (a) {
for (var e = a.words,
a = a.sigBytes,
c = [], d = 0; d < a; d++) {
var b = e[d >>> 2] >>> 24 - 8 * (d % 4) & 255;
c.push ( (b >>> 4).toString (16));
c.push ( (b & 15).toString (16))
}
return c.join ("")
},
parse: function (a) {
for (var b = a.length,
c = [], d = 0; d < b; d += 2) c[d >>> 3] |= parseInt (a.substr (d, 2), 16) << 24 - 4 * (d % 8);
return j.create (c, b / 2)
}
},
p = k.Latin1 = {
stringify: function (a) {
for (var b = a.words,
a = a.sigBytes,
c = [], d = 0; d < a; d++) c.push (String.fromCharCode (b[d >>> 2] >>> 24 - 8 * (d % 4) & 255));
return c.join ("")
},
parse: function (a) {
for (var b = a.length,
c = [], d = 0; d < b; d++) c[d >>> 2] |= (a.charCodeAt (d) & 255) << 24 - 8 * (d % 4);
return j.create (c, b)
}
},
h = k.Utf8 = {
stringify: function (a) {
try {
return decodeURIComponent (escape (p.stringify (a)))
} catch (b) {
throw Error ("Malformed UTF-8 data");
}
},
parse: function (a) {
return p.parse (unescape (encodeURIComponent (a)))
}
},
b = m.BufferedBlockAlgorithm = n.extend ({
reset: function () {
this._data = j.create ();
this._nDataBytes = 0
},
_append: function (a) {
"string" == typeof a && (a = h.parse (a));
this._data.concat (a);
this._nDataBytes += a.sigBytes
},
_process: function (a) {
var b = this._data,
c = b.words,
d = b.sigBytes,
f = this.blockSize,
i = d / (4 * f),
i = a ? o.ceil (i) : o.max ( (i | 0) - this._minBufferSize, 0),
a = i * f,
d = o.min (4 * a, d);
if (a) {
for (var h = 0; h < a; h += f) this._doProcessBlock (c, h);
h = c.splice (0, a);
b.sigBytes -= d
}
return j.create (h, d)
},
clone: function () {
var a = n.clone.call (this);
a._data = this._data.clone ();
return a
},
_minBufferSize: 0
});
m.Hasher = b.extend ({
init: function () {
this.reset ()
},
reset: function () {
b.reset.call (this);
this._doReset ()
},
update: function (a) {
this._append (a);
this._process ();
return this
},
finalize: function (a) {
a && this._append (a);
this._doFinalize ();
return this._hash
},
clone: function () {
var a = b.clone.call (this);
a._hash = this._hash.clone ();
return a
},
blockSize: 16,
_createHelper: function (a) {
return function (b, c) {
return a.create (c).finalize (b)
}
},
_createHmacHelper: function (a) {
return function (b, c) {
return f.HMAC.create (a, c).finalize (b)
}
}
});
var f = l.algo = {};
return l
} (Math); (function (o) {
function q (b, f, a, e, c, d, g) {
b = b + (f & a | ~f & e) + c + g;
return (b << d | b >>> 32 - d) + f
}
function l (b, f, a, e, c, d, g) {
b = b + (f & e | a & ~e) + c + g;
return (b << d | b >>> 32 - d) + f
}
function m (b, f, a, e, c, d, g) {
b = b + (f ^ a ^ e) + c + g;
return (b << d | b >>> 32 - d) + f
}
function n (b, f, a, e, c, d, g) {
b = b + (a ^ (f | ~e)) + c + g;
return (b << d | b >>> 32 - d) + f
}
var j = CryptoJS,
k = j.lib,
r = k.WordArray,
k = k.Hasher,
p = j.algo,
h = []; (function () {
for (var b = 0; 64 > b; b++) h[b] = 4294967296 * o.abs (o.sin (b + 1)) | 0
}) ();
p = p.MD5 = k.extend ({
_doReset: function () {
this._hash = r.create ([1732584193, 4023233417, 2562383102, 271733878])
},
_doProcessBlock: function (b, f) {
for (var a = 0; 16 > a; a++) {
var e = f + a,
c = b[e];
b[e] = (c << 8 | c >>> 24) & 16711935 | (c << 24 | c >>> 8) & 4278255360
}
for (var e = this._hash.words,
c = e[0], d = e[1], g = e[2], i = e[3], a = 0; 64 > a; a += 4) 16 > a ? (c = q (c, d, g, i, b[f + a], 7, h[a]), i = q (i, c, d, g, b[f + a + 1], 12, h[a + 1]), g = q (g, i, c, d, b[f + a + 2], 17, h[a + 2]), d = q (d, g, i, c, b[f + a + 3], 22, h[a + 3])) : 32 > a ? (c = l (c, d, g, i, b[f + (a + 1) % 16], 5, h[a]), i = l (i, c, d, g, b[f + (a + 6) % 16], 9, h[a + 1]), g = l (g, i, c, d, b[f + (a + 11) % 16], 14, h[a + 2]), d = l (d, g, i, c, b[f + a % 16], 20, h[a + 3])) : 48 > a ? (c = m (c, d, g, i, b[f + (3 * a + 5) % 16], 4, h[a]), i = m (i, c, d, g, b[f + (3 * a + 8) % 16], 11, h[a + 1]), g = m (g, i, c, d, b[f + (3 * a + 11) % 16], 16, h[a + 2]), d = m (d, g, i, c, b[f + (3 * a + 14) % 16], 23, h[a + 3])) : (c = n (c, d, g, i, b[f + 3 * a % 16], 6, h[a]), i = n (i, c, d, g, b[f + (3 * a + 7) % 16], 10, h[a + 1]), g = n (g, i, c, d, b[f + (3 * a + 14) % 16], 15, h[a + 2]), d = n (d, g, i, c, b[f + (3 * a + 5) % 16], 21, h[a + 3]));
e[0] = e[0] + c | 0;
e[1] = e[1] + d | 0;
e[2] = e[2] + g | 0;
e[3] = e[3] + i | 0
},
_doFinalize: function () {
var b = this._data,
f = b.words,
a = 8 * this._nDataBytes,
e = 8 * b.sigBytes;
f[e >>> 5] |= 128 << 24 - e % 32;
f[ (e + 64 >>> 9 << 4) + 14] = (a << 8 | a >>> 24) & 16711935 | (a << 24 | a >>> 8) & 4278255360;
b.sigBytes = 4 * (f.length + 1);
this._process ();
b = this._hash.words;
for (f = 0; 4 > f; f++) a = b[f],
b[f] = (a << 8 | a >>> 24) & 16711935 | (a << 24 | a >>> 8) & 4278255360
}
});
j.MD5 = k._createHelper (p);
j.HmacMD5 = k._createHmacHelper (p)
}) (Math);
function test (pad) {
var md5Password = CryptoJS.MD5 (pad + "zol") + ' ';
return md5Password;
}




调用方式test("需要加密的密码")

结帖率:96% (50/52)

签到天数: 11 天

发表于 2019-6-3 23:48:48 | 显示全部楼层   湖南省长沙市
很好很强悍,坚持下去哦~
回复 支持 反对

使用道具 举报

结帖率:0% (0/2)
 楼主| 发表于 2019-4-21 20:47:14 | 显示全部楼层   江苏省镇江市

var md5Password = CryptoJS.MD5 (pad + "zol") + ' ';代碼 里已经加了   所以直接调用加密码即可
回复 支持 反对

使用道具 举报

结帖率:0% (0/2)
 楼主| 发表于 2019-4-21 20:46:52 | 显示全部楼层   江苏省镇江市
小梦想zzZ 发表于 2019-4-21 13:01
取数据摘要(pwd+"zol")

var md5Password = CryptoJS.MD5 (pad + "zol") + ' ';代碼 里已经加了   所以直接调用pwd即可
回复 支持 反对

使用道具 举报

结帖率:100% (4/4)
发表于 2019-4-21 13:01:41 | 显示全部楼层   江西省南昌市
取数据摘要(pwd+"zol")
回复 支持 反对

使用道具 举报

结帖率:18% (2/11)
发表于 2019-4-21 10:05:22 | 显示全部楼层   广东省韶关市
取md5(密码+"zol")
回复 支持 反对

使用道具 举报

结帖率:25% (4/16)
发表于 2019-4-21 08:39:29 高大上手机用户 | 显示全部楼层   贵州省安顺市
谢谢分享66666
回复 支持 反对

使用道具 举报

头像被屏蔽

结帖率:86% (12/14)
发表于 2019-4-21 04:57:08 | 显示全部楼层   浙江省绍兴市
https://bbs.125.la/forum.php?mod=viewthread&tid=14344845&extra=       //我记得我也有中关村的  不知道丢哪呢
回复 支持 反对

使用道具 举报

结帖率:0% (0/2)
 楼主| 发表于 2019-4-21 01:23:22 | 显示全部楼层   江苏省镇江市
11111111111111
回复 支持 反对

使用道具 举报

您需要登录后才可以回帖 登录 | 注册

本版积分规则 致发广告者

发布主题 收藏帖子 返回列表

sitemap| 易语言源码| 易语言教程| 易语言论坛| 易语言模块| 手机版| 广告投放| 精易论坛
拒绝任何人以任何形式在本论坛发表与中华人民共和国法律相抵触的言论,本站内容均为会员发表,并不代表精易立场!
论坛帖子内容仅用于技术交流学习和研究的目的,严禁用于非法目的,否则造成一切后果自负!如帖子内容侵害到你的权益,请联系我们!
防范网络诈骗,远离网络犯罪 违法和不良信息举报电话0663-3422125,QQ: 793400750,邮箱:wp@125.la
Powered by Discuz! X3.4 揭阳市揭东区精易科技有限公司 ( 粤ICP备12094385号-1) 粤公网安备 44522102000125 增值电信业务经营许可证 粤B2-20192173

快速回复 返回顶部 返回列表