js逆向-一个搜索网站的登陆参数加密

目录

• • • 前言
    • 抓包
    • 加密参数分析
    • 复现

前言

本文仅供参考学习，如有侵权请联系本人删除！

抓包

网站：aHR0cHM6Ly9uaWQubmF2ZXIuY29tL25pZGxvZ2luLmxvZ2lu

今天分析一个搜索引擎网站，输入账号密码点击登陆抓包。

返回的数据包很多，找到nidlogin这个包。一看就知道是个登陆的包，点进去看一下。

加密参数分析

其中dynamicKey、encpw和bvsd看着很可疑（bvsd为固定值），翻译一下dynamicKey

是一个密钥，还是动态的。应该在哪个地方有生成，搜索一下。

点进第一个文件，寻找一下

分别打上断点，观察一一下
调用了getObjValue方法得到key。

再步入函数看一下

通过传入input标签的id然后判断是否存在该标签，然后取值。也就是key应该存在于网页的源代码中，通过测试发现每次刷新页面就会改变。所以可以使用正则或css等方式去提取。这一部分分析就已经ok。

再看一下encpw的加密过程，同样在Sources面板中搜索即可。然后分别打下断点，如下图：

也是轻而易举就找到了，打眼一看就是ras加密。只要看一下加密函数中的参数，然后我们用现成的第三方库就可以得到结果了（这里还是建议小伙伴自己动手扣一遍代码）

参数在console中打印一下

通过测试发现sessionkey是变化的，接着找就是了。搜索关键词就可以定位到具体的地方

通过xml请求url然后生成session_keys。了解之后拼接一下url进行请求，每次请求都可以得到不同的数据。

其实在这里就可以看到url的拼接。

最后就是实现rsa加密了。

复现

import requests
import re
import execjsHEADERS = {"user-agent": "Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/103.0.0.0 Safari/537.36",
}def js_code(func, *args):with open('naver.js', 'r', encoding='utf-8') as f:js = f.read()result = execjs.compile(js).call(func, *args)return resultdef get_key():url = "https://nid.naver.com/nidlogin.login"response = requests.get(url, headers=HEADERS)key = re.findall('', response.text, re.S)[0]return keydef get_sessionkey():url = 'https://nid.naver.com/dynamicKey/' + get_key()res = requests.get(url)session_key = res.text.split(',')[0]return session_keysession_key = get_sessionkey()
print(js_code('getPwd', session_key, 'phone', 'pwd'))

