精易论坛
标题:
js大神们快来帮忙修改代码啦- -
[打印本页]
作者:
挥剑い为红颜
时间:
2013-5-4 12:00
标题:
js大神们快来帮忙修改代码啦- -
本帖最后由 挥剑い为红颜 于 2013-5-4 12:29 编辑
下面是115网盘最新的js加密算法
可以清晰的看出加密方式是:
加密结果=sha1(sha1(sha1(密码)+账号)+验证码)
但是里面使用了 window函数 使用发条js-ed调试 会发现没有函数可以调用
求指点 求修改..
/**
* User: linweilong(TGL)
* Date: 2013-04-18 13:26
*/
;
(function() {
var common;
if (!window["Common"]) {
common = window["Common"] = {};
} else {
common = window["Common"];
}
if (!common.passportUrl) {
common.passportUrl = "";
}
/**
* 文本框有内容的时候隐藏对应的label
*/
;
(function() {
var doms = [], labs = [], timer = null;
/**
* 文本框有内容的时候隐藏对应的label
* @param domIds jquery对象 #id数组 #id逗号分隔
*/
common.bindLabelHide = function(domIds, labLs) {
var tmp = domIds.jquery ? domIds : domIds.join ? $$$$$$$$$$$$$$$$(domIds.join(",")) : $$$$$$$$$$$$$$$$(domIds);
if (labLs) {
labLs = labLs.jquery ? labLs : labLs.join ? $$$$$$$$$$$$$$$$(labLs.join(",")) : $$$$$$$$$$$$$$$$(labLs);
for (var i = 0, c = tmp.length; i < c; i++) {
doms.push(tmp.eq(i));
labs.push(labLs.eq(i));
}
} else {
tmp.each(function() {
var lab = $$$$$$$$$$$$$$$$("[for=" + this.id + "]");
if (lab.length > 0)
{
doms.push($$$$$$$$$$$$$$$$(this));
labs.push(lab);
}
});
}
if (!timer) {
timer = setInterval(function() {
for (var i = 0, c = doms.length; i < c; i++)
{
try {
labs[i][doms[i].val() == "" ? "show" : "hide"]();
} catch (e) {
}
}
}, 50);
}
}
}());
/**
* sha1相关
*/
;
(function() {
var sha1 = common.sha1 = function(str, raw)
{
var hexcase = 0;
var chrsz = 8;
str = utf16to8(str);
function utf16to8(str)
{
var out, i, len, c;
out = "";
len = str.length;
for (i = 0; i < len; i++)
{
c = str.charCodeAt(i);
if ((c >= 0x0001) && (c <= 0x007F))
{
out += str.charAt(i);
}
else if (c > 0x07FF)
{
out += String.fromCharCode(0xE0 | ((c >> 12) & 0x0F));
out += String.fromCharCode(0x80 | ((c >> 6) & 0x3F));
out += String.fromCharCode(0x80 | ((c >> 0) & 0x3F));
}
else
{
out += String.fromCharCode(0xC0 | ((c >> 6) & 0x1F));
out += String.fromCharCode(0x80 | ((c >> 0) & 0x3F));
}
}
return out;
}
function hex_sha1(s)
{
return binb2hex(core_sha1(str2binb(s), s.length * chrsz));
}
function str_sha1(s)
{
return binb2str(core_sha1(str2binb(s), s.length * chrsz));
}
function binb2hex(binarray)
{
var hex_tab = hexcase ? "0123456789ABCDEF" : "0123456789abcdef";
var str = "";
for (var i = 0; i < binarray.length * 4; i++)
{
str += hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8 + 4)) & 0xF) +
hex_tab.charAt((binarray[i >> 2] >> ((3 - i % 4) * 8)) & 0xF);
}
return str;
}
function binb2str(bin)
{
var str = "";
var mask = (1 << chrsz) - 1;
for (var i = 0; i < bin.length * 32; i += chrsz)
str += String.fromCharCode((bin[i >> 5] >>> (32 - chrsz - i % 32)) & mask);
return str;
}
function str2binb(str)
{
var bin = Array();
var mask = (1 << chrsz) - 1;
for (var i = 0; i < str.length * chrsz; i += chrsz)
bin[i >> 5] |= (str.charCodeAt(i / chrsz) & mask) << (32 - chrsz - i % 32);
return bin;
}
function safe_add(x, y)
{
var lsw = (x & 0xFFFF) + (y & 0xFFFF);
var msw = (x >> 16) + (y >> 16) + (lsw >> 16);
return (msw << 16) | (lsw & 0xFFFF);
}
function rol(num, cnt)
{
return (num << cnt) | (num >>> (32 - cnt));
}
function sha1_ft(t, b, c, d)
{
if (t < 20)
return (b & c) | ((~b) & d);
if (t < 40)
return b ^ c ^ d;
if (t < 60)
return (b & c) | (b & d) | (c & d);
return b ^ c ^ d;
}
function sha1_kt(t)
{
return (t < 20) ? 1518500249 : (t < 40) ? 1859775393 : (t < 60) ? -1894007588 : -899497514;
}
function core_sha1(x, len)
{
x[len >> 5] |= 0x80 << (24 - len % 32);
x[((len + 64 >> 9) << 4) + 15] = len;
var w = Array(80);
var a = 1732584193;
var b = -271733879;
var c = -1732584194;
var d = 271733878;
var e = -1009589776;
for (var i = 0; i < x.length; i += 16)
{
var olda = a;
var oldb = b;
var oldc = c;
var oldd = d;
var olde = e;
for (var j = 0; j < 80; j++)
{
if (j < 16)
w[j] = x[i + j];
else
w[j] = rol(w[j - 3] ^ w[j - 8] ^ w[j - 14] ^ w[j - 16], 1);
var t = safe_add(safe_add(rol(a, 5), sha1_ft(j, b, c, d)), safe_add(safe_add(e, w[j]), sha1_kt(j)));
e = d;
d = c;
c = rol(b, 30);
b = a;
a = t;
}
a = safe_add(a, olda);
b = safe_add(b, oldb);
c = safe_add(c, oldc);
d = safe_add(d, oldd);
e = safe_add(e, olde);
}
return Array(a, b, c, d, e);
}
if (raw == true)
{
return str_sha1(str);
}
else
{
return hex_sha1(str);
}
}
common.sha1_pwd = function(pwd, account, vcode) {
//return sha1( sha1( hexchar2bin(sha1(pwd))+hexchar2bin(sha1(account)) ) + vcode.toUpperCase());
return sha1(sha1(sha1(pwd) + sha1(account)) + vcode.toUpperCase());
}
}());
复制代码
作者:
栋栋拐
时间:
2013-5-4 12:12
太深奥了,学习一下,
作者:
蟋蟀
时间:
2013-5-4 12:34
《JavaScript专题》第12课:JavaScript-新版115网盘登录分析详解(2013-04-18)
http://125.confly.eu.org/thread-13645247-1-1.html
作者:
蟋蟀
时间:
2013-5-4 12:43
但是方法没变啊。
无非就是
function sha1 (str, raw)
function ha1_pwd (pwd, account, vcode)
这样搞两下就OK了。。。
作者:
蟋蟀
时间:
2013-5-4 12:44
另代你这代码复制的有点多了
* sha1相关
上面的都可以去掉
作者:
‘一叶知秋
时间:
2013-5-4 12:51
你昨夜爽了多少次?
作者:
星辰软件
时间:
2013-5-4 13:22
写个改写就OK了不多说嘿嘿
作者:
jixun66
时间:
2013-5-27 21:41
本帖最后由 jixun66 于 2013-5-27 21:43 编辑
pdata.login["ssoln"] = acount; // 用户名
pdata.login["ssopw"] = Common.sha1_pwd($.trim(pwd), $.trim(acount),pdata.login.ssoext); // 密码算法
pdata.login["ssovcode"] = pdata.login.ssoext; // 验证码
pdata.login["time"] = remember?1:0; // 记住登陆信息
复制代码
Common.sha1_pwd:
function (pwd,account,vcode){
//return sha1( sha1( hexchar2bin(sha1(pwd))+hexchar2bin(sha1(account)) ) + vcode.toUpperCase());
return sha1( sha1(sha1(pwd)+sha1(account) ) + vcode.toUpperCase());
}
复制代码
> sha1 (sha1(sha1(密码)+sha1(登录用户名)) + 大写验证码)
POST到: http:// passport.115.com/?ct=login&ac=ajax&is_ssl=1, 返回类型为 json
欢迎光临 精易论坛 (https://125.confly.eu.org/)
Powered by Discuz! X3.4