const request = require('request');
window = global;
navigator = {userAgent: 'Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/94.0.4606.71 Safari/537.36',appVersion: '5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/94.0.4606.71 Safari/537.36'
};function BigInteger(a, b, c) {if (a != null)if ("number" == typeof a)this.fromNumber(a, b, c);else if (b == null && "string" != typeof a)this.fromString(a, 256);elsethis.fromString(a, b)
}function nbi() {return new BigInteger(null)
}function am1(a, b, c, d, e, f) {while (--f >= 0) {var g = b * this[a++] + c[d] + e;e = Math.floor(g / 67108864);c[d++] = g & 67108863}return e
}function am2(a, b, c, d, e, f) {var g = b & 32767, h = b >> 15;while (--f >= 0) {var i = this[a] & 32767;var j = this[a++] >> 15;var k = h * i + j * g;i = g * i + ((k & 32767) << 15) + c[d] + (e & 1073741823);e = (i >>> 30) + (k >>> 15) + h * j + (e >>> 30);c[d++] = i & 1073741823}return e
}function am3(a, b, c, d, e, f) {var g = b & 16383, h = b >> 14;while (--f >= 0) {var i = this[a] & 16383;var j = this[a++] >> 14;var k = h * i + j * g;i = g * i + ((k & 16383) << 14) + c[d] + e;e = (i >> 28) + (k >> 14) + h * j;c[d++] = i & 268435455}return e
}function int2char(a) {return BI_RM.charAt(a)
}function intAt(a, b) {var c = BI_RC[a.charCodeAt(b)];return c == null ? -1 : c
}function bnpCopyTo(a) {for (var b = this.t - 1; b >= 0; --b)a[b] = this[b];a.t = this.t;a.s = this.s
}function bnpFromInt(a) {this.t = 1;this.s = a < 0 ? -1 : 0;if (a > 0)this[0] = a;else if (a < -1)this[0] = a + DV;elsethis.t = 0
}function nbv(a) {var b = nbi();b.fromInt(a);return b
}function bnpFromString(a, b) {var c;if (b == 16)c = 4;else if (b == 8)c = 3;else if (b == 256)c = 8;else if (b == 2)c = 1;else if (b == 32)c = 5;else if (b == 4)c = 2;else {this.fromRadix(a, b);return}this.t = 0;this.s = 0;var d = a.length, e = false, f = 0;while (--d >= 0) {var g = c == 8 ? a[d] & 255 : intAt(a, d);if (g < 0) {if (a.charAt(d) == "-")e = true;continue}e = false;if (f == 0)this[this.t++] = g;else if (f + c > this.DB) {this[this.t - 1] |= (g & (1 << this.DB - f) - 1) << f;this[this.t++] = g >> this.DB - f} elsethis[this.t - 1] |= g << f;f += c;if (f >= this.DB)f -= this.DB}if (c == 8 && (a[0] & 128) != 0) {this.s = -1;if (f > 0)this[this.t - 1] |= (1 << this.DB - f) - 1 << f}this.clamp();if (e)BigInteger.ZERO.subTo(this, this)
}function bnpClamp() {var a = this.s & this.DM;while (this.t > 0 && this[this.t - 1] == a)--this.t
}function bnToString(a) {if (this.s < 0)return "-" + this.negate().toString(a);var b;if (a == 16)b = 4;else if (a == 8)b = 3;else if (a == 2)b = 1;else if (a == 32)b = 5;else if (a == 4)b = 2;elsereturn this.toRadix(a);var c = (1 << b) - 1, d, e = false, f = "", g = this.t;var h = this.DB - g * this.DB % b;if (g-- > 0) {if (h < this.DB && (d = this[g] >> h) > 0) {e = true;f = int2char(d)}while (g >= 0) {if (h < b) {d = (this[g] & (1 << h) - 1) << b - h;d |= this[--g] >> (h += this.DB - b)} else {d = this[g] >> (h -= b) & c;if (h <= 0) {h += this.DB;--g}}if (d > 0)e = true;if (e)f += int2char(d)}}return e ? f : "0"
}function bnNegate() {var a = nbi();BigInteger.ZERO.subTo(this, a);return a
}function bnAbs() {return this.s < 0 ? this.negate() : this
}function bnCompareTo(a) {var b = this.s - a.s;if (b != 0)return b;var c = this.t;b = c - a.t;if (b != 0)return b;while (--c >= 0)if ((b = this[c] - a[c]) != 0)return b;return 0
}function nbits(a) {var b = 1, c;if ((c = a >>> 16) != 0) {a = c;b += 16}if ((c = a >> 8) != 0) {a = c;b += 8}if ((c = a >> 4) != 0) {a = c;b += 4}if ((c = a >> 2) != 0) {a = c;b += 2}if ((c = a >> 1) != 0) {a = c;b += 1}return b
}function bnBitLength() {if (this.t <= 0)return 0;return this.DB * (this.t - 1) + nbits(this[this.t - 1] ^ this.s & this.DM)
}function bnpDLShiftTo(a, b) {var c;for (c = this.t - 1; c >= 0; --c)b[c + a] = this[c];for (c = a - 1; c >= 0; --c)b[c] = 0;b.t = this.t + a;b.s = this.s
}function bnpDRShiftTo(a, b) {for (var c = a; c < this.t; ++c)b[c - a] = this[c];b.t = Math.max(this.t - a, 0);b.s = this.s
}function bnpLShiftTo(a, b) {var c = a % this.DB;var d = this.DB - c;var e = (1 << d) - 1;var f = Math.floor(a / this.DB), g = this.s << c & this.DM, h;for (h = this.t - 1; h >= 0; --h) {b[h + f + 1] = this[h] >> d | g;g = (this[h] & e) << c}for (h = f - 1; h >= 0; --h)b[h] = 0;b[f] = g;b.t = this.t + f + 1;b.s = this.s;b.clamp()
}function bnpRShiftTo(a, b) {b.s = this.s;var c = Math.floor(a / this.DB);if (c >= this.t) {b.t = 0;return}var d = a % this.DB;var e = this.DB - d;var f = (1 << d) - 1;b[0] = this[c] >> d;for (var g = c + 1; g < this.t; ++g) {b[g - c - 1] |= (this[g] & f) << e;b[g - c] = this[g] >> d}if (d > 0)b[this.t - c - 1] |= (this.s & f) << e;b.t = this.t - c;b.clamp()
}function bnpSubTo(a, b) {var c = 0, d = 0, e = Math.min(a.t, this.t);while (c < e) {d += this[c] - a[c];b[c++] = d & this.DM;d >>= this.DB}if (a.t < this.t) {d -= a.s;while (c < this.t) {d += this[c];b[c++] = d & this.DM;d >>= this.DB}d += this.s} else {d += this.s;while (c < a.t) {d -= a[c];b[c++] = d & this.DM;d >>= this.DB}d -= a.s}b.s = d < 0 ? -1 : 0;if (d < -1)b[c++] = this.DV + d;else if (d > 0)b[c++] = d;b.t = c;b.clamp()
}function bnpMultiplyTo(a, b) {var c = this.abs(), d = a.abs();var e = c.t;b.t = e + d.t;while (--e >= 0)b[e] = 0;for (e = 0; e < d.t; ++e)b[e + c.t] = c.am(0, d[e], b, e, 0, c.t);b.s = 0;b.clamp();if (this.s != a.s)BigInteger.ZERO.subTo(b, b)
}function bnpSquareTo(a) {var b = this.abs();var c = a.t = 2 * b.t;while (--c >= 0)a[c] = 0;for (c = 0; c < b.t - 1; ++c) {var d = b.am(c, b[c], a, 2 * c, 0, 1);if ((a[c + b.t] += b.am(c + 1, 2 * b[c], a, 2 * c + 1, d, b.t - c - 1)) >= b.DV) {a[c + b.t] -= b.DV;a[c + b.t + 1] = 1}}if (a.t > 0)a[a.t - 1] += b.am(c, b[c], a, 2 * c, 0, 1);a.s = 0;a.clamp()
}function bnpDivRemTo(a, b, c) {var d = a.abs();if (d.t <= 0)return;var e = this.abs();if (e.t < d.t) {if (b != null)b.fromInt(0);if (c != null)this.copyTo(c);return}if (c == null)c = nbi();var f = nbi(), g = this.s, h = a.s;var i = this.DB - nbits(d[d.t - 1]);if (i > 0) {d.lShiftTo(i, f);e.lShiftTo(i, c)} else {d.copyTo(f);e.copyTo(c)}var j = f.t;var k = f[j - 1];if (k == 0)return;var l = k * (1 << this.F1) + (j > 1 ? f[j - 2] >> this.F2 : 0);var m = this.FV / l, n = (1 << this.F1) / l, o = 1 << this.F2;var p = c.t, q = p - j, r = b == null ? nbi() : b;f.dlShiftTo(q, r);if (c.compareTo(r) >= 0) {c[c.t++] = 1;c.subTo(r, c)}BigInteger.ONE.dlShiftTo(j, r);r.subTo(f, f);while (f.t < j)f[f.t++] = 0;while (--q >= 0) {var s = c[--p] == k ? this.DM : Math.floor(c[p] * m + (c[p - 1] + o) * n);if ((c[p] += f.am(0, s, c, q, 0, j)) < s) {f.dlShiftTo(q, r);c.subTo(r, c);while (c[p] < --s)c.subTo(r, c)}}if (b != null) {c.drShiftTo(j, b);if (g != h)BigInteger.ZERO.subTo(b, b)}c.t = j;c.clamp();if (i > 0)c.rShiftTo(i, c);if (g < 0)BigInteger.ZERO.subTo(c, c)
}function bnMod(a) {var b = nbi();this.abs().divRemTo(a, null, b);if (this.s < 0 && b.compareTo(BigInteger.ZERO) > 0)a.subTo(b, b);return b
}function Classic(a) {this.m = a
}function cConvert(a) {if (a.s < 0 || a.compareTo(this.m) >= 0)return a.mod(this.m);elsereturn a
}function cRevert(a) {return a
}function cReduce(a) {a.divRemTo(this.m, null, a)
}function cMulTo(a, b, c) {a.multiplyTo(b, c);this.reduce(c)
}function cSqrTo(a, b) {a.squareTo(b);this.reduce(b)
}function bnpInvDigit() {if (this.t < 1)return 0;var a = this[0];if ((a & 1) == 0)return 0;var b = a & 3;b = b * (2 - (a & 15) * b) & 15;b = b * (2 - (a & 255) * b) & 255;b = b * (2 - ((a & 65535) * b & 65535)) & 65535;b = b * (2 - a * b % this.DV) % this.DV;return b > 0 ? this.DV - b : -b
}function Montgomery(a) {this.m = a;this.mp = a.invDigit();this.mpl = this.mp & 32767;this.mph = this.mp >> 15;this.um = (1 << a.DB - 15) - 1;this.mt2 = 2 * a.t
}function montConvert(a) {var b = nbi();a.abs().dlShiftTo(this.m.t, b);b.divRemTo(this.m, null, b);if (a.s < 0 && b.compareTo(BigInteger.ZERO) > 0)this.m.subTo(b, b);return b
}function montRevert(a) {var b = nbi();a.copyTo(b);this.reduce(b);return b
}function montReduce(a) {while (a.t <= this.mt2)a[a.t++] = 0;for (var b = 0; b < this.m.t; ++b) {var c = a[b] & 32767;var d = c * this.mpl + ((c * this.mph + (a[b] >> 15) * this.mpl & this.um) << 15) & a.DM;c = b + this.m.t;a[c] += this.m.am(0, d, a, b, 0, this.m.t);while (a[c] >= a.DV) {a[c] -= a.DV;a[++c]++}}a.clamp();a.drShiftTo(this.m.t, a);if (a.compareTo(this.m) >= 0)a.subTo(this.m, a)
}function montSqrTo(a, b) {a.squareTo(b);this.reduce(b)
}function montMulTo(a, b, c) {a.multiplyTo(b, c);this.reduce(c)
}function bnpIsEven() {return (this.t > 0 ? this[0] & 1 : this.s) == 0
}function bnpExp(a, b) {if (a > 4294967295 || a < 1)return BigInteger.ONE;var c = nbi(), d = nbi(), e = b.convert(this), f = nbits(a) - 1;e.copyTo(c);while (--f >= 0) {b.sqrTo(c, d);if ((a & 1 << f) > 0)b.mulTo(d, e, c);else {var g = c;c = d;d = g}}return b.revert(c)
}function bnModPowInt(a, b) {var c;if (a < 256 || b.isEven())c = new Classic(b);elsec = new Montgomery(b);return this.exp(a, c)
}function Arcfour() {this.i = 0;this.j = 0;this.S = new Array
}function ARC4init(a) {var b, c, d;for (b = 0; b < 256; ++b)this.S[b] = b;c = 0;for (b = 0; b < 256; ++b) {c = c + this.S[b] + a[b % a.length] & 255;d = this.S[b];this.S[b] = this.S[c];this.S[c] = d}this.i = 0;this.j = 0
}function ARC4next() {var a;this.i = this.i + 1 & 255;this.j = this.j + this.S[this.i] & 255;a = this.S[this.i];this.S[this.i] = this.S[this.j];this.S[this.j] = a;return this.S[a + this.S[this.i] & 255]
}function prng_newstate() {return new Arcfour
}function rng_seed_int(a) {rng_pool[rng_pptr++] ^= a & 255;rng_pool[rng_pptr++] ^= a >> 8 & 255;rng_pool[rng_pptr++] ^= a >> 16 & 255;rng_pool[rng_pptr++] ^= a >> 24 & 255;if (rng_pptr >= rng_psize)rng_pptr -= rng_psize
}function rng_seed_time() {rng_seed_int((new Date).getTime())
}function rng_get_byte() {if (rng_state == null) {rng_seed_time();rng_state = prng_newstate();rng_state.init(rng_pool);for (rng_pptr = 0; rng_pptr < rng_pool.length; ++rng_pptr)rng_pool[rng_pptr] = 0;rng_pptr = 0}return rng_state.next()
}function rng_get_bytes(a) {var b;for (b = 0; b < a.length; ++b)a[b] = rng_get_byte()
}function SecureRandom() {
}function parseBigInt(a, b) {return new BigInteger(a, b)
}function linebrk(a, b) {var c = "";var d = 0;while (d + b < a.length) {c += a.substring(d, d + b) + "\n";d += b}return c + a.substring(d, a.length)
}function byte2Hex(a) {if (a < 16)return "0" + a.toString(16);elsereturn a.toString(16)
}function pkcs1pad2(a, b) {if (b < a.length + 11) {alert("Message too long for RSA");return null}var c = new Array;var d = a.length - 1;while (d >= 0 && b > 0)c[--b] = a.charCodeAt(d--);c[--b] = 0;var e = new SecureRandom;var f = new Array;while (b > 2) {f[0] = 0;while (f[0] == 0)e.nextBytes(f);c[--b] = f[0]}c[--b] = 2;c[--b] = 0;return new BigInteger(c)
}function RSAKey() {this.n = null;this.e = 0;this.d = null;this.p = null;this.q = null;this.dmp1 = null;this.dmq1 = null;this.coeff = null
}function RSASetPublic(a, b) {if (a != null && b != null && a.length > 0 && b.length > 0) {this.n = parseBigInt(a, 16);this.e = parseInt(b, 16)} elsealert("Invalid RSA public key")
}function RSADoPublic(a) {return a.modPowInt(this.e, this.n)
}function RSAEncrypt(a) {var b = pkcs1pad2(a, this.n.bitLength() + 7 >> 3);if (b == null)return null;var c = this.doPublic(b);if (c == null)return null;var d = c.toString(16);var e = (this.n.bitLength() + 7 >> 3 << 1) - d.length;while (e-- > 0)d = "0" + d;return d
}function hex2b64(a) {var b;var c;var d = "";for (b = 0; b + 3 <= a.length; b += 3) {c = parseInt(a.substring(b, b + 3), 16);d += b64map.charAt(c >> 6) + b64map.charAt(c & 63)}if (b + 1 == a.length) {c = parseInt(a.substring(b, b + 1), 16);d += b64map.charAt(c << 2)} else if (b + 2 == a.length) {c = parseInt(a.substring(b, b + 2), 16);d += b64map.charAt(c >> 2) + b64map.charAt((c & 3) << 4)}while ((d.length & 3) > 0)d += b64pad;return d
}function b64tohex(a) {var b = "";var c;var d = 0;var e;for (c = 0; c < a.length; ++c) {if (a.charAt(c) == b64pad)break;v = b64map.indexOf(a.charAt(c));if (v < 0)continue;if (d == 0) {b += int2char(v >> 2);e = v & 3;d = 1} else if (d == 1) {b += int2char(e << 2 | v >> 4);e = v & 15;d = 2} else if (d == 2) {b += int2char(e);b += int2char(v >> 2);e = v & 3;d = 3} else {b += int2char(e << 2 | v >> 4);b += int2char(v & 15);d = 0}}if (d == 1)b += int2char(e << 2);return b
}function b64toBA(a) {var b = b64tohex(a);var c;var d = new Array;for (c = 0; 2 * c < b.length; ++c) {d[c] = parseInt(b.substring(2 * c, 2 * c + 2), 16)}return d
}var isIE = navigator.appVersion.indexOf("MSIE") != -1 ? true : false;
var isWin = navigator.appVersion.toLowerCase().indexOf("win") != -1 ? true : false;
var isOpera = navigator.userAgent.indexOf("Opera") != -1 ? true : false;
var dbits;
var canary = 0xdeadbeefcafe;
var j_lm = (canary & 16777215) == 15715070;
if (j_lm && navigator.appName == "Microsoft Internet Explorer") {BigInteger.prototype.am = am2;dbits = 30
} else if (j_lm && navigator.appName != "Netscape") {BigInteger.prototype.am = am1;dbits = 26
} else {BigInteger.prototype.am = am3;dbits = 28
}
BigInteger.prototype.DB = dbits;
BigInteger.prototype.DM = (1 << dbits) - 1;
BigInteger.prototype.DV = 1 << dbits;
var BI_FP = 52;
BigInteger.prototype.FV = Math.pow(2, BI_FP);
BigInteger.prototype.F1 = BI_FP - dbits;
BigInteger.prototype.F2 = 2 * dbits - BI_FP;
var BI_RM = "0123456789abcdefghijklmnopqrstuvwxyz";
var BI_RC = new Array;
var rr, vv;
rr = "0".charCodeAt(0);
for (vv = 0; vv <= 9; ++vv)BI_RC[rr++] = vv;
rr = "a".charCodeAt(0);
for (vv = 10; vv < 36; ++vv)BI_RC[rr++] = vv;
rr = "A".charCodeAt(0);
for (vv = 10; vv < 36; ++vv)BI_RC[rr++] = vv;
Classic.prototype.convert = cConvert;
Classic.prototype.revert = cRevert;
Classic.prototype.reduce = cReduce;
Classic.prototype.mulTo = cMulTo;
Classic.prototype.sqrTo = cSqrTo;
Montgomery.prototype.convert = montConvert;
Montgomery.prototype.revert = montRevert;
Montgomery.prototype.reduce = montReduce;
Montgomery.prototype.mulTo = montMulTo;
Montgomery.prototype.sqrTo = montSqrTo;
BigInteger.prototype.copyTo = bnpCopyTo;
BigInteger.prototype.fromInt = bnpFromInt;
BigInteger.prototype.fromString = bnpFromString;
BigInteger.prototype.clamp = bnpClamp;
BigInteger.prototype.dlShiftTo = bnpDLShiftTo;
BigInteger.prototype.drShiftTo = bnpDRShiftTo;
BigInteger.prototype.lShiftTo = bnpLShiftTo;
BigInteger.prototype.rShiftTo = bnpRShiftTo;
BigInteger.prototype.subTo = bnpSubTo;
BigInteger.prototype.multiplyTo = bnpMultiplyTo;
BigInteger.prototype.squareTo = bnpSquareTo;
BigInteger.prototype.divRemTo = bnpDivRemTo;
BigInteger.prototype.invDigit = bnpInvDigit;
BigInteger.prototype.isEven = bnpIsEven;
BigInteger.prototype.exp = bnpExp;
BigInteger.prototype.toString = bnToString;
BigInteger.prototype.negate = bnNegate;
BigInteger.prototype.abs = bnAbs;
BigInteger.prototype.compareTo = bnCompareTo;
BigInteger.prototype.bitLength = bnBitLength;
BigInteger.prototype.mod = bnMod;
BigInteger.prototype.modPowInt = bnModPowInt;
BigInteger.ZERO = nbv(0);
BigInteger.ONE = nbv(1);
Arcfour.prototype.init = ARC4init;
Arcfour.prototype.next = ARC4next;
var rng_psize = 256;
var rng_state;
var rng_pool;
var rng_pptr;
if (rng_pool == null) {rng_pool = new Array;rng_pptr = 0;var t;if (navigator.appName == "Netscape" && navigator.appVersion < "5" && window.crypto) {var z = window.crypto.random(32);for (t = 0; t < z.length; ++t)rng_pool[rng_pptr++] = z.charCodeAt(t) & 255}while (rng_pptr < rng_psize) {t = Math.floor(65536 * Math.random());rng_pool[rng_pptr++] = t >>> 8;rng_pool[rng_pptr++] = t & 255}rng_pptr = 0;rng_seed_time()
}
SecureRandom.prototype.nextBytes = rng_get_bytes;
RSAKey.prototype.doPublic = RSADoPublic;
RSAKey.prototype.setPublic = RSASetPublic;
RSAKey.prototype.encrypt = RSAEncrypt;function getLenChar(a) {a = a + "";return String.fromCharCode(a.length)
}function getPwd(sessionkey, user, pwd) {var rsa = new RSAKey;var evalue = 'd0c0bdfd2dae46471f18373b26a1e3266c8ad9238a48927559096c956662b95c31d53213785a780ebdca57df6da0185c7486d3bce3d1baf0aaad3c181af85812c93b162ef771499972d6f457debd193584e63ccc31e2d3ead46e4d7a8f3708d5ed757230da1f159f95c3f0a3a0f6dfccaa0fc3dab4b1358d03df35165f419cbf';var nvalue = '010001';rsa.setPublic(evalue, nvalue);// var sessionkey = "0VLO3HSsXvkV81jXovpjEyRWHcVDbl4p";return rsa.encrypt(getLenChar(sessionkey) + sessionkey + getLenChar(user) + user + getLenChar(pwd) + pwd);};

本文来自互联网用户投稿，文章观点仅代表作者本人，不代表本站立场，不承担相关法律责任。如若转载，请注明出处。 如若内容造成侵权/违法违规/事实不符，请点击【内容举报】进行投诉反馈